result_python_qwenplus.json

{
  "abc361c": {
    "problem_description": "Score : 250 points\n\n### Problem Statement\n\nYou are given a sequence A of length N.  \nFreely choose exactly K elements from A and remove them, then concatenate the remaining elements in their original order to form a new sequence B.  \nFind the minimum possible value of this: the maximum value of B minus the minimum value of B.\n\n### Constraints\n\n* All inputs are integers.\n* 1 \\le K < N \\le 2 \\times 10^5\n* 1 \\le A\\_i \\le 10^9\n\n---\n\n### Input\n\nThe input is given from Standard Input in the following format:\n\n```\nN K\nA_1 A_2 \\dots A_N\n\n```\n\n### Output\n\nPrint the answer as an integer.\n\n---",
    "languages": {},
    "results": [
      {
        "submission_id": "67102072",
        "language": "Python",
        "wa_code_path": "abc361c/others/67102072/wa_67102072.py",
        "artifact_dir": "abc361c/others/67102072",
        "status_code": 200,
        "message": "Reduction successful (reused from 67026479)",
        "original_size_bytes": 6904,
        "reduced_size_bytes": 23,
        "failing_case_name": "test_02",
        "execution_time_seconds": 3.08,
        "evaluation": {
          "no_tc": {
            "passed": true,
            "status": "Correct (Passed All Test Cases)",
            "successful_version": 2,
            "versions": [
              {
                "version": 1,
                "passed": false,
                "status": "Failed on 'sample_01': Runtime Error (Exit Code: 1)\nStderr:\nTraceback (most recent call last):\n  File \"/tmp/eval_repair_others_67102072_s3nmqc3e/exe\", line 113, in <module>\n    n, k = map(int, input().split())\nEOFError: EOF when reading a line"
              },
              {
                "version": 2,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 3,
                "passed": false,
                "status": "Wrong Answer on 'sample_01'\n  First line diff:\n    Actual: ''\n    Expected: '2'"
              },
              {
                "version": 4,
                "passed": false,
                "status": "Failed on 'sample_01': Runtime Error (Exit Code: 1)\nStderr:\nTraceback (most recent call last):\n  File \"/tmp/eval_repair_others_67102072_s3nmqc3e/exe\", line 181, in <module>\n    n, k = map(int, input().split())\nEOFError: EOF when reading a line"
              },
              {
                "version": 5,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 6,
                "passed": false,
                "status": "Failed on 'sample_01': Runtime Error (Exit Code: 1)\nStderr:\nTraceback (most recent call last):\n  File \"/tmp/eval_repair_others_67102072_s3nmqc3e/exe\", line 137, in <module>\n    n, k = map(int, input().split())\nEOFError: EOF when reading a line"
              },
              {
                "version": 7,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 8,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 9,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 10,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              }
            ]
          },
          "orig_tc": {
            "passed": true,
            "status": "Correct (Passed All Test Cases)",
            "successful_version": 1,
            "versions": [
              {
                "version": 1,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 2,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 3,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 4,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 5,
                "passed": false,
                "status": "Wrong Answer on 'sample_01'\n  First line diff:\n    Actual: 'inf'\n    Expected: '2'"
              },
              {
                "version": 6,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 7,
                "passed": false,
                "status": "Failed on 'sample_01': Runtime Error (Exit Code: 1)\nStderr:\nTraceback (most recent call last):\n  File \"/tmp/eval_repair_others_67102072_s3nmqc3e/exe\", line 170, in <module>\n    main()\n  File \"/tmp/eval_repair_others_67102072_s3nmqc3e/exe\", line 151, in main\n    for i in range(K + 1):\nNameError: name 'K' is not defined. Did you mean: 'k'?"
              },
              {
                "version": 8,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 9,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 10,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              }
            ]
          },
          "reduced_tc": {
            "passed": true,
            "status": "Correct (Passed All Test Cases)",
            "successful_version": 1,
            "versions": [
              {
                "version": 1,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 2,
                "passed": false,
                "status": "Failed on 'sample_01': Runtime Error (Exit Code: 1)\nStderr:\nTraceback (most recent call last):\n  File \"/tmp/eval_repair_others_67102072_s3nmqc3e/exe\", line 156, in <module>\n    n, k = map(int, input().split())\nEOFError: EOF when reading a line"
              },
              {
                "version": 3,
                "passed": false,
                "status": "Failed on 'sample_01': Runtime Error (Exit Code: 1)\nStderr:\nTraceback (most recent call last):\n  File \"/tmp/eval_repair_others_67102072_s3nmqc3e/exe\", line 236, in <module>\n    n, k = map(int, input().split())\nEOFError: EOF when reading a line"
              },
              {
                "version": 4,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 5,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 6,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 7,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              }
            ]
          },
          "error": null
        }
      }
    ]
  },
  "abc362d": {
    "problem_description": "Score : 425 points\n\n### Problem Statement\n\nYou are given a simple connected undirected graph with N vertices and M edges. Each vertex i\\,(1\\leq i \\leq N) has a weight A\\_i. Each edge j\\,(1\\leq j \\leq M) connects vertices U\\_j and V\\_j bidirectionally and has a weight B\\_j.\n\nThe weight of a path in this graph is defined as the sum of the weights of the vertices and edges that appear on the path.\n\nFor each i=2,3,\\dots,N, solve the following problem:\n\n* Find the minimum weight of a path from vertex 1 to vertex i.\n\n### Constraints\n\n* 2 \\leq N \\leq 2 \\times 10^5\n* N-1 \\leq M \\leq 2 \\times 10^5\n* 1 \\leq U\\_j < V\\_j \\leq N\n* (U\\_i, V\\_i) \\neq (U\\_j, V\\_j) if i \\neq j.\n* The graph is connected.\n* 0 \\leq A\\_i \\leq 10^9\n* 0 \\leq B\\_j \\leq 10^9\n* All input values are integers.\n\n---\n\n### Input\n\nThe input is given from Standard Input in the following format:\n\n```\nN M\nA_1 A_2 \\dots A_N\nU_1 V_1 B_1\nU_2 V_2 B_2\n\\vdots\nU_M V_M B_M\n\n```\n\n### Output\n\nPrint the answers for i=2,3,\\dots,N in a single line, separated by spaces.\n\n---",
    "languages": {},
    "results": [
      {
        "submission_id": "68835857",
        "language": "Python",
        "wa_code_path": "abc362d/others/68835857/wa_68835857.py",
        "artifact_dir": "abc362d/others/68835857",
        "status_code": 200,
        "message": "Reduction successful (reused from 66901805)",
        "original_size_bytes": 3038015,
        "reduced_size_bytes": 22,
        "failing_case_name": "00_sample_01",
        "execution_time_seconds": 11.13,
        "evaluation": {
          "no_tc": {
            "passed": true,
            "status": "Correct (Passed All Test Cases)",
            "successful_version": 1,
            "versions": [
              {
                "version": 1,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 2,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 3,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 4,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 5,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 6,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 7,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 8,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 9,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 10,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              }
            ]
          },
          "orig_tc": {
            "passed": true,
            "status": "Correct (Passed All Test Cases)",
            "successful_version": 1,
            "versions": [
              {
                "version": 1,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 2,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 3,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 4,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 5,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 6,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 7,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 8,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 9,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 10,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              }
            ]
          },
          "reduced_tc": {
            "passed": true,
            "status": "Correct (Passed All Test Cases)",
            "successful_version": 1,
            "versions": [
              {
                "version": 1,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 2,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 3,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 4,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 5,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 6,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 7,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 8,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 9,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 10,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              }
            ]
          },
          "error": null
        }
      }
    ]
  },
  "abc363e": {
    "problem_description": "Score : 450 points\n\n### Problem Statement\n\nThere is an island of size H \\times W, surrounded by the sea.  \nThe island is divided into H rows and W columns of 1 \\times 1 sections, and the elevation of the section at the i-th row from the top and the j-th column from the left (relative to the current sea level) is A\\_{i,j}.\n\nStarting from now, the sea level rises by 1 each year.  \nHere, a section that is vertically or horizontally adjacent to the sea or a section sunk into the sea and has an elevation **not greater than** the sea level will sink into the sea.  \nHere, when a section newly sinks into the sea, any vertically or horizontally adjacent section with an elevation not greater than the sea level will also sink into the sea simultaneously, and this process repeats for the newly sunk sections.\n\nFor each i=1,2,\\ldots, Y, find the area of the island that remains above sea level i years from now.\n\n### Constraints\n\n* 1 \\leq H, W \\leq 1000\n* 1 \\leq Y \\leq 10^5\n* 1 \\leq A\\_{i,j} \\leq 10^5\n* All input values are integers.\n\n---\n\n### Input\n\nThe input is given from Standard Input in the following format:\n\n```\nH W Y\nA_{1,1} A_{1,2} \\ldots A_{1,W}\nA_{2,1} A_{2,2} \\ldots A_{2,W}\n\\vdots\nA_{H,1} A_{H,2} \\ldots A_{H,W}\n\n```\n\n### Output\n\nPrint Y lines.\nThe i-th line (1 \\leq i \\leq Y) should contain the area of the island that remains above sea level i years from now.\n\n---",
    "languages": {},
    "results": [
      {
        "submission_id": "55864666",
        "language": "Python",
        "wa_code_path": "abc363e/others/55864666/wa_55864666.py",
        "artifact_dir": "abc363e/others/55864666",
        "status_code": 200,
        "message": "Reduction successful (reused from 66903504)",
        "original_size_bytes": 5853455,
        "reduced_size_bytes": 16,
        "failing_case_name": "hand_09",
        "execution_time_seconds": 1.94,
        "evaluation": {
          "no_tc": {
            "passed": true,
            "status": "Correct (Passed All Test Cases)",
            "successful_version": 2,
            "versions": [
              {
                "version": 1,
                "passed": false,
                "status": "Wrong Answer on 'example_00'"
              },
              {
                "version": 2,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 3,
                "passed": false,
                "status": "Failed on 'hand_02': Timeout Error"
              },
              {
                "version": 4,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 5,
                "passed": false,
                "status": "Wrong Answer on 'example_00'\n  First line diff:\n    Actual: '8'\n    Expected: '9'"
              },
              {
                "version": 6,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 7,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 8,
                "passed": false,
                "status": "Failed on 'hand_02': Timeout Error"
              },
              {
                "version": 9,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 10,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              }
            ]
          },
          "orig_tc": {
            "passed": true,
            "status": "Correct (Passed All Test Cases)",
            "successful_version": 1,
            "versions": [
              {
                "version": 1,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 2,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 3,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 4,
                "passed": false,
                "status": "Wrong Answer on 'example_00'\n  First line diff:\n    Actual: '8'\n    Expected: '9'"
              },
              {
                "version": 5,
                "passed": false,
                "status": "Wrong Answer on 'example_00'\n  First line diff:\n    Actual: '0'\n    Expected: '9'"
              },
              {
                "version": 6,
                "passed": false,
                "status": "Wrong Answer on 'example_00'\n  First line diff:\n    Actual: '0'\n    Expected: '9'"
              },
              {
                "version": 7,
                "passed": false,
                "status": "Wrong Answer on 'example_00'\n  First line diff:\n    Actual: '0'\n    Expected: '9'"
              },
              {
                "version": 8,
                "passed": false,
                "status": "Wrong Answer on 'example_00'"
              },
              {
                "version": 9,
                "passed": false,
                "status": "Wrong Answer on 'example_00'\n  First line diff:\n    Actual: '1'\n    Expected: '9'"
              },
              {
                "version": 10,
                "passed": false,
                "status": "Wrong Answer on 'example_00'\n  First line diff:\n    Actual: '0'\n    Expected: '9'"
              }
            ]
          },
          "reduced_tc": {
            "passed": true,
            "status": "Correct (Passed All Test Cases)",
            "successful_version": 2,
            "versions": [
              {
                "version": 1,
                "passed": false,
                "status": "Failed on 'example_00': Runtime Error (Exit Code: 1)\nStderr:\nTraceback (most recent call last):\n  File \"/tmp/eval_repair_others_55864666_ug36fft1/exe\", line 62, in <module>\n    main()\n  File \"/tmp/eval_repair_others_55864666_ug36fft1/exe\", line 30, in main\n    heapq.heappush(heap, (A[i][j], i, j))\nNameError: name 'heapq' is not defined. Did you mean: 'heap'?"
              },
              {
                "version": 2,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 3,
                "passed": false,
                "status": "Wrong Answer on 'example_00'\n  First line diff:\n    Actual: '8'\n    Expected: '9'"
              },
              {
                "version": 4,
                "passed": false,
                "status": "Wrong Answer on 'example_00'\n  First line diff:\n    Actual: '8'\n    Expected: '9'"
              },
              {
                "version": 5,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 6,
                "passed": false,
                "status": "Failed on 'example_00': Runtime Error (Exit Code: 1)\nStderr:\nTraceback (most recent call last):\n  File \"/tmp/eval_repair_others_55864666_ug36fft1/exe\", line 80, in <module>\n    main()\n  File \"/tmp/eval_repair_others_55864666_ug36fft1/exe\", line 28, in main\n    heapq.heappush(heap, (A[i][j], i, j))\nNameError: name 'heapq' is not defined. Did you mean: 'heap'?"
              },
              {
                "version": 7,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 8,
                "passed": false,
                "status": "Wrong Answer on 'example_00'\n  First line diff:\n    Actual: '8'\n    Expected: '9'"
              },
              {
                "version": 9,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 10,
                "passed": false,
                "status": "Wrong Answer on 'example_00'\n  First line diff:\n    Actual: '8'\n    Expected: '9'"
              }
            ]
          },
          "error": null
        }
      }
    ]
  },
  "abc364d": {
    "problem_description": "Score : 425 points\n\n### Problem Statement\n\nThere are N+Q points A\\_1,\\dots,A\\_N,B\\_1,\\dots,B\\_Q on a number line, where point A\\_i has a coordinate a\\_i and point B\\_j has a coordinate b\\_j.\n\nFor each j=1,2,\\dots,Q, answer the following question:\n\n* Let X be the point among A\\_1,A\\_2,\\dots,A\\_N that is the k\\_j-th closest to point B\\_j. Find the distance between points X and B\\_j.\n  More formally, let d\\_i be the distance between points A\\_i and B\\_j. Sort (d\\_1,d\\_2,\\dots,d\\_N) in ascending order to get the sequence (d\\_1',d\\_2',\\dots,d\\_N'). Find d\\_{k\\_j}'.\n\n### Constraints\n\n* 1 \\leq N, Q \\leq 10^5\n* -10^8 \\leq a\\_i, b\\_j \\leq 10^8\n* 1 \\leq k\\_j \\leq N\n* All input values are integers.\n\n---\n\n### Input\n\nThe input is given from Standard Input in the following format:\n\n```\nN Q\na_1 a_2 \\dots a_N\nb_1 k_1\nb_2 k_2\n\\vdots\nb_Q k_Q\n\n```\n\n### Output\n\nPrint Q lines.\nThe l-th line (1 \\leq l \\leq Q) should contain the answer to the question for j=l as an integer.\n\n---",
    "languages": {},
    "results": [
      {
        "submission_id": "56050302",
        "language": "Python",
        "wa_code_path": "abc364d/others/56050302/wa_56050302.py",
        "artifact_dir": "abc364d/others/56050302",
        "status_code": 200,
        "message": "Reduction successful (reused from 65154456)",
        "original_size_bytes": 2688994,
        "reduced_size_bytes": 29,
        "failing_case_name": "02_minmax_01",
        "execution_time_seconds": 2.9,
        "evaluation": {
          "no_tc": {
            "passed": false,
            "status": "No versions available",
            "successful_version": null,
            "versions": [
              {
                "version": 1,
                "passed": false,
                "status": "Failed on '01_random_00': Timeout Error"
              },
              {
                "version": 2,
                "passed": false,
                "status": "Failed on '01_random_00': Timeout Error"
              },
              {
                "version": 3,
                "passed": false,
                "status": "Failed on '01_random_00': Timeout Error"
              },
              {
                "version": 4,
                "passed": false,
                "status": "Failed on '01_random_00': Timeout Error"
              },
              {
                "version": 5,
                "passed": false,
                "status": "Failed on '01_random_00': Timeout Error"
              },
              {
                "version": 6,
                "passed": false,
                "status": "Failed on '01_random_00': Timeout Error"
              },
              {
                "version": 7,
                "passed": false,
                "status": "Failed on '01_random_00': Timeout Error"
              },
              {
                "version": 8,
                "passed": false,
                "status": "Failed on '01_random_00': Timeout Error"
              },
              {
                "version": 9,
                "passed": false,
                "status": "Failed on '01_random_00': Timeout Error"
              },
              {
                "version": 10,
                "passed": false,
                "status": "Failed on '01_random_00': Timeout Error"
              }
            ]
          },
          "orig_tc": {
            "passed": false,
            "status": "No versions available",
            "successful_version": null,
            "versions": [
              {
                "version": 1,
                "passed": false,
                "status": "Failed on '01_random_00': Timeout Error"
              },
              {
                "version": 2,
                "passed": false,
                "status": "Failed on '01_random_00': Timeout Error"
              },
              {
                "version": 3,
                "passed": false,
                "status": "Failed on '01_random_00': Timeout Error"
              },
              {
                "version": 4,
                "passed": false,
                "status": "Failed on '01_random_00': Timeout Error"
              },
              {
                "version": 5,
                "passed": false,
                "status": "Failed on '01_random_00': Timeout Error"
              },
              {
                "version": 6,
                "passed": false,
                "status": "Failed on '01_random_00': Timeout Error"
              },
              {
                "version": 7,
                "passed": false,
                "status": "Failed on '01_random_00': Timeout Error"
              },
              {
                "version": 8,
                "passed": false,
                "status": "Failed on '01_random_00': Timeout Error"
              },
              {
                "version": 9,
                "passed": false,
                "status": "Failed on '01_random_00': Timeout Error"
              },
              {
                "version": 10,
                "passed": false,
                "status": "Failed on '01_random_00': Timeout Error"
              }
            ]
          },
          "reduced_tc": {
            "passed": true,
            "status": "Correct (Passed All Test Cases)",
            "successful_version": 1,
            "versions": [
              {
                "version": 1,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 2,
                "passed": false,
                "status": "Failed on '01_random_00': Timeout Error"
              },
              {
                "version": 3,
                "passed": false,
                "status": "Failed on '01_random_00': Timeout Error"
              },
              {
                "version": 4,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 5,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 6,
                "passed": false,
                "status": "Failed on '01_random_00': Timeout Error"
              },
              {
                "version": 7,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 8,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 9,
                "passed": false,
                "status": "Failed on '01_random_00': Timeout Error"
              },
              {
                "version": 10,
                "passed": false,
                "status": "Failed on '01_random_00': Timeout Error"
              }
            ]
          },
          "error": null
        }
      }
    ]
  },
  "abc365d": {
    "problem_description": "Score : 400 points\n\n### Problem Statement\n\nTakahashi and Aoki played rock-paper-scissors N times. *[Note: In this game, Rock beats Scissors, Scissors beats Paper, and Paper beats Rock.]*\n\nAoki's moves are represented by a string S of length N consisting of the characters `R`, `P`, and `S`.\nThe i-th character of S indicates Aoki's move in the i-th game: `R` for Rock, `P` for Paper, and `S` for Scissors.\n\nTakahashi's moves satisfy the following conditions:\n\n* Takahashi never lost to Aoki.\n* For i=1,2,\\ldots,N-1, Takahashi's move in the i-th game is different from his move in the (i+1)-th game.\n\nDetermine the maximum number of games Takahashi could have won.\n\nIt is guaranteed that there exists a sequence of moves for Takahashi that satisfies these conditions.\n\n### Constraints\n\n* 1\\leq N\\leq2\\times10 ^ 5\n* S is a string of length N consisting of `R`, `P`, and `S`.\n* N is an integer.\n\n---\n\n### Input\n\nThe input is given from Standard Input in the following format:\n\n```\nN\nS\n\n```\n\n### Output\n\nPrint the maximum number of games Takahashi could have won.\n\n---",
    "languages": {},
    "results": [
      {
        "submission_id": "70306520",
        "language": "Python",
        "wa_code_path": "abc365d/others/70306520/wa_70306520.py",
        "artifact_dir": "abc365d/others/70306520",
        "status_code": 200,
        "message": "Reduction successful (reused from 67225698)",
        "original_size_bytes": 200008,
        "reduced_size_bytes": 4,
        "failing_case_name": "01_random_03",
        "execution_time_seconds": 3.64,
        "evaluation": {
          "no_tc": {
            "passed": true,
            "status": "Correct (Passed All Test Cases)",
            "successful_version": 2,
            "versions": [
              {
                "version": 1,
                "passed": false,
                "status": "Failed on '00_sample_00': Runtime Error (Exit Code: 1)\nStderr:\nTraceback (most recent call last):\n  File \"/tmp/eval_repair_others_70306520_8rpm8m7t/exe\", line 2, in <module>\n    python\nNameError: name 'python' is not defined"
              },
              {
                "version": 2,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 3,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 4,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 5,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 6,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 7,
                "passed": false,
                "status": "Failed on '00_sample_00': Runtime Error (Exit Code: 1)\nStderr:\nTraceback (most recent call last):\n  File \"/tmp/eval_repair_others_70306520_8rpm8m7t/exe\", line 2, in <module>\n    python\nNameError: name 'python' is not defined"
              },
              {
                "version": 8,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 9,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 10,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              }
            ]
          },
          "orig_tc": {
            "passed": true,
            "status": "Correct (Passed All Test Cases)",
            "successful_version": 1,
            "versions": [
              {
                "version": 1,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 2,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 3,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 4,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 5,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 6,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 7,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 8,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 9,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 10,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              }
            ]
          },
          "reduced_tc": {
            "passed": true,
            "status": "Correct (Passed All Test Cases)",
            "successful_version": 1,
            "versions": [
              {
                "version": 1,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 2,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 3,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 4,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 5,
                "passed": false,
                "status": "Wrong Answer on '00_sample_00'\n  First line diff:\n    Actual: '4'\n    Expected: '5'"
              },
              {
                "version": 6,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 7,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 8,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 9,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 10,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              }
            ]
          },
          "error": null
        }
      }
    ]
  },
  "abc366c": {
    "problem_description": "Score : 300 points\n\n### Problem Statement\n\nYou have an empty bag.\nYou are given Q queries, which must be processed in order.\n\nThere are three types of queries.\n\n* `1 x` : Put one ball with the integer x written on it into the bag.\n* `2 x` : Remove one ball with the integer x written on it from the bag and discard it. It is guaranteed that the bag has a ball with the integer x written on it when this query is given.\n* `3` : Print the number of different integers written on the balls in the bag.\n\n### Constraints\n\n* 1 \\leq Q \\leq 2 \\times 10^{5}\n* 1 \\leq x \\leq 10^{6}\n* When a query of the second type is given, the bag has a ball with the integer x written on it.\n* There is at least one query of the third type.\n* All input values are integers.\n\n---\n\n### Input\n\nThe input is given from Standard Input in the following format:\n\n```\nQ\n\\text{query}_1\n\\text{query}_2\n\\vdots\n\\text{query}_Q\n\n```\n\nThe i-th query \\text{query}\\_i is given in one of the following three formats:\n\n```\n1 x\n\n```\n\n```\n2 x\n\n```\n\n```\n3\n\n```\n\n### Output\n\nIf there are K queries of the third type, print K lines.\nThe i-th line (1 \\leq i \\leq K) should contain the answer to the i-th query of the third type.\n\n---",
    "languages": {},
    "results": [
      {
        "submission_id": "70492400",
        "language": "Python",
        "wa_code_path": "abc366c/others/70492400/wa_70492400.py",
        "artifact_dir": "abc366c/others/70492400",
        "status_code": 200,
        "message": "Reduction successful (reused from 66053042)",
        "original_size_bytes": 1088924,
        "reduced_size_bytes": 22,
        "failing_case_name": "01_random_10",
        "execution_time_seconds": 6.76,
        "evaluation": {
          "no_tc": {
            "passed": true,
            "status": "Correct (Passed All Test Cases)",
            "successful_version": 1,
            "versions": [
              {
                "version": 1,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 2,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 3,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 4,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 5,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 6,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 7,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 8,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 9,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 10,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              }
            ]
          },
          "orig_tc": {
            "passed": true,
            "status": "Correct (Passed All Test Cases)",
            "successful_version": 1,
            "versions": [
              {
                "version": 1,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 2,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 3,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 4,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 5,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 6,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 7,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 8,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 9,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 10,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              }
            ]
          },
          "reduced_tc": {
            "passed": true,
            "status": "Correct (Passed All Test Cases)",
            "successful_version": 1,
            "versions": [
              {
                "version": 1,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 2,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 3,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 4,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 5,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 6,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 7,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 8,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 9,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 10,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              }
            ]
          },
          "error": null
        }
      }
    ]
  },
  "abc370d": {
    "problem_description": "Score : 400 points\n\n### Problem Statement\n\nThere is a grid with H rows and W columns. Let (i, j) denote the cell at the i-th row from the top and j-th column from the left.  \nInitially, there is one wall in each cell.  \nAfter processing Q queries explained below in the order they are given, find the number of remaining walls.\n\nIn the q-th query, you are given two integers R\\_q and C\\_q.  \nYou place a bomb at (R\\_q, C\\_q) to destroy walls. As a result, the following process occurs.\n\n* If there is a wall at (R\\_q, C\\_q), destroy that wall and end the process.\n* If there is no wall at (R\\_q, C\\_q), destroy the first walls that appear when looking up, down, left, and right from (R\\_q, C\\_q). More precisely, the following four processes occur simultaneously:\n  + If there exists an i \\lt R\\_q such that a wall exists at (i, C\\_q) and no wall exists at (k, C\\_q) for all i \\lt k \\lt R\\_q, destroy the wall at (i, C\\_q).\n  + If there exists an i \\gt R\\_q such that a wall exists at (i, C\\_q) and no wall exists at (k, C\\_q) for all R\\_q \\lt k \\lt i, destroy the wall at (i, C\\_q).\n  + If there exists a j \\lt C\\_q such that a wall exists at (R\\_q, j) and no wall exists at (R\\_q, k) for all j \\lt k \\lt C\\_q, destroy the wall at (R\\_q, j).\n  + If there exists a j \\gt C\\_q such that a wall exists at (R\\_q, j) and no wall exists at (R\\_q, k) for all C\\_q \\lt k \\lt j, destroy the wall at (R\\_q, j).\n\n### Constraints\n\n* 1 \\leq H, W\n* H \\times W \\leq 4 \\times 10^5\n* 1 \\leq Q \\leq 2 \\times 10^5\n* 1 \\leq R\\_q \\leq H\n* 1 \\leq C\\_q \\leq W\n* All input values are integers.\n\n---\n\n### Input\n\nThe input is given from Standard Input in the following format:\n\n```\nH W Q\nR_1 C_1\nR_2 C_2\n\\vdots\nR_Q C_Q\n\n```\n\n### Output\n\nPrint the number of remaining walls after processing all queries.\n\n---",
    "languages": {},
    "results": [
      {
        "submission_id": "57691504",
        "language": "Python",
        "wa_code_path": "abc370d/others/57691504/wa_57691504.py",
        "artifact_dir": "abc370d/others/57691504",
        "status_code": 200,
        "message": "Reduction successful (reused from 65496614)",
        "original_size_bytes": 1567915,
        "reduced_size_bytes": 10,
        "failing_case_name": "01_random_00",
        "execution_time_seconds": 1.07,
        "evaluation": {
          "no_tc": {
            "passed": true,
            "status": "Correct (Passed All Test Cases)",
            "successful_version": 6,
            "versions": [
              {
                "version": 1,
                "passed": false,
                "status": "Failed on '00_sample_00': Runtime Error (Exit Code: 1)\nStderr:\nTraceback (most recent call last):\n  File \"/tmp/eval_repair_others_57691504_nwnlkn56/exe\", line 177, in <module>\n    main()\n  File \"/tmp/eval_repair_others_57691504_nwnlkn56/exe\", line 63, in main\n    next_c = find_row_next(R_q, C_q)\n  File \"/tmp/eval_repair_others_57691504_nwnlkn56/exe\", line 39, in find_row_next\n    row_next[r][c] = find_row_next(r, row_next[r][c])\n  File \"/tmp/eval_repair_others_57691504_nwnlkn56/exe\", line 39, in find_row_next\n    row_next[r][c] = find_row_next(r, row_next[r][c])\n  File \"/tmp/eval_repair_others_57691504_nwnlkn56/exe\", line 39, in find_row_next\n    row_next[r][c] = find_row_next(r, row_next[r][c])\n  File \"/tmp/eval_repair_others_57691504_nwnlkn56/exe\", line 37, in find_row_next\n    if row_next[r][c] == c:\nIndexError: list index out of range"
              },
              {
                "version": 2,
                "passed": false,
                "status": "Failed on '00_sample_00': Runtime Error (Exit Code: 1)\nStderr:\nTraceback (most recent call last):\n  File \"/tmp/eval_repair_others_57691504_nwnlkn56/exe\", line 149, in <module>\n    main()\n  File \"/tmp/eval_repair_others_57691504_nwnlkn56/exe\", line 136, in main\n    down_neighbor = find_col_down(c, r + 1)\n  File \"/tmp/eval_repair_others_57691504_nwnlkn56/exe\", line 43, in find_col_down\n    if col_down[c][r] != r:\nIndexError: list index out of range"
              },
              {
                "version": 3,
                "passed": false,
                "status": "Wrong Answer on '00_sample_00'\n  First line diff:\n    Actual: '6'\n    Expected: '2'"
              },
              {
                "version": 4,
                "passed": false,
                "status": "Failed on '00_sample_00': Runtime Error (Exit Code: 1)\nStderr:\nTraceback (most recent call last):\n  File \"/tmp/eval_repair_others_57691504_nwnlkn56/exe\", line 115, in <module>\n    main()\n  File \"/tmp/eval_repair_others_57691504_nwnlkn56/exe\", line 43, in main\n    left_neighbor = find_left(R_q, C_q)\n  File \"/tmp/eval_repair_others_57691504_nwnlkn56/exe\", line 20, in find_left\n    left_wall[r][c] = find_left(r, left_wall[r][c])\n  File \"/tmp/eval_repair_others_57691504_nwnlkn56/exe\", line 20, in find_left\n    left_wall[r][c] = find_left(r, left_wall[r][c])\n  File \"/tmp/eval_repair_others_57691504_nwnlkn56/exe\", line 20, in find_left\n    left_wall[r][c] = find_left(r, left_wall[r][c])\n  [Previous line repeated 994 more times]\n  File \"/tmp/eval_repair_others_57691504_nwnlkn56/exe\", line 19, in find_left\n    if left_wall[r][c] != c:\nRecursionError: maximum recursion depth exceeded in comparison"
              },
              {
                "version": 5,
                "passed": false,
                "status": "Wrong Answer on '00_sample_01'\n  First line diff:\n    Actual: '13'\n    Expected: '10'"
              },
              {
                "version": 6,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 7,
                "passed": false,
                "status": "Wrong Answer on '00_sample_00'\n  First line diff:\n    Actual: '6'\n    Expected: '2'"
              },
              {
                "version": 8,
                "passed": false,
                "status": "Wrong Answer on '00_sample_00'\n  First line diff:\n    Actual: '4'\n    Expected: '2'"
              },
              {
                "version": 9,
                "passed": false,
                "status": "Wrong Answer on '00_sample_00'\n  First line diff:\n    Actual: '6'\n    Expected: '2'"
              }
            ]
          },
          "orig_tc": {
            "passed": false,
            "status": "No versions available",
            "successful_version": null,
            "versions": [
              {
                "version": 1,
                "passed": false,
                "status": "Wrong Answer on '00_sample_00'\n  First line diff:\n    Actual: '6'\n    Expected: '2'"
              },
              {
                "version": 2,
                "passed": false,
                "status": "Wrong Answer on '00_sample_00'\n  First line diff:\n    Actual: '4'\n    Expected: '2'"
              },
              {
                "version": 3,
                "passed": false,
                "status": "Wrong Answer on '00_sample_00'\n  First line diff:\n    Actual: '3'\n    Expected: '2'"
              },
              {
                "version": 4,
                "passed": false,
                "status": "Wrong Answer on '00_sample_00'\n  First line diff:\n    Actual: '3'\n    Expected: '2'"
              },
              {
                "version": 5,
                "passed": false,
                "status": "Failed on '01_random_00': Timeout Error"
              },
              {
                "version": 6,
                "passed": false,
                "status": "Wrong Answer on '00_sample_01'\n  First line diff:\n    Actual: '18'\n    Expected: '10'"
              },
              {
                "version": 7,
                "passed": false,
                "status": "Wrong Answer on '00_sample_01'\n  First line diff:\n    Actual: '11'\n    Expected: '10'"
              },
              {
                "version": 8,
                "passed": false,
                "status": "Failed on '00_sample_00': Runtime Error (Exit Code: 1)\nStderr:\nTraceback (most recent call last):\n  File \"/tmp/eval_repair_others_57691504_nwnlkn56/exe\", line 161, in <module>\n    main()\n  File \"/tmp/eval_repair_others_57691504_nwnlkn56/exe\", line 74, in main\n    left = find_next_right(R, C - 1) if C > 1 else 0\n  File \"/tmp/eval_repair_others_57691504_nwnlkn56/exe\", line 45, in find_next_right\n    row_next_right[row][col] = find_next_right(row, row_next_right[row][col])\n  File \"/tmp/eval_repair_others_57691504_nwnlkn56/exe\", line 45, in find_next_right\n    row_next_right[row][col] = find_next_right(row, row_next_right[row][col])\n  File \"/tmp/eval_repair_others_57691504_nwnlkn56/exe\", line 45, in find_next_right\n    row_next_right[row][col] = find_next_right(row, row_next_right[row][col])\n  [Previous line repeated 994 more times]\n  File \"/tmp/eval_repair_others_57691504_nwnlkn56/exe\", line 39, in find_next_right\n    if col >= W:\nRecursionError: maximum recursion depth exceeded in comparison"
              },
              {
                "version": 9,
                "passed": false,
                "status": "Wrong Answer on '00_sample_00'\n  First line diff:\n    Actual: '5'\n    Expected: '2'"
              },
              {
                "version": 10,
                "passed": false,
                "status": "Wrong Answer on '00_sample_01'\n  First line diff:\n    Actual: '15'\n    Expected: '10'"
              }
            ]
          },
          "reduced_tc": {
            "passed": true,
            "status": "Correct (Passed All Test Cases)",
            "successful_version": 6,
            "versions": [
              {
                "version": 1,
                "passed": false,
                "status": "Wrong Answer on '00_sample_00'\n  First line diff:\n    Actual: '3'\n    Expected: '2'"
              },
              {
                "version": 2,
                "passed": false,
                "status": "Wrong Answer on '00_sample_01'\n  First line diff:\n    Actual: '9'\n    Expected: '10'"
              },
              {
                "version": 3,
                "passed": false,
                "status": "Wrong Answer on '00_sample_00'\n  First line diff:\n    Actual: '6'\n    Expected: '2'"
              },
              {
                "version": 4,
                "passed": false,
                "status": "Wrong Answer on '00_sample_00'\n  First line diff:\n    Actual: '6'\n    Expected: '2'"
              },
              {
                "version": 5,
                "passed": false,
                "status": "Failed on '00_sample_00': Runtime Error (Exit Code: 1)\nStderr:\nTraceback (most recent call last):\n  File \"/tmp/eval_repair_others_57691504_nwnlkn56/exe\", line 141, in <module>\n    main()\n  File \"/tmp/eval_repair_others_57691504_nwnlkn56/exe\", line 49, in main\n    left_bound = find_left(R_q, C_q)\n  File \"/tmp/eval_repair_others_57691504_nwnlkn56/exe\", line 24, in find_left\n    left_wall[r][c] = find_left(r, left_wall[r][c])\n  File \"/tmp/eval_repair_others_57691504_nwnlkn56/exe\", line 24, in find_left\n    left_wall[r][c] = find_left(r, left_wall[r][c])\n  File \"/tmp/eval_repair_others_57691504_nwnlkn56/exe\", line 24, in find_left\n    left_wall[r][c] = find_left(r, left_wall[r][c])\n  [Previous line repeated 994 more times]\n  File \"/tmp/eval_repair_others_57691504_nwnlkn56/exe\", line 23, in find_left\n    if left_wall[r][c] != c:\nRecursionError: maximum recursion depth exceeded in comparison"
              },
              {
                "version": 6,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 7,
                "passed": false,
                "status": "Wrong Answer on '00_sample_00'\n  First line diff:\n    Actual: '5'\n    Expected: '2'"
              },
              {
                "version": 8,
                "passed": false,
                "status": "Wrong Answer on '00_sample_00'\n  First line diff:\n    Actual: '6'\n    Expected: '2'"
              },
              {
                "version": 9,
                "passed": false,
                "status": "Failed on '00_sample_00': Runtime Error (Exit Code: 1)\nStderr:\nTraceback (most recent call last):\n  File \"/tmp/eval_repair_others_57691504_nwnlkn56/exe\", line 140, in <module>\n    main()\n  File \"/tmp/eval_repair_others_57691504_nwnlkn56/exe\", line 48, in main\n    left_neighbor = find_left(R, C-1)\n  File \"/tmp/eval_repair_others_57691504_nwnlkn56/exe\", line 24, in find_left\n    left_wall[r][c] = find_left(r, left_wall[r][c])\n  File \"/tmp/eval_repair_others_57691504_nwnlkn56/exe\", line 24, in find_left\n    left_wall[r][c] = find_left(r, left_wall[r][c])\n  File \"/tmp/eval_repair_others_57691504_nwnlkn56/exe\", line 24, in find_left\n    left_wall[r][c] = find_left(r, left_wall[r][c])\n  [Previous line repeated 994 more times]\n  File \"/tmp/eval_repair_others_57691504_nwnlkn56/exe\", line 23, in find_left\n    if left_wall[r][c] != c:\nRecursionError: maximum recursion depth exceeded in comparison"
              },
              {
                "version": 10,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              }
            ]
          },
          "error": null
        }
      }
    ]
  },
  "abc371d": {
    "problem_description": "Score : 350 points\n\n### Problem Statement\n\nThere are N villages on a number line. The i-th village is located at coordinate X\\_i, and has P\\_i villagers.\n\nAnswer Q queries. The i-th query is in the following format:\n\n* Given integers L\\_i and R\\_i, find the total number of villagers living in villages located between coordinates L\\_i and R\\_i, inclusive.\n\n### Constraints\n\n* 1\\leq N,Q\\leq 2\\times 10^5\n* -10^9\\leq X\\_1 < X\\_2 < \\ldots < X\\_N \\leq 10^9\n* 1\\leq P\\_i\\leq 10^9\n* -10^9\\leq L\\_i \\leq R\\_i \\leq 10^9\n* All input values are integers.\n\n---\n\n### Input\n\nThe input is given from Standard Input in the following format:\n\n```\nN\nX_1 \\ldots X_N\nP_1 \\ldots P_N\nQ\nL_1 R_1\n\\vdots\nL_Q R_Q\n\n```\n\n### Output\n\nPrint Q lines.\n\nThe i-th line(1\\leq i \\leq Q) should contain the answer to the i-th query.\n\n---",
    "languages": {},
    "results": [
      {
        "submission_id": "57880312",
        "language": "Python",
        "wa_code_path": "abc371d/others/57880312/wa_57880312.py",
        "artifact_dir": "abc371d/others/57880312",
        "status_code": 200,
        "message": "Reduction successful (reused from 66715307)",
        "original_size_bytes": 8211979,
        "reduced_size_bytes": 43,
        "failing_case_name": "01_test_01",
        "execution_time_seconds": 3.19,
        "evaluation": {
          "no_tc": {
            "passed": true,
            "status": "Correct (Passed All Test Cases)",
            "successful_version": 1,
            "versions": [
              {
                "version": 1,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 2,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 3,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 4,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 5,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 6,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 7,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 8,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 9,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 10,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              }
            ]
          },
          "orig_tc": {
            "passed": true,
            "status": "Correct (Passed All Test Cases)",
            "successful_version": 1,
            "versions": [
              {
                "version": 1,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 2,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 3,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 4,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 5,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 6,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 7,
                "passed": false,
                "status": "Wrong Answer on '00_sample_01'\n  First line diff:\n    Actual: '0'\n    Expected: '1'"
              },
              {
                "version": 8,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 9,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 10,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              }
            ]
          },
          "reduced_tc": {
            "passed": true,
            "status": "Correct (Passed All Test Cases)",
            "successful_version": 1,
            "versions": [
              {
                "version": 1,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 2,
                "passed": false,
                "status": "Failed on '00_sample_01': Runtime Error (Exit Code: 1)\nStderr:\nTraceback (most recent call last):\n  File \"/tmp/eval_repair_others_57880312_5y0d6wau/exe\", line 35, in <module>\n    main()\n  File \"/tmp/eval_repair_others_57880312_5y0d6wau/exe\", line 21, in main\n    for i in range(Q):\nNameError: name 'Q' is not defined"
              },
              {
                "version": 3,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 4,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 5,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 6,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 7,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 8,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 9,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 10,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              }
            ]
          },
          "error": null
        }
      }
    ]
  },
  "abc372e": {
    "problem_description": "Score : 475 points\n\n### Problem Statement\n\nThere is an undirected graph with N vertices and 0 edges. The vertices are numbered 1 to N.\n\nYou are given Q queries to process in order. Each query is of one of the following two types:\n\n* Type 1: Given in the format `1 u v`. Add an edge between vertices u and v.\n* Type 2: Given in the format `2 v k`. Print the k-th largest vertex number among the vertices connected to vertex v. If there are fewer than k vertices connected to v, print `-1`.\n\n### Constraints\n\n* 1 \\leq N, Q \\leq 2 \\times 10^5\n* In a Type 1 query, 1 \\leq u < v \\leq N.\n* In a Type 2 query, 1 \\leq v \\leq N, 1 \\leq k \\leq 10.\n* All input values are integers.\n\n---\n\n### Input\n\nThe input is given from Standard Input in the following format:\n\n```\nN Q\n\\mathrm{query}_1\n\\mathrm{query}_2\n\\vdots\n\\mathrm{query}_Q\n\n```\n\nHere, \\mathrm{query}\\_i is the i-th query and is given in one of the following formats:\n\n```\n1 u v\n\n```\n\n```\n2 v k\n\n```\n\n### Output\n\nLet q be the number of Type 2 queries. Print q lines.\nThe i-th line should contain the answer to the i-th Type 2 query.\n\n---",
    "languages": {},
    "results": [
      {
        "submission_id": "67569062",
        "language": "Python",
        "wa_code_path": "abc372e/others/67569062/wa_67569062.py",
        "artifact_dir": "abc372e/others/67569062",
        "status_code": 200,
        "message": "Reduction successful (reused from 65229436)",
        "original_size_bytes": 18610,
        "reduced_size_bytes": 52,
        "failing_case_name": "01_random_02",
        "execution_time_seconds": 27.69,
        "evaluation": {
          "no_tc": {
            "passed": true,
            "status": "Correct (Passed All Test Cases)",
            "successful_version": 1,
            "versions": [
              {
                "version": 1,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 2,
                "passed": false,
                "status": "Failed on '01_random_13': Timeout Error"
              },
              {
                "version": 3,
                "passed": false,
                "status": "Wrong Answer on '00_sample_01'"
              },
              {
                "version": 4,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 5,
                "passed": false,
                "status": "Failed on '01_random_13': Timeout Error"
              },
              {
                "version": 6,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 7,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 8,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 9,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 10,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              }
            ]
          },
          "orig_tc": {
            "passed": true,
            "status": "Correct (Passed All Test Cases)",
            "successful_version": 1,
            "versions": [
              {
                "version": 1,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 2,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 3,
                "passed": false,
                "status": "Wrong Answer on '01_random_04'"
              },
              {
                "version": 4,
                "passed": false,
                "status": "Wrong Answer on '01_random_04'"
              },
              {
                "version": 5,
                "passed": false,
                "status": "Failed on '01_random_02': Runtime Error (Exit Code: 1)\nStderr:\nTraceback (most recent call last):\n  File \"/tmp/eval_repair_others_67569062_5r8h6sba/exe\", line 48, in <module>\n    merged = component_vertices[root_u] + component_vertices[root_v]\nKeyError: 886"
              },
              {
                "version": 6,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 7,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 8,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 9,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 10,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              }
            ]
          },
          "reduced_tc": {
            "passed": true,
            "status": "Correct (Passed All Test Cases)",
            "successful_version": 1,
            "versions": [
              {
                "version": 1,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 2,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 3,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 4,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 5,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 6,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 7,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 8,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 9,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 10,
                "passed": false,
                "status": "Wrong Answer on '01_random_03'"
              }
            ]
          },
          "error": null
        }
      }
    ]
  },
  "abc373e": {
    "problem_description": "Score : 500 points\n\n### Problem Statement\n\nAn election is being held with N candidates numbered 1, 2, \\ldots, N. There are K votes, some of which have been counted so far.\n\nUp until now, candidate i has received A\\_i votes.\n\nAfter all ballots are counted, candidate i (1 \\leq i \\leq N) will be elected if and only if the number of candidates who have received more votes than them is less than M. There may be multiple candidates elected.\n\nFor each candidate, find the minimum number of additional votes they need from the remaining ballots to guarantee their victory regardless of how the other candidates receive votes.\n\nFormally, solve the following problem for each i = 1,2,\\ldots,N.\n\nDetermine if there is a non-negative integer X not exceeding K - \\displaystyle{\\sum\\_{i=1}^{N}} A\\_i satisfying the following condition. If it exists, find the minimum possible such integer.\n\n* If candidate i receives X additional votes, then candidate i will always be elected.\n\n### Constraints\n\n* 1 \\leq M \\leq N \\leq 2 \\times 10^5\n* 1 \\leq K \\leq 10^{12}\n* 0 \\leq A\\_i \\leq 10^{12}\n* \\displaystyle{\\sum\\_{i=1}^{N} A\\_i} \\leq K\n* All input values are integers.\n\n---\n\n### Input\n\nThe input is given from Standard Input in the following format:\n\n```\nN M K\nA_1 A_2 \\ldots A_N\n\n```\n\n### Output\n\nLet C\\_i be the minimum number of additional votes candidate i needs from the remaining ballots to guarantee their victory regardless of how other candidates receive votes. Print C\\_1, C\\_2, \\ldots, C\\_N separated by spaces.\n\nIf candidate i has already secured their victory, then let C\\_i = 0. If candidate i cannot secure their victory under any circumstances, then let C\\_i = -1.\n\n---",
    "languages": {},
    "results": [
      {
        "submission_id": "69612882",
        "language": "Python",
        "wa_code_path": "abc373e/others/69612882/wa_69612882.py",
        "artifact_dir": "abc373e/others/69612882",
        "status_code": 200,
        "message": "Reduction successful (reused from 67058914)",
        "original_size_bytes": 1517326,
        "reduced_size_bytes": 27,
        "failing_case_name": "01_random_01",
        "execution_time_seconds": 7.57,
        "evaluation": {
          "no_tc": {
            "passed": false,
            "status": "No versions available",
            "successful_version": null,
            "versions": [
              {
                "version": 1,
                "passed": false,
                "status": "Wrong Answer on '00_sample_00'\n  First line diff:\n    Actual: '2 3 0 3 0'\n    Expected: '2 -1 1 -1 0'"
              },
              {
                "version": 2,
                "passed": false,
                "status": "Failed on '00_sample_00': Runtime Error (Exit Code: 1)\nStderr:\nTraceback (most recent call last):\n  File \"/tmp/eval_repair_others_69612882_edj5aojk/exe\", line 2, in <module>\n    python\nNameError: name 'python' is not defined"
              },
              {
                "version": 3,
                "passed": false,
                "status": "Failed on '00_sample_00': Runtime Error (Exit Code: 1)\nStderr:\nTraceback (most recent call last):\n  File \"/tmp/eval_repair_others_69612882_edj5aojk/exe\", line 2, in <module>\n    python\nNameError: name 'python' is not defined"
              },
              {
                "version": 4,
                "passed": false,
                "status": "Failed on '01_random_00': Timeout Error"
              },
              {
                "version": 5,
                "passed": false,
                "status": "Wrong Answer on '00_sample_00'\n  First line diff:\n    Actual: '2 2 1 2 0'\n    Expected: '2 -1 1 -1 0'"
              },
              {
                "version": 6,
                "passed": false,
                "status": "Failed on '01_random_00': Timeout Error"
              },
              {
                "version": 7,
                "passed": false,
                "status": "Failed on '00_sample_00': Runtime Error (Exit Code: 1)\nStderr:\nTraceback (most recent call last):\n  File \"/tmp/eval_repair_others_69612882_edj5aojk/exe\", line 2, in <module>\n    python\nNameError: name 'python' is not defined"
              },
              {
                "version": 8,
                "passed": false,
                "status": "Failed on '00_sample_00': Runtime Error (Exit Code: 1)\nStderr:\nTraceback (most recent call last):\n  File \"/tmp/eval_repair_others_69612882_edj5aojk/exe\", line 2, in <module>\n    python\nNameError: name 'python' is not defined"
              }
            ]
          },
          "orig_tc": {
            "passed": false,
            "status": "No versions available",
            "successful_version": null,
            "versions": [
              {
                "version": 1,
                "passed": false,
                "status": "Wrong Answer on '00_sample_00'\n  First line diff:\n    Actual: '2 -1 0 -1 0'\n    Expected: '2 -1 1 -1 0'"
              },
              {
                "version": 2,
                "passed": false,
                "status": "Wrong Answer on '00_sample_01'\n  First line diff:\n    Actual: '80 89 112 118 118 75 113 117 81 107 117 106'\n    Expected: '79 89 111 117 117 74 112 116 80 107 117 106'"
              },
              {
                "version": 3,
                "passed": false,
                "status": "Failed on '00_sample_00': Runtime Error (Exit Code: 1)\nStderr:\nFile \"/tmp/eval_repair_others_69612882_edj5aojk/exe\", line 285\n    else:\n    ^^^^\nSyntaxError: invalid syntax"
              },
              {
                "version": 4,
                "passed": false,
                "status": "Wrong Answer on '00_sample_00'\n  First line diff:\n    Actual: '1 -1 0 -1 0'\n    Expected: '2 -1 1 -1 0'"
              },
              {
                "version": 5,
                "passed": false,
                "status": "Failed on '01_random_00': Timeout Error"
              },
              {
                "version": 6,
                "passed": false,
                "status": "Wrong Answer on '00_sample_00'\n  First line diff:\n    Actual: '1 -1 0 -1 0'\n    Expected: '2 -1 1 -1 0'"
              },
              {
                "version": 7,
                "passed": false,
                "status": "Wrong Answer on '00_sample_00'\n  First line diff:\n    Actual: '1 -1 0 -1 0'\n    Expected: '2 -1 1 -1 0'"
              },
              {
                "version": 8,
                "passed": false,
                "status": "Wrong Answer on '00_sample_01'\n  First line diff:\n    Actual: '79 89 111 117 117 77 112 116 80 107 117 106'\n    Expected: '79 89 111 117 117 74 112 116 80 107 117 106'"
              },
              {
                "version": 9,
                "passed": false,
                "status": "Failed on '01_random_00': Timeout Error"
              },
              {
                "version": 10,
                "passed": false,
                "status": "Wrong Answer on '00_sample_00'\n  First line diff:\n    Actual: '2 -1 0 -1 0'\n    Expected: '2 -1 1 -1 0'"
              }
            ]
          },
          "reduced_tc": {
            "passed": false,
            "status": "No versions available",
            "successful_version": null,
            "versions": [
              {
                "version": 1,
                "passed": false,
                "status": "Wrong Answer on '00_sample_00'\n  First line diff:\n    Actual: '2 3 1 3 0'\n    Expected: '2 -1 1 -1 0'"
              },
              {
                "version": 2,
                "passed": false,
                "status": "Wrong Answer on '00_sample_00'\n  First line diff:\n    Actual: '0 1 0 1 0'\n    Expected: '2 -1 1 -1 0'"
              },
              {
                "version": 3,
                "passed": false,
                "status": "Failed on '00_sample_00': Runtime Error (Exit Code: 1)\nStderr:\nTraceback (most recent call last):\n  File \"/tmp/eval_repair_others_69612882_edj5aojk/exe\", line 2, in <module>\n    python\nNameError: name 'python' is not defined"
              },
              {
                "version": 4,
                "passed": false,
                "status": "Wrong Answer on '00_sample_00'\n  First line diff:\n    Actual: '2 3 1 3 0'\n    Expected: '2 -1 1 -1 0'"
              }
            ]
          },
          "error": null
        }
      }
    ]
  },
  "abc374e": {
    "problem_description": "Score : 475 points\n\n### Problem Statement\n\nThe manufacturing of a certain product requires N processes numbered 1,2,\\dots,N.\n\nFor each process i, there are two types of machines S\\_i and T\\_i available for purchase to handle it.\n\n* Machine S\\_i: Can process A\\_i products per day per unit, and costs P\\_i yen per unit.\n* Machine T\\_i: Can process B\\_i products per day per unit, and costs Q\\_i yen per unit.\n\nYou can purchase any number of each machine, possibly zero.\n\nSuppose that process i can handle W\\_i products per day as a result of introducing machines.  \nHere, we define the production capacity as the minimum of W, that is, \\displaystyle \\min^{N}\\_{i=1} W\\_i.\n\nGiven a total budget of X yen, find the maximum achievable production capacity.\n\n### Constraints\n\n* All input values are integers.\n* 1 \\le N \\le 100\n* 1 \\le A\\_i,B\\_i \\le 100\n* 1 \\le P\\_i,Q\\_i,X \\le 10^7\n\n---\n\n### Input\n\nThe input is given from Standard Input in the following format:\n\n```\nN X\nA_1 P_1 B_1 Q_1\nA_2 P_2 B_2 Q_2\n\\vdots\nA_N P_N B_N Q_N\n\n```\n\n### Output\n\nPrint the answer as an integer.\n\n---",
    "languages": {},
    "results": [
      {
        "submission_id": "69396688",
        "language": "Python",
        "wa_code_path": "abc374e/others/69396688/wa_69396688.py",
        "artifact_dir": "abc374e/others/69396688",
        "status_code": 202,
        "message": "Skipped: no reusable reduced_input, using original as reduced",
        "original_size_bytes": 1371,
        "reduced_size_bytes": 1371,
        "failing_case_name": "hand_04",
        "execution_time_seconds": 28.12,
        "evaluation": {
          "no_tc": {
            "passed": false,
            "status": "No versions available",
            "successful_version": null,
            "versions": [
              {
                "version": 1,
                "passed": false,
                "status": "Failed on 'hand_01': Timeout Error"
              },
              {
                "version": 2,
                "passed": false,
                "status": "Failed on 'hand_01': Timeout Error"
              },
              {
                "version": 3,
                "passed": false,
                "status": "Failed on 'hand_01': Timeout Error"
              },
              {
                "version": 4,
                "passed": false,
                "status": "Failed on 'hand_01': Timeout Error"
              },
              {
                "version": 5,
                "passed": false,
                "status": "Failed on 'hand_01': Timeout Error"
              },
              {
                "version": 6,
                "passed": false,
                "status": "Failed on 'hand_01': Timeout Error"
              },
              {
                "version": 7,
                "passed": false,
                "status": "Failed on 'hand_01': Timeout Error"
              },
              {
                "version": 8,
                "passed": false,
                "status": "Failed on 'hand_01': Timeout Error"
              },
              {
                "version": 9,
                "passed": false,
                "status": "Failed on 'hand_01': Timeout Error"
              },
              {
                "version": 10,
                "passed": false,
                "status": "Failed on 'hand_01': Timeout Error"
              }
            ]
          },
          "orig_tc": {
            "passed": false,
            "status": "No versions available",
            "successful_version": null,
            "versions": [
              {
                "version": 1,
                "passed": false,
                "status": "Failed on 'hand_01': Timeout Error"
              },
              {
                "version": 2,
                "passed": false,
                "status": "Wrong Answer on 'hand_01'\n  First line diff:\n    Actual: '100'\n    Expected: '10000000'"
              },
              {
                "version": 3,
                "passed": false,
                "status": "Failed on 'hand_01': Timeout Error"
              },
              {
                "version": 4,
                "passed": false,
                "status": "Failed on 'hand_01': Timeout Error"
              },
              {
                "version": 5,
                "passed": false,
                "status": "Failed on 'hand_01': Timeout Error"
              },
              {
                "version": 6,
                "passed": false,
                "status": "Failed on 'hand_01': Timeout Error"
              },
              {
                "version": 7,
                "passed": false,
                "status": "Failed on 'hand_01': Timeout Error"
              },
              {
                "version": 8,
                "passed": false,
                "status": "Failed on 'hand_01': Timeout Error"
              },
              {
                "version": 9,
                "passed": false,
                "status": "Failed on 'hand_01': Timeout Error"
              },
              {
                "version": 10,
                "passed": false,
                "status": "Wrong Answer on 'hand_03'\n  First line diff:\n    Actual: '99000'\n    Expected: '99009'"
              }
            ]
          },
          "reduced_tc": {
            "passed": false,
            "status": "No versions available",
            "successful_version": null,
            "versions": [
              {
                "version": 1,
                "passed": false,
                "status": "Failed on 'hand_01': Timeout Error"
              },
              {
                "version": 2,
                "passed": false,
                "status": "Failed on 'hand_01': Timeout Error"
              },
              {
                "version": 3,
                "passed": false,
                "status": "Failed on 'hand_01': Timeout Error"
              },
              {
                "version": 4,
                "passed": false,
                "status": "Failed on 'hand_01': Timeout Error"
              },
              {
                "version": 5,
                "passed": false,
                "status": "Failed on 'hand_01': Timeout Error"
              },
              {
                "version": 6,
                "passed": false,
                "status": "Failed on 'hand_01': Timeout Error"
              },
              {
                "version": 7,
                "passed": false,
                "status": "Failed on 'hand_01': Timeout Error"
              },
              {
                "version": 8,
                "passed": false,
                "status": "Failed on 'hand_01': Timeout Error"
              },
              {
                "version": 9,
                "passed": false,
                "status": "Failed on 'hand_01': Timeout Error"
              },
              {
                "version": 10,
                "passed": false,
                "status": "Failed on 'hand_01': Timeout Error"
              }
            ]
          },
          "error": null
        }
      }
    ]
  },
  "abc376c": {
    "problem_description": "Score : 350 points\n\n### Problem Statement\n\nThere are N toys numbered from 1 to N, and N-1 boxes numbered from 1 to N-1.\nToy i\\ (1 \\leq i \\leq N) has a size of A\\_i, and box i\\ (1 \\leq i \\leq N-1) has a size of B\\_i.\n\nTakahashi wants to store all the toys in separate boxes, and he has decided to perform the following steps in order:\n\n1. Choose an arbitrary positive integer x and purchase one box of size x.\n2. Place each of the N toys into one of the N boxes (the N-1 existing boxes plus the newly purchased box).\n   Here, each toy can only be placed in a box whose size is not less than the toy's size, and no box can contain two or more toys.\n\nHe wants to execute step 2 by purchasing a sufficiently large box in step 1, but larger boxes are more expensive, so he wants to purchase the smallest possible box.\n\nDetermine whether there exists a value of x such that he can execute step 2, and if it exists, find the minimum such x.\n\n### Constraints\n\n* 2 \\leq N \\leq 2 \\times 10^5\n* 1 \\leq A\\_i, B\\_i \\leq 10^9\n* All input values are integers.\n\n---\n\n### Input\n\nThe input is given from Standard Input in the following format:\n\n```\nN\nA_1 A_2 \\dots A_N\nB_1 B_2 \\dots B_{N-1}\n\n```\n\n### Output\n\nIf there exists a value of x such that Takahashi can execute step 2, print the minimum such x. Otherwise, print `-1`.\n\n---",
    "languages": {},
    "results": [
      {
        "submission_id": "69408944",
        "language": "Python",
        "wa_code_path": "abc376c/others/69408944/wa_69408944.py",
        "artifact_dir": "abc376c/others/69408944",
        "status_code": 200,
        "message": "Reduction successful (reused from 64962645)",
        "original_size_bytes": 1528091,
        "reduced_size_bytes": 25,
        "failing_case_name": "01_random_01",
        "execution_time_seconds": 4.2,
        "evaluation": {
          "no_tc": {
            "passed": true,
            "status": "Correct (Passed All Test Cases)",
            "successful_version": 2,
            "versions": [
              {
                "version": 1,
                "passed": false,
                "status": "Failed on '04_handmade_03': Timeout Error"
              },
              {
                "version": 2,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 3,
                "passed": false,
                "status": "Wrong Answer on '00_sample_01'\n  First line diff:\n    Actual: '3'\n    Expected: '-1'"
              },
              {
                "version": 4,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 5,
                "passed": false,
                "status": "Failed on '04_handmade_03': Timeout Error"
              },
              {
                "version": 6,
                "passed": false,
                "status": "Wrong Answer on '00_sample_00'\n  First line diff:\n    Actual: '-1'\n    Expected: '3'"
              },
              {
                "version": 7,
                "passed": false,
                "status": "Failed on '04_handmade_03': Timeout Error"
              }
            ]
          },
          "orig_tc": {
            "passed": true,
            "status": "Correct (Passed All Test Cases)",
            "successful_version": 1,
            "versions": [
              {
                "version": 1,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 2,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 3,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 4,
                "passed": false,
                "status": "Wrong Answer on '00_sample_01'\n  First line diff:\n    Actual: '3'\n    Expected: '-1'"
              },
              {
                "version": 5,
                "passed": false,
                "status": "Wrong Answer on '00_sample_01'\n  First line diff:\n    Actual: '3'\n    Expected: '-1'"
              },
              {
                "version": 6,
                "passed": false,
                "status": "Wrong Answer on '00_sample_01'\n  First line diff:\n    Actual: '3'\n    Expected: '-1'"
              },
              {
                "version": 7,
                "passed": false,
                "status": "Wrong Answer on '00_sample_01'\n  First line diff:\n    Actual: '3'\n    Expected: '-1'"
              },
              {
                "version": 8,
                "passed": false,
                "status": "Failed on '01_random_00': Timeout Error"
              },
              {
                "version": 9,
                "passed": false,
                "status": "Failed on '02_random2_02': Timeout Error"
              }
            ]
          },
          "reduced_tc": {
            "passed": true,
            "status": "Correct (Passed All Test Cases)",
            "successful_version": 5,
            "versions": [
              {
                "version": 1,
                "passed": false,
                "status": "Failed on '00_sample_01': Runtime Error (Exit Code: 1)\nStderr:\nTraceback (most recent call last):\n  File \"/tmp/eval_repair_others_69408944_2mvp7xew/exe\", line 65, in <module>\n    prefix_ok[j+1] = False\nIndexError: list assignment index out of range"
              },
              {
                "version": 2,
                "passed": false,
                "status": "Wrong Answer on '00_sample_00'\n  First line diff:\n    Actual: '-1'\n    Expected: '3'"
              },
              {
                "version": 3,
                "passed": false,
                "status": "Failed on '00_sample_00': Runtime Error (Exit Code: 1)\nStderr:\nTraceback (most recent call last):\n  File \"/tmp/eval_repair_others_69408944_2mvp7xew/exe\", line 207, in <module>\n    N = int(input())\nEOFError: EOF when reading a line"
              },
              {
                "version": 4,
                "passed": false,
                "status": "Failed on '01_random_02': Timeout Error"
              },
              {
                "version": 5,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 6,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 7,
                "passed": false,
                "status": "Wrong Answer on '00_sample_00'\n  First line diff:\n    Actual: '-1'\n    Expected: '3'"
              }
            ]
          },
          "error": null
        }
      }
    ]
  },
  "abc376e": {
    "problem_description": "Score : 475 points\n\n### Problem Statement\n\nYou are given sequences of length N: A = (A\\_1, A\\_2, \\dots, A\\_N) and B = (B\\_1, B\\_2, \\dots, B\\_N).  \nLet S be a subset of \\lbrace1, 2, \\dots, N\\rbrace of size K.\nHere, find the minimum possible value of the following expression:\n\n\\displaystyle \\left(\\max\\_{i \\in S} A\\_i\\right) \\times \\left(\\sum\\_{i \\in S} B\\_i\\right).\n\nYou are given T test cases; solve each of them.\n\n### Constraints\n\n* 1 \\leq T \\leq 2 \\times 10^5\n* 1 \\leq K \\leq N \\leq 2 \\times 10^5\n* 1 \\leq A\\_i, B\\_i \\leq 10^6\n* The sum of N over all test cases is at most 2 \\times 10^5.\n* All input values are integers.\n\n---\n\n### Input\n\nThe input is given from Standard Input in the following format. Here, \\mathrm{case}\\_i denotes the i-th test case.\n\n```\nT\n\\mathrm{case}_1\n\\mathrm{case}_2\n\\vdots\n\\mathrm{case}_T\n\n```\n\nEach test case is given in the following format:\n\n```\nN K\nA_1 A_2 \\dots A_N\nB_1 B_2 \\dots B_N\n\n```\n\n### Output\n\nPrint T lines. The i-th line should contain the answer for the i-th test case.\n\n---",
    "languages": {},
    "results": [
      {
        "submission_id": "57538391",
        "language": "Python",
        "wa_code_path": "abc376e/others/57538391/wa_57538391.py",
        "artifact_dir": "abc376e/others/57538391",
        "status_code": 200,
        "message": "Reduction successful (reused from 66075558)",
        "original_size_bytes": 2416933,
        "reduced_size_bytes": 10,
        "failing_case_name": "01_n_small_00",
        "execution_time_seconds": 2.76,
        "evaluation": {
          "no_tc": {
            "passed": true,
            "status": "Correct (Passed All Test Cases)",
            "successful_version": 1,
            "versions": [
              {
                "version": 1,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 2,
                "passed": false,
                "status": "Wrong Answer on '00_sample_00'\n  First line diff:\n    Actual: '28'\n    Expected: '42'"
              },
              {
                "version": 3,
                "passed": false,
                "status": "Wrong Answer on '00_sample_00'\n  First line diff:\n    Actual: '28'\n    Expected: '42'"
              },
              {
                "version": 4,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 5,
                "passed": false,
                "status": "Wrong Answer on '00_sample_00'\n  First line diff:\n    Actual: '77'\n    Expected: '42'"
              },
              {
                "version": 6,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 7,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 8,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 9,
                "passed": false,
                "status": "Wrong Answer on '00_sample_00'\n  First line diff:\n    Actual: '78'\n    Expected: '42'"
              },
              {
                "version": 10,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              }
            ]
          },
          "orig_tc": {
            "passed": true,
            "status": "Correct (Passed All Test Cases)",
            "successful_version": 6,
            "versions": [
              {
                "version": 1,
                "passed": false,
                "status": "Wrong Answer on '00_sample_00'\n  First line diff:\n    Actual: '78'\n    Expected: '42'"
              },
              {
                "version": 2,
                "passed": false,
                "status": "Wrong Answer on '00_sample_00'"
              },
              {
                "version": 3,
                "passed": false,
                "status": "Wrong Answer on '01_n_small_03'"
              },
              {
                "version": 4,
                "passed": false,
                "status": "Failed on '02_random_1_00': Timeout Error"
              },
              {
                "version": 5,
                "passed": false,
                "status": "Failed on '02_random_1_00': Timeout Error"
              },
              {
                "version": 6,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 7,
                "passed": false,
                "status": "Failed on '02_random_1_00': Timeout Error"
              },
              {
                "version": 8,
                "passed": false,
                "status": "Wrong Answer on '00_sample_00'\n  First line diff:\n    Actual: '78'\n    Expected: '42'"
              },
              {
                "version": 9,
                "passed": false,
                "status": "Failed on '02_random_1_00': Timeout Error"
              },
              {
                "version": 10,
                "passed": false,
                "status": "Wrong Answer on '00_sample_00'\n  First line diff:\n    Actual: '78'\n    Expected: '42'"
              }
            ]
          },
          "reduced_tc": {
            "passed": true,
            "status": "Correct (Passed All Test Cases)",
            "successful_version": 1,
            "versions": [
              {
                "version": 1,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 2,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 3,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 4,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 5,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 6,
                "passed": false,
                "status": "Wrong Answer on '00_sample_00'\n  First line diff:\n    Actual: '28'\n    Expected: '42'"
              },
              {
                "version": 7,
                "passed": false,
                "status": "Failed on '00_sample_00': Runtime Error (Exit Code: 1)\nStderr:\nTraceback (most recent call last):\n  File \"/tmp/eval_repair_others_57538391_rdlhwp3h/exe\", line 88, in <module>\n    main()\n  File \"/tmp/eval_repair_others_57538391_rdlhwp3h/exe\", line 82, in main\n    result = solve()\n  File \"/tmp/eval_repair_others_57538391_rdlhwp3h/exe\", line 5, in solve\n    N, K = map(int, input().split())\nEOFError: EOF when reading a line"
              },
              {
                "version": 8,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 9,
                "passed": false,
                "status": "Wrong Answer on '00_sample_00'\n  First line diff:\n    Actual: '78'\n    Expected: '42'"
              }
            ]
          },
          "error": null
        }
      }
    ]
  },
  "abc376d": {
    "problem_description": "Score : 400 points\n\n### Problem Statement\n\nThere is a simple directed graph with N vertices numbered from 1 to N and M edges. The i-th edge (1 \\leq i \\leq M) is a directed edge from vertex a\\_i to vertex b\\_i.  \nDetermine whether there exists a cycle that contains vertex 1, and if it exists, find the minimum number of edges among such cycles.\n\n### Constraints\n\n* 2 \\leq N \\leq 2 \\times 10^5\n* 1 \\leq M \\leq \\min \\left( \\frac{N(N-1)}{2},\\ 2 \\times 10^5 \\right)\n* 1 \\leq a\\_i \\leq N\n* 1 \\leq b\\_i \\leq N\n* a\\_i \\neq b\\_i\n* (a\\_i, b\\_i) \\neq (a\\_j, b\\_j) and (a\\_i, b\\_i) \\neq (b\\_j, a\\_j), if i \\neq j.\n* All input values are integers.\n\n---\n\n### Input\n\nThe input is given from Standard Input in the following format:\n\n```\nN M\na_1 b_1\na_2 b_2\n\\vdots\na_M b_M\n\n```\n\n### Output\n\nIf there exists a cycle that contains vertex 1, print the minimum number of edges among such cycles. Otherwise, print `-1`.\n\n---",
    "languages": {},
    "results": [
      {
        "submission_id": "70172335",
        "language": "Python",
        "wa_code_path": "abc376d/others/70172335/wa_70172335.py",
        "artifact_dir": "abc376d/others/70172335",
        "status_code": 200,
        "message": "Reduction successful (reused from 66500367)",
        "original_size_bytes": 1729652,
        "reduced_size_bytes": 16,
        "failing_case_name": "01_random_07",
        "execution_time_seconds": 10.37,
        "evaluation": {
          "no_tc": {
            "passed": true,
            "status": "Correct (Passed All Test Cases)",
            "successful_version": 1,
            "versions": [
              {
                "version": 1,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 2,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 3,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 4,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 5,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 6,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 7,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 8,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 9,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 10,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              }
            ]
          },
          "orig_tc": {
            "passed": true,
            "status": "Correct (Passed All Test Cases)",
            "successful_version": 1,
            "versions": [
              {
                "version": 1,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 2,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 3,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 4,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 5,
                "passed": false,
                "status": "Failed on '00_sample_00': Runtime Error (Exit Code: 1)\nStderr:\nFile \"/tmp/eval_repair_others_70172335_4v655zuz/exe\", line 48\n    if dist_from_nxt] == INF:\n                    ^\nSyntaxError: unmatched ']'"
              },
              {
                "version": 6,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 7,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 8,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 9,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 10,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              }
            ]
          },
          "reduced_tc": {
            "passed": true,
            "status": "Correct (Passed All Test Cases)",
            "successful_version": 1,
            "versions": [
              {
                "version": 1,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 2,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 3,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 4,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 5,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 6,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 7,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 8,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 9,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 10,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              }
            ]
          },
          "error": null
        }
      }
    ]
  },
  "abc377c": {
    "problem_description": "Score : 300 points\n\n### Problem Statement\n\nThere is a grid of N^2 squares with N rows and N columns.\nLet (i,j) denote the square at the i-th row from the top (1\\leq i\\leq N) and j-th column from the left (1\\leq j\\leq N).\n\nEach square is either empty or has a piece placed on it.\nThere are M pieces placed on the grid, and the k-th (1\\leq k\\leq M) piece is placed on square (a\\_k,b\\_k).\n\nYou want to place your piece on an **empty square** in such a way that it **cannot be captured by any of the existing pieces**.\n\nA piece placed on square (i,j) can capture pieces that satisfy any of the following conditions:\n\n* Placed on square (i+2,j+1)\n* Placed on square (i+1,j+2)\n* Placed on square (i-1,j+2)\n* Placed on square (i-2,j+1)\n* Placed on square (i-2,j-1)\n* Placed on square (i-1,j-2)\n* Placed on square (i+1,j-2)\n* Placed on square (i+2,j-1)\n\nHere, conditions involving non-existent squares are considered to never be satisfied.\n\nFor example, a piece placed on square (4,4) can capture pieces placed on the squares shown in blue in the following figure:\n\n![](https://img.atcoder.jp/abc377/871985d4de26cef302c00cdd6f178880.png)\n\nHow many squares can you place your piece on?\n\n### Constraints\n\n* 1\\leq N\\leq10^9\n* 1\\leq M\\leq2\\times10^5\n* 1\\leq a\\_k\\leq N,1\\leq b\\_k\\leq N\\ (1\\leq k\\leq M)\n* (a\\_k,b\\_k)\\neq(a\\_l,b\\_l)\\ (1\\leq k\\lt l\\leq M)\n* All input values are integers.\n\n---\n\n### Input\n\nThe input is given from Standard Input in the following format:\n\n```\nN M\na_1 b_1\na_2 b_2\n\\vdots\na_M b_M\n\n```\n\n### Output\n\nPrint the number of empty squares where you can place your piece without it being captured by any existing pieces.\n\n---",
    "languages": {},
    "results": [
      {
        "submission_id": "66644611",
        "language": "Python",
        "wa_code_path": "abc377c/others/66644611/wa_66644611.py",
        "artifact_dir": "abc377c/others/66644611",
        "status_code": 200,
        "message": "Reduction successful (reused from 64880220)",
        "original_size_bytes": 1503973,
        "reduced_size_bytes": 13,
        "failing_case_name": "01_random_04",
        "execution_time_seconds": 11.71,
        "evaluation": {
          "no_tc": {
            "passed": true,
            "status": "Correct (Passed All Test Cases)",
            "successful_version": 6,
            "versions": [
              {
                "version": 1,
                "passed": false,
                "status": "Failed on '00_sample_00': Runtime Error (Exit Code: 1)\nStderr:\nTraceback (most recent call last):\n  File \"/tmp/eval_repair_others_66644611_fcm_xu0_/exe\", line 24, in <module>\n    a, b = map(int, input().split())\nEOFError: EOF when reading a line"
              },
              {
                "version": 2,
                "passed": false,
                "status": "Failed on '00_sample_00': Runtime Error (Exit Code: 1)\nStderr:\nTraceback (most recent call last):\n  File \"/tmp/eval_repair_others_66644611_fcm_xu0_/exe\", line 79, in <module>\n    n, m = map(int, input().split())\nEOFError: EOF when reading a line"
              },
              {
                "version": 3,
                "passed": false,
                "status": "Failed on '00_sample_00': Runtime Error (Exit Code: 1)\nStderr:\nTraceback (most recent call last):\n  File \"/tmp/eval_repair_others_66644611_fcm_xu0_/exe\", line 22, in <module>\n    a, b = map(int, input().split())\nEOFError: EOF when reading a line"
              },
              {
                "version": 4,
                "passed": false,
                "status": "Failed on '00_sample_00': Runtime Error (Exit Code: 1)\nStderr:\nTraceback (most recent call last):\n  File \"/tmp/eval_repair_others_66644611_fcm_xu0_/exe\", line 33, in <module>\n    a, b = map(int, input().split())\nEOFError: EOF when reading a line"
              },
              {
                "version": 5,
                "passed": false,
                "status": "Failed on '00_sample_00': Runtime Error (Exit Code: 1)\nStderr:\nTraceback (most recent call last):\n  File \"/tmp/eval_repair_others_66644611_fcm_xu0_/exe\", line 58, in <module>\n    a, b = map(int, input().split())\nEOFError: EOF when reading a line"
              },
              {
                "version": 6,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 7,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 8,
                "passed": false,
                "status": "Failed on '00_sample_00': Runtime Error (Exit Code: 1)\nStderr:\nTraceback (most recent call last):\n  File \"/tmp/eval_repair_others_66644611_fcm_xu0_/exe\", line 71, in <module>\n    a, b = map(int, input().split())  # Wait, we already consumed input!\nEOFError: EOF when reading a line"
              },
              {
                "version": 9,
                "passed": false,
                "status": "Wrong Answer on '00_sample_02'\n  First line diff:\n    Actual: '336'\n    Expected: '338'"
              },
              {
                "version": 10,
                "passed": false,
                "status": "Wrong Answer on '00_sample_00'\n  First line diff:\n    Actual: '44'\n    Expected: '38'"
              }
            ]
          },
          "orig_tc": {
            "passed": true,
            "status": "Correct (Passed All Test Cases)",
            "successful_version": 8,
            "versions": [
              {
                "version": 1,
                "passed": false,
                "status": "Wrong Answer on '00_sample_02'\n  First line diff:\n    Actual: '336'\n    Expected: '338'"
              },
              {
                "version": 2,
                "passed": false,
                "status": "Failed on '00_sample_00': Runtime Error (Exit Code: 1)\nStderr:\nTraceback (most recent call last):\n  File \"/tmp/eval_repair_others_66644611_fcm_xu0_/exe\", line 31, in <module>\n    a, b = map(int, input().split())\nEOFError: EOF when reading a line"
              },
              {
                "version": 3,
                "passed": false,
                "status": "Wrong Answer on '00_sample_00'\n  First line diff:\n    Actual: '64'\n    Expected: '38'"
              },
              {
                "version": 4,
                "passed": false,
                "status": "Wrong Answer on '00_sample_02'\n  First line diff:\n    Actual: '336'\n    Expected: '338'"
              },
              {
                "version": 5,
                "passed": false,
                "status": "Failed on '00_sample_00': Runtime Error (Exit Code: 1)\nStderr:\nTraceback (most recent call last):\n  File \"/tmp/eval_repair_others_66644611_fcm_xu0_/exe\", line 32, in <module>\n    a, b = map(int, input().split())\nEOFError: EOF when reading a line"
              },
              {
                "version": 6,
                "passed": false,
                "status": "Wrong Answer on '00_sample_00'\n  First line diff:\n    Actual: '44'\n    Expected: '38'"
              },
              {
                "version": 7,
                "passed": false,
                "status": "Wrong Answer on '00_sample_00'\n  First line diff:\n    Actual: '64'\n    Expected: '38'"
              },
              {
                "version": 8,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 9,
                "passed": false,
                "status": "Wrong Answer on '00_sample_02'\n  First line diff:\n    Actual: '336'\n    Expected: '338'"
              },
              {
                "version": 10,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              }
            ]
          },
          "reduced_tc": {
            "passed": true,
            "status": "Correct (Passed All Test Cases)",
            "successful_version": 5,
            "versions": [
              {
                "version": 1,
                "passed": false,
                "status": "Failed on '00_sample_00': Runtime Error (Exit Code: 1)\nStderr:\nTraceback (most recent call last):\n  File \"/tmp/eval_repair_others_66644611_fcm_xu0_/exe\", line 61, in <module>\n    a, b = map(int, input().split() if i > 0 else lambda: (a,b))  # This won't work\nTypeError: 'function' object is not iterable"
              },
              {
                "version": 2,
                "passed": false,
                "status": "Failed on '00_sample_00': Runtime Error (Exit Code: 1)\nStderr:\nTraceback (most recent call last):\n  File \"/tmp/eval_repair_others_66644611_fcm_xu0_/exe\", line 41, in <module>\n    n, m = map(int, input_lines[0].split())\nIndexError: list index out of range"
              },
              {
                "version": 3,
                "passed": false,
                "status": "Failed on '00_sample_00': Runtime Error (Exit Code: 1)\nStderr:\nTraceback (most recent call last):\n  File \"/tmp/eval_repair_others_66644611_fcm_xu0_/exe\", line 57, in <module>\n    a, b = map(int, input().split())\nEOFError: EOF when reading a line"
              },
              {
                "version": 4,
                "passed": false,
                "status": "Failed on '00_sample_00': Runtime Error (Exit Code: 1)\nStderr:\nTraceback (most recent call last):\n  File \"/tmp/eval_repair_others_66644611_fcm_xu0_/exe\", line 60, in <module>\n    a, b = map(int, input().split())\nEOFError: EOF when reading a line"
              },
              {
                "version": 5,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 6,
                "passed": false,
                "status": "Failed on '00_sample_00': Runtime Error (Exit Code: 1)\nStderr:\nTraceback (most recent call last):\n  File \"/tmp/eval_repair_others_66644611_fcm_xu0_/exe\", line 35, in <module>\n    a, b = map(int, input().split())\nEOFError: EOF when reading a line"
              },
              {
                "version": 7,
                "passed": false,
                "status": "Wrong Answer on '00_sample_00'\n  First line diff:\n    Actual: '44'\n    Expected: '38'"
              },
              {
                "version": 8,
                "passed": false,
                "status": "Wrong Answer on '00_sample_00'\n  First line diff:\n    Actual: '44'\n    Expected: '38'"
              },
              {
                "version": 9,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 10,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              }
            ]
          },
          "error": null
        }
      }
    ]
  },
  "abc377f": {
    "problem_description": "Score : 550 points\n\n### Problem Statement\n\nThere is a grid of N^2 squares with N rows and N columns.\nLet (i,j) denote the square at the i-th row from the top (1\\leq i\\leq N) and j-th column from the left (1\\leq j\\leq N).\n\nEach square is either empty or has a piece placed on it.\nThere are M pieces placed on the grid, and the k-th (1\\leq k\\leq M) piece is placed on square (a\\_k,b\\_k).\n\nYou want to place your piece on an **empty square** in such a way that it **cannot be captured by any of the existing pieces**.\n\nA piece placed on square (i,j) can capture pieces that satisfy any of the following conditions:\n\n* Placed in row i\n* Placed in column j\n* Placed on any square (a,b)\\ (1\\leq a\\leq N,1\\leq b\\leq N) where i+j=a+b\n* Placed on any square (a,b)\\ (1\\leq a\\leq N,1\\leq b\\leq N) where i-j=a-b\n\nFor example, a piece placed on square (4,4) can capture pieces placed on the squares shown in blue in the following figure:\n\n![](https://img.atcoder.jp/abc377/b0741e9d4d5765a5eeaf1b7f03310f3c.png)\n\nHow many squares can you place your piece on?\n\n### Constraints\n\n* 1\\leq N\\leq10^9\n* 1\\leq M\\leq10^3\n* 1\\leq a\\_k\\leq N,1\\leq b\\_k\\leq N\\ (1\\leq k\\leq M)\n* (a\\_k,b\\_k)\\neq(a\\_l,b\\_l)\\ (1\\leq k\\lt l\\leq M)\n* All input values are integers.\n\n---\n\n### Input\n\nThe input is given from Standard Input in the following format:\n\n```\nN M\na_1 b_1\na_2 b_2\n\\vdots\na_M b_M\n\n```\n\n### Output\n\nPrint the number of empty squares where you can place your piece without it being captured by any existing pieces.\n\n---",
    "languages": {},
    "results": [
      {
        "submission_id": "66221337",
        "language": "Python",
        "wa_code_path": "abc377f/others/66221337/wa_66221337.py",
        "artifact_dir": "abc377f/others/66221337",
        "status_code": 202,
        "message": "Skipped: no reusable reduced_input, using original as reduced",
        "original_size_bytes": 5443,
        "reduced_size_bytes": 5443,
        "failing_case_name": "01_random_03",
        "execution_time_seconds": 23.24,
        "evaluation": {
          "no_tc": {
            "passed": true,
            "status": "Correct (Passed All Test Cases)",
            "successful_version": 2,
            "versions": [
              {
                "version": 1,
                "passed": false,
                "status": "Failed on '00_sample_00': Runtime Error (Exit Code: 1)\nStderr:\nTraceback (most recent call last):\n  File \"/tmp/eval_repair_others_66221337_u1frs6ww/exe\", line 2, in <module>\n    python\nNameError: name 'python' is not defined"
              },
              {
                "version": 2,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 3,
                "passed": false,
                "status": "Failed on '00_sample_00': Runtime Error (Exit Code: 1)\nStderr:\nTraceback (most recent call last):\n  File \"/tmp/eval_repair_others_66221337_u1frs6ww/exe\", line 2, in <module>\n    python\nNameError: name 'python' is not defined"
              },
              {
                "version": 4,
                "passed": false,
                "status": "Failed on '01_random_05': Timeout Error"
              }
            ]
          },
          "orig_tc": {
            "passed": false,
            "status": "No versions available",
            "successful_version": null,
            "versions": [
              {
                "version": 1,
                "passed": false,
                "status": "Failed on '01_random_05': Timeout Error"
              },
              {
                "version": 2,
                "passed": false,
                "status": "Wrong Answer on '00_sample_00'\n  First line diff:\n    Actual: '8'\n    Expected: '2'"
              },
              {
                "version": 3,
                "passed": false,
                "status": "Failed on '01_random_05': Timeout Error"
              },
              {
                "version": 4,
                "passed": false,
                "status": "Failed on '01_random_05': Timeout Error"
              },
              {
                "version": 5,
                "passed": false,
                "status": "Failed on '00_sample_01': Timeout Error"
              },
              {
                "version": 6,
                "passed": false,
                "status": "Failed on '00_sample_00': Runtime Error (Exit Code: 1)\nStderr:\nTraceback (most recent call last):\n  File \"/tmp/eval_repair_others_66221337_u1frs6ww/exe\", line 2, in <module>\n    python\nNameError: name 'python' is not defined"
              },
              {
                "version": 7,
                "passed": false,
                "status": "Failed on '00_sample_01': Timeout Error"
              },
              {
                "version": 8,
                "passed": false,
                "status": "Failed on '00_sample_01': Timeout Error"
              }
            ]
          },
          "reduced_tc": {
            "passed": true,
            "status": "Correct (Passed All Test Cases)",
            "successful_version": 5,
            "versions": [
              {
                "version": 1,
                "passed": false,
                "status": "Failed on '01_random_05': Timeout Error"
              },
              {
                "version": 2,
                "passed": false,
                "status": "Failed on '00_sample_01': Timeout Error"
              },
              {
                "version": 3,
                "passed": false,
                "status": "Failed on '00_sample_01': Timeout Error"
              },
              {
                "version": 4,
                "passed": false,
                "status": "Failed on '00_sample_01': Timeout Error"
              },
              {
                "version": 5,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 6,
                "passed": false,
                "status": "Failed on '01_random_05': Timeout Error"
              },
              {
                "version": 7,
                "passed": false,
                "status": "Wrong Answer on '00_sample_00'\n  First line diff:\n    Actual: '14'\n    Expected: '2'"
              }
            ]
          },
          "error": null
        }
      }
    ]
  },
  "abc367d": {
    "problem_description": "Score : 400 points\n\n### Problem Statement\n\nThere are N rest areas around a lake.  \nThe rest areas are numbered 1, 2, ..., N in clockwise order.  \nIt takes A\\_i steps to walk clockwise from rest area i to rest area i+1 (where rest area N+1 refers to rest area 1).  \nThe minimum number of steps required to walk clockwise from rest area s to rest area t (s \\neq t) is a multiple of M.  \nFind the number of possible pairs (s,t).\n\n### Constraints\n\n* All input values are integers\n* 2 \\le N \\le 2 \\times 10^5\n* 1 \\le A\\_i \\le 10^9\n* 1 \\le M \\le 10^6\n\n---\n\n### Input\n\nThe input is given from Standard Input in the following format:\n\n```\nN M\nA_1 A_2 \\dots A_N\n\n```\n\n### Output\n\nPrint the answer as an integer.\n\n---",
    "languages": {},
    "results": [
      {
        "submission_id": "67591238",
        "language": "Python",
        "wa_code_path": "abc367d/others/67591238/wa_67591238.py",
        "artifact_dir": "abc367d/others/67591238",
        "status_code": 200,
        "message": "Reduction successful (reused from 63090199)",
        "original_size_bytes": 166156,
        "reduced_size_bytes": 11,
        "failing_case_name": "test_03",
        "execution_time_seconds": 3.9,
        "evaluation": {
          "no_tc": {
            "passed": false,
            "status": "No versions available",
            "successful_version": null,
            "versions": [
              {
                "version": 1,
                "passed": false,
                "status": "Wrong Answer on 'sample_01'\n  First line diff:\n    Actual: '2'\n    Expected: '4'"
              }
            ]
          },
          "orig_tc": {
            "passed": false,
            "status": "No versions available",
            "successful_version": null,
            "versions": [
              {
                "version": 1,
                "passed": false,
                "status": "Wrong Answer on 'sample_01'\n  First line diff:\n    Actual: '2'\n    Expected: '4'"
              },
              {
                "version": 2,
                "passed": false,
                "status": "Wrong Answer on 'sample_01'\n  First line diff:\n    Actual: '2'\n    Expected: '4'"
              },
              {
                "version": 3,
                "passed": false,
                "status": "Wrong Answer on 'sample_01'\n  First line diff:\n    Actual: '2'\n    Expected: '4'"
              },
              {
                "version": 4,
                "passed": false,
                "status": "Wrong Answer on 'sample_01'\n  First line diff:\n    Actual: '2'\n    Expected: '4'"
              },
              {
                "version": 5,
                "passed": false,
                "status": "Wrong Answer on 'sample_01'\n  First line diff:\n    Actual: '2'\n    Expected: '4'"
              },
              {
                "version": 6,
                "passed": false,
                "status": "Wrong Answer on 'sample_01'\n  First line diff:\n    Actual: '2'\n    Expected: '4'"
              },
              {
                "version": 7,
                "passed": false,
                "status": "Wrong Answer on 'sample_01'\n  First line diff:\n    Actual: '6'\n    Expected: '4'"
              },
              {
                "version": 8,
                "passed": false,
                "status": "Wrong Answer on 'sample_01'\n  First line diff:\n    Actual: '2'\n    Expected: '4'"
              },
              {
                "version": 9,
                "passed": false,
                "status": "Wrong Answer on 'sample_01'\n  First line diff:\n    Actual: '2'\n    Expected: '4'"
              },
              {
                "version": 10,
                "passed": false,
                "status": "Wrong Answer on 'sample_01'\n  First line diff:\n    Actual: '2'\n    Expected: '4'"
              }
            ]
          },
          "reduced_tc": {
            "passed": false,
            "status": "No versions available",
            "successful_version": null,
            "versions": [
              {
                "version": 1,
                "passed": false,
                "status": "Wrong Answer on 'sample_01'\n  First line diff:\n    Actual: '2'\n    Expected: '4'"
              },
              {
                "version": 2,
                "passed": false,
                "status": "Wrong Answer on 'sample_01'\n  First line diff:\n    Actual: '2'\n    Expected: '4'"
              },
              {
                "version": 3,
                "passed": false,
                "status": "Wrong Answer on 'sample_01'\n  First line diff:\n    Actual: '2'\n    Expected: '4'"
              },
              {
                "version": 4,
                "passed": false,
                "status": "Wrong Answer on 'sample_01'\n  First line diff:\n    Actual: '2'\n    Expected: '4'"
              },
              {
                "version": 5,
                "passed": false,
                "status": "Wrong Answer on 'sample_01'\n  First line diff:\n    Actual: '2'\n    Expected: '4'"
              },
              {
                "version": 6,
                "passed": false,
                "status": "Wrong Answer on 'sample_01'\n  First line diff:\n    Actual: '2'\n    Expected: '4'"
              },
              {
                "version": 7,
                "passed": false,
                "status": "Wrong Answer on 'sample_01'\n  First line diff:\n    Actual: '6'\n    Expected: '4'"
              },
              {
                "version": 8,
                "passed": false,
                "status": "Wrong Answer on 'sample_01'\n  First line diff:\n    Actual: '2'\n    Expected: '4'"
              },
              {
                "version": 9,
                "passed": false,
                "status": "Wrong Answer on 'sample_01'\n  First line diff:\n    Actual: '2'\n    Expected: '4'"
              },
              {
                "version": 10,
                "passed": false,
                "status": "Wrong Answer on 'sample_01'\n  First line diff:\n    Actual: '2'\n    Expected: '4'"
              }
            ]
          },
          "error": null
        }
      }
    ]
  },
  "abc368c": {
    "problem_description": "Score : 300 points\n\n### Problem Statement\n\nYou are playing a game.\n\nThere are N enemies lined up in a row, and the i-th enemy from the front has a health of H\\_i.\n\nYou will repeat the following action until the healths of all enemies become 0 or less, using a variable T initialized to 0.\n\n* Increase T by 1. Then, attack the frontmost enemy with health 1 or more. If T is a multiple of 3, the enemy's health decreases by 3; otherwise, it decreases by 1.\n\nFind the value of T when the healths of all enemies become 0 or less.\n\n### Constraints\n\n* 1 \\leq N \\leq 2\\times 10^5\n* 1 \\leq H\\_i \\leq 10^9\n* All input values are integers.\n\n---\n\n### Input\n\nThe input is given from Standard Input in the following format:\n\n```\nN\nH_1 H_2 \\ldots H_N\n\n```\n\n### Output\n\nPrint the answer.\n\n---",
    "languages": {},
    "results": [
      {
        "submission_id": "70542275",
        "language": "Python",
        "wa_code_path": "abc368c/others/70542275/wa_70542275.py",
        "artifact_dir": "abc368c/others/70542275",
        "status_code": 200,
        "message": "Reduction successful (reused from 66662226)",
        "original_size_bytes": 1978074,
        "reduced_size_bytes": 12,
        "failing_case_name": "random_01",
        "execution_time_seconds": 2.29,
        "evaluation": {
          "no_tc": {
            "passed": false,
            "status": "No versions available",
            "successful_version": null,
            "versions": [
              {
                "version": 1,
                "passed": false,
                "status": "Failed on 'random_01': Timeout Error"
              },
              {
                "version": 2,
                "passed": false,
                "status": "Failed on 'random_01': Timeout Error"
              },
              {
                "version": 3,
                "passed": false,
                "status": "Failed on 'random_01': Timeout Error"
              },
              {
                "version": 4,
                "passed": false,
                "status": "Failed on 'random_01': Timeout Error"
              },
              {
                "version": 5,
                "passed": false,
                "status": "Failed on 'random_01': Timeout Error"
              },
              {
                "version": 6,
                "passed": false,
                "status": "Failed on 'random_01': Timeout Error"
              },
              {
                "version": 7,
                "passed": false,
                "status": "Failed on 'random_01': Timeout Error"
              },
              {
                "version": 8,
                "passed": false,
                "status": "Failed on 'random_01': Timeout Error"
              },
              {
                "version": 9,
                "passed": false,
                "status": "Failed on 'random_01': Timeout Error"
              },
              {
                "version": 10,
                "passed": false,
                "status": "Failed on 'random_01': Timeout Error"
              }
            ]
          },
          "orig_tc": {
            "passed": false,
            "status": "No versions available",
            "successful_version": null,
            "versions": [
              {
                "version": 1,
                "passed": false,
                "status": "Failed on 'random_01': Timeout Error"
              },
              {
                "version": 2,
                "passed": false,
                "status": "Failed on 'random_01': Timeout Error"
              },
              {
                "version": 3,
                "passed": false,
                "status": "Failed on 'random_01': Timeout Error"
              },
              {
                "version": 4,
                "passed": false,
                "status": "Failed on 'random_01': Timeout Error"
              },
              {
                "version": 5,
                "passed": false,
                "status": "Failed on 'random_01': Timeout Error"
              },
              {
                "version": 6,
                "passed": false,
                "status": "Failed on 'random_01': Timeout Error"
              },
              {
                "version": 7,
                "passed": false,
                "status": "Failed on 'random_01': Timeout Error"
              },
              {
                "version": 8,
                "passed": false,
                "status": "Failed on 'random_01': Timeout Error"
              },
              {
                "version": 9,
                "passed": false,
                "status": "Failed on 'random_01': Timeout Error"
              },
              {
                "version": 10,
                "passed": false,
                "status": "Failed on 'random_01': Timeout Error"
              }
            ]
          },
          "reduced_tc": {
            "passed": false,
            "status": "No versions available",
            "successful_version": null,
            "versions": [
              {
                "version": 1,
                "passed": false,
                "status": "Failed on 'random_01': Timeout Error"
              },
              {
                "version": 2,
                "passed": false,
                "status": "Failed on 'random_01': Timeout Error"
              },
              {
                "version": 3,
                "passed": false,
                "status": "Failed on 'random_01': Timeout Error"
              },
              {
                "version": 4,
                "passed": false,
                "status": "Failed on 'random_01': Timeout Error"
              },
              {
                "version": 5,
                "passed": false,
                "status": "Failed on 'random_01': Timeout Error"
              },
              {
                "version": 6,
                "passed": false,
                "status": "Failed on 'random_01': Timeout Error"
              },
              {
                "version": 7,
                "passed": false,
                "status": "Failed on 'random_01': Timeout Error"
              },
              {
                "version": 8,
                "passed": false,
                "status": "Failed on 'random_01': Timeout Error"
              },
              {
                "version": 9,
                "passed": false,
                "status": "Failed on 'random_01': Timeout Error"
              },
              {
                "version": 10,
                "passed": false,
                "status": "Failed on 'random_01': Timeout Error"
              }
            ]
          },
          "error": null
        }
      }
    ]
  },
  "abc369d": {
    "problem_description": "Score : 400 points\n\n### Problem Statement\n\nTakahashi will encounter N monsters in order. The i-th monster (1\\leq i\\leq N) has a strength of A\\_i.\n\nFor each monster, he can choose to either let it go or defeat it.  \nEach action awards him experience points as follows:\n\n* If he lets a monster go, he gains 0 experience points.\n* If he defeats a monster with strength X, he gains X experience points.  \n  If it is an even-numbered defeated monster (2nd, 4th, ...), he gains an additional X experience points.\n\nFind the maximum total experience points he can gain from the N monsters.\n\n### Constraints\n\n* 1\\leq N\\leq 2\\times 10^5\n* 1\\leq A\\_i\\leq 10^9\n* All input values are integers.\n\n---\n\n### Input\n\nThe input is given from Standard Input in the following format:\n\n```\nN\nA_1 A_2 \\ldots A_N\n\n```\n\n### Output\n\nPrint the maximum total experience points he can gain from the N monsters as an integer.\n\n---",
    "languages": {},
    "results": [
      {
        "submission_id": "70188474",
        "language": "Python",
        "wa_code_path": "abc369d/others/70188474/wa_70188474.py",
        "artifact_dir": "abc369d/others/70188474",
        "status_code": 200,
        "message": "Reduction successful (reused from 66602018)",
        "original_size_bytes": 1300007,
        "reduced_size_bytes": 13,
        "failing_case_name": "hand_00",
        "execution_time_seconds": 6.35,
        "evaluation": {
          "no_tc": {
            "passed": true,
            "status": "Correct (Passed All Test Cases)",
            "successful_version": 2,
            "versions": [
              {
                "version": 1,
                "passed": false,
                "status": "Wrong Answer on 'example_00'\n  First line diff:\n    Actual: '29'\n    Expected: '28'"
              },
              {
                "version": 2,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 3,
                "passed": false,
                "status": "Wrong Answer on 'example_00'\n  First line diff:\n    Actual: '29'\n    Expected: '28'"
              },
              {
                "version": 4,
                "passed": false,
                "status": "Wrong Answer on 'example_00'\n  First line diff:\n    Actual: '30'\n    Expected: '28'"
              },
              {
                "version": 5,
                "passed": false,
                "status": "Wrong Answer on 'example_00'\n  First line diff:\n    Actual: '29'\n    Expected: '28'"
              },
              {
                "version": 6,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 7,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 8,
                "passed": false,
                "status": "Wrong Answer on 'example_00'\n  First line diff:\n    Actual: '30'\n    Expected: '28'"
              },
              {
                "version": 9,
                "passed": false,
                "status": "Wrong Answer on 'example_00'\n  First line diff:\n    Actual: '29'\n    Expected: '28'"
              },
              {
                "version": 10,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              }
            ]
          },
          "orig_tc": {
            "passed": true,
            "status": "Correct (Passed All Test Cases)",
            "successful_version": 1,
            "versions": [
              {
                "version": 1,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 2,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 3,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 4,
                "passed": false,
                "status": "Wrong Answer on 'example_00'\n  First line diff:\n    Actual: '30'\n    Expected: '28'"
              },
              {
                "version": 5,
                "passed": false,
                "status": "Failed on 'example_00': Runtime Error (Exit Code: 1)\nStderr:\nTraceback (most recent call last):\n  File \"/tmp/eval_repair_others_70188474_pjq6mmls/exe\", line 28, in <module>\n    n = int(input())\nEOFError: EOF when reading a line"
              },
              {
                "version": 6,
                "passed": false,
                "status": "Wrong Answer on 'example_00'\n  First line diff:\n    Actual: '29'\n    Expected: '28'"
              },
              {
                "version": 7,
                "passed": false,
                "status": "Wrong Answer on 'example_00'\n  First line diff:\n    Actual: '27'\n    Expected: '28'"
              },
              {
                "version": 8,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 9,
                "passed": false,
                "status": "Wrong Answer on 'example_00'\n  First line diff:\n    Actual: '29'\n    Expected: '28'"
              },
              {
                "version": 10,
                "passed": false,
                "status": "Wrong Answer on 'example_00'\n  First line diff:\n    Actual: '30'\n    Expected: '28'"
              }
            ]
          },
          "reduced_tc": {
            "passed": true,
            "status": "Correct (Passed All Test Cases)",
            "successful_version": 1,
            "versions": [
              {
                "version": 1,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 2,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 3,
                "passed": false,
                "status": "Wrong Answer on 'example_00'\n  First line diff:\n    Actual: '29'\n    Expected: '28'"
              },
              {
                "version": 4,
                "passed": false,
                "status": "Wrong Answer on 'example_00'\n  First line diff:\n    Actual: '29'\n    Expected: '28'"
              },
              {
                "version": 5,
                "passed": false,
                "status": "Wrong Answer on 'example_00'\n  First line diff:\n    Actual: '30'\n    Expected: '28'"
              },
              {
                "version": 6,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              },
              {
                "version": 7,
                "passed": false,
                "status": "Wrong Answer on 'example_00'\n  First line diff:\n    Actual: '30'\n    Expected: '28'"
              },
              {
                "version": 8,
                "passed": false,
                "status": "Wrong Answer on 'example_00'\n  First line diff:\n    Actual: '29'\n    Expected: '28'"
              },
              {
                "version": 9,
                "passed": false,
                "status": "Wrong Answer on 'example_00'\n  First line diff:\n    Actual: '29'\n    Expected: '28'"
              },
              {
                "version": 10,
                "passed": true,
                "status": "Correct (Passed All Test Cases)"
              }
            ]
          },
          "error": null
        }
      }
    ]
  },
  "abc375c": {
    "problem_description": "Score : 150 points\n\n### Problem Statement\n\nTakahashi is at the origin on a two-dimensional coordinate plane.\n\nThe cost for him to move from point (a, b) to point (c, d) is \\sqrt{(a - c)^2 + (b - d)^2}.\n\nFind the total cost when he starts at the origin, visits N points (X\\_1, Y\\_1), \\ldots, (X\\_N, Y\\_N) in this order, and then returns to the origin.\n\n### Constraints\n\n* 1 \\leq N \\leq 2 \\times 10^5\n* -10^9 \\leq X\\_i, Y\\_i \\leq 10^9\n* All input values are integers.\n\n---\n\n### Input\n\nThe input is given from Standard Input in the following format:\n\n```\nN\nX_1 Y_1\n\\vdots\nX_N Y_N\n\n```\n\n### Output\n\nPrint the answer.  \nYour output will be considered correct if its absolute or relative error from the true value is at most 10^{-6}.\n\n---",
    "languages": {},
    "results": [
      {
        "submission_id": "68056846",
        "language": "Python",
        "wa_code_path": "abc375c/others/68056846/wa_68056846.py",
        "artifact_dir": "abc375c/others/68056846",
        "status_code": 200,
        "message": "Reduction successful (reused from 67172723)",
        "original_size_bytes": 1028292,
        "reduced_size_bytes": 7,
        "failing_case_name": "random_01",
        "execution_time_seconds": 1.69,
        "evaluation": {
          "no_tc": {
            "passed": false,
            "status": "No versions available",
            "successful_version": null,
            "versions": [
              {
                "version": 1,
                "passed": false,
                "status": "Wrong Answer on 'random_01'\n  First line diff:\n    Actual: '2186522.8177234293'\n    Expected: '2186522.81772342929616570'"
              },
              {
                "version": 2,
                "passed": false,
                "status": "Wrong Answer on 'random_01'\n  First line diff:\n    Actual: '2186522.8177234293'\n    Expected: '2186522.81772342929616570'"
              },
              {
                "version": 3,
                "passed": false,
                "status": "Wrong Answer on 'random_01'\n  First line diff:\n    Actual: '2186522.8177234293'\n    Expected: '2186522.81772342929616570'"
              },
              {
                "version": 4,
                "passed": false,
                "status": "Wrong Answer on 'random_01'\n  First line diff:\n    Actual: '2186522.8177234293'\n    Expected: '2186522.81772342929616570'"
              },
              {
                "version": 5,
                "passed": false,
                "status": "Wrong Answer on 'random_01'\n  First line diff:\n    Actual: '2186522.8177234293'\n    Expected: '2186522.81772342929616570'"
              },
              {
                "version": 6,
                "passed": false,
                "status": "Wrong Answer on 'random_01'\n  First line diff:\n    Actual: '2186522.8177234293'\n    Expected: '2186522.81772342929616570'"
              },
              {
                "version": 7,
                "passed": false,
                "status": "Wrong Answer on 'random_01'\n  First line diff:\n    Actual: '2186522.8177234293'\n    Expected: '2186522.81772342929616570'"
              },
              {
                "version": 8,
                "passed": false,
                "status": "Wrong Answer on 'random_01'\n  First line diff:\n    Actual: '2186522.8177234293'\n    Expected: '2186522.81772342929616570'"
              },
              {
                "version": 9,
                "passed": false,
                "status": "Wrong Answer on 'random_01'\n  First line diff:\n    Actual: '2186522.8177234293'\n    Expected: '2186522.81772342929616570'"
              },
              {
                "version": 10,
                "passed": false,
                "status": "Wrong Answer on 'random_01'\n  First line diff:\n    Actual: '2186522.8177234293'\n    Expected: '2186522.81772342929616570'"
              }
            ]
          },
          "orig_tc": {
            "passed": false,
            "status": "No versions available",
            "successful_version": null,
            "versions": [
              {
                "version": 1,
                "passed": false,
                "status": "Wrong Answer on 'random_01'\n  First line diff:\n    Actual: '2186522.8177234293'\n    Expected: '2186522.81772342929616570'"
              },
              {
                "version": 2,
                "passed": false,
                "status": "Wrong Answer on 'random_01'\n  First line diff:\n    Actual: '2186522.8177234293'\n    Expected: '2186522.81772342929616570'"
              },
              {
                "version": 3,
                "passed": false,
                "status": "Wrong Answer on 'random_01'\n  First line diff:\n    Actual: '2186522.8177234293'\n    Expected: '2186522.81772342929616570'"
              },
              {
                "version": 4,
                "passed": false,
                "status": "Wrong Answer on 'random_01'\n  First line diff:\n    Actual: '2186522.8177234293'\n    Expected: '2186522.81772342929616570'"
              },
              {
                "version": 5,
                "passed": false,
                "status": "Wrong Answer on 'random_01'\n  First line diff:\n    Actual: '2186522.8177234293'\n    Expected: '2186522.81772342929616570'"
              },
              {
                "version": 6,
                "passed": false,
                "status": "Wrong Answer on 'random_01'\n  First line diff:\n    Actual: '2186522.8177234293'\n    Expected: '2186522.81772342929616570'"
              },
              {
                "version": 7,
                "passed": false,
                "status": "Wrong Answer on 'random_01'\n  First line diff:\n    Actual: '2186522.8177234293'\n    Expected: '2186522.81772342929616570'"
              },
              {
                "version": 8,
                "passed": false,
                "status": "Wrong Answer on 'random_01'\n  First line diff:\n    Actual: '2186522.8177234293'\n    Expected: '2186522.81772342929616570'"
              },
              {
                "version": 9,
                "passed": false,
                "status": "Wrong Answer on 'random_01'\n  First line diff:\n    Actual: '2186522.8177234293'\n    Expected: '2186522.81772342929616570'"
              },
              {
                "version": 10,
                "passed": false,
                "status": "Wrong Answer on 'random_01'\n  First line diff:\n    Actual: '2186522.8177234293'\n    Expected: '2186522.81772342929616570'"
              }
            ]
          },
          "reduced_tc": {
            "passed": false,
            "status": "No versions available",
            "successful_version": null,
            "versions": [
              {
                "version": 1,
                "passed": false,
                "status": "Wrong Answer on 'random_01'\n  First line diff:\n    Actual: '2186522.8177234293'\n    Expected: '2186522.81772342929616570'"
              },
              {
                "version": 2,
                "passed": false,
                "status": "Wrong Answer on 'random_01'\n  First line diff:\n    Actual: '2186522.8177234293'\n    Expected: '2186522.81772342929616570'"
              },
              {
                "version": 3,
                "passed": false,
                "status": "Wrong Answer on 'random_01'\n  First line diff:\n    Actual: '2186522.8177234293'\n    Expected: '2186522.81772342929616570'"
              },
              {
                "version": 4,
                "passed": false,
                "status": "Wrong Answer on 'random_01'\n  First line diff:\n    Actual: '2186522.8177234293'\n    Expected: '2186522.81772342929616570'"
              },
              {
                "version": 5,
                "passed": false,
                "status": "Wrong Answer on 'random_01'\n  First line diff:\n    Actual: '2186522.8177234293'\n    Expected: '2186522.81772342929616570'"
              },
              {
                "version": 6,
                "passed": false,
                "status": "Wrong Answer on 'random_01'\n  First line diff:\n    Actual: '2186522.8177234293'\n    Expected: '2186522.81772342929616570'"
              },
              {
                "version": 7,
                "passed": false,
                "status": "Wrong Answer on 'random_01'\n  First line diff:\n    Actual: '2186522.8177234293'\n    Expected: '2186522.81772342929616570'"
              },
              {
                "version": 8,
                "passed": false,
                "status": "Wrong Answer on 'random_01'\n  First line diff:\n    Actual: '2186522.8177234293'\n    Expected: '2186522.81772342929616570'"
              },
              {
                "version": 9,
                "passed": false,
                "status": "Wrong Answer on 'random_01'\n  First line diff:\n    Actual: '2186522.8177234293'\n    Expected: '2186522.81772342929616570'"
              },
              {
                "version": 10,
                "passed": false,
                "status": "Wrong Answer on 'random_01'\n  First line diff:\n    Actual: '2186522.8177234293'\n    Expected: '2186522.81772342929616570'"
              }
            ]
          },
          "error": null
        }
      }
    ]
  }
}