problem_id stringlengths 6 6 | user_id stringlengths 10 10 | time_limit float64 1k 8k | memory_limit float64 262k 1.05M | problem_description stringlengths 48 1.55k | codes stringlengths 35 98.9k | status stringlengths 28 1.7k | submission_ids stringlengths 28 1.41k | memories stringlengths 13 808 | cpu_times stringlengths 11 610 | code_sizes stringlengths 7 505 |
|---|---|---|---|---|---|---|---|---|---|---|
p03001 | u587742016 | 2,000 | 1,048,576 | There is a rectangle in a coordinate plane. The coordinates of the four vertices are (0,0), (W,0), (W,H), and (0,H). You are given a point (x,y) which is within the rectangle or on its border. We will draw a straight line passing through (x,y) to cut the rectangle into two parts. Find the maximum possible area of the p... | ['W, H, x, y = list(map(int, input().split()))\n\nprint("{:f} {}".format(float(W * H), int(x * 2 == W and y * 2 == H)))\n', 'W, H, x, y = list(map(int, input().split()))\n\nprint("{:f} {}".format(float(W * H), abs(1 - int(x * 2 == W and y * 2 == H))))\n', 'W, H, x, y = list(map(int, input().split()))\n\nprint("{:f} {}"... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s021167115', 's806866761', 's189109210'] | [2940.0, 3064.0, 2940.0] | [17.0, 17.0, 17.0] | [116, 125, 120] |
p03001 | u625007136 | 2,000 | 1,048,576 | There is a rectangle in a coordinate plane. The coordinates of the four vertices are (0,0), (W,0), (W,H), and (0,H). You are given a point (x,y) which is within the rectangle or on its border. We will draw a straight line passing through (x,y) to cut the rectangle into two parts. Find the maximum possible area of the p... | ['if __name__ == \'__main__\':\n w,h,x,y = map(int,input().split())\n if x + x == w and y + y == h::\n a = 1\n else:\n a = 0\n\n print("%f %d" %(w*h/2, a))', 'def rectangle_cutting(w,h,x,y):\n s = w * h\n\n s14 = (w - x) * h\n s23 = x * h\n\n s12 = w * (h - y)\n s34 = w * y\n\n ... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s064968857', 's424978821', 's985232641'] | [2940.0, 3064.0, 2940.0] | [17.0, 17.0, 17.0] | [170, 422, 169] |
p03001 | u879309973 | 2,000 | 1,048,576 | There is a rectangle in a coordinate plane. The coordinates of the four vertices are (0,0), (W,0), (W,H), and (0,H). You are given a point (x,y) which is within the rectangle or on its border. We will draw a straight line passing through (x,y) to cut the rectangle into two parts. Find the maximum possible area of the p... | ['def solve(w, h, x, y):\n area = max(min(x*h, (w-x)*h), min(w*y, w*(h-y)))\n multiple = int((2*x == w) or (2*y == h))\n return (area, multiple)\n\nw, h, x, y = map(int, input().split())\nprint("%f %d" % solve(w, h, x, y))', 'def solve(w, h, x, y):\n area = w*h / 2\n multiple = int((2*x == w) and (2*y ==... | ['Wrong Answer', 'Accepted'] | ['s457866395', 's753923213'] | [3060.0, 2940.0] | [18.0, 18.0] | [223, 190] |
p03001 | u904258057 | 2,000 | 1,048,576 | There is a rectangle in a coordinate plane. The coordinates of the four vertices are (0,0), (W,0), (W,H), and (0,H). You are given a point (x,y) which is within the rectangle or on its border. We will draw a straight line passing through (x,y) to cut the rectangle into two parts. Find the maximum possible area of the p... | ["import sys\ndef input(): return sys.stdin.readline().strip()\n\nmi = lambda: map(int, input().split())\n\nW, H, x, y = mi()\n\nif x == W/2 and y == H/2:\n print('%d 1' % (W*H/2))\nelse:\n print('%d 0' % (W*H/2))", "import sys\ndef input(): return sys.stdin.readline().strip()\n\nmi = lambda: map(int, input().split()... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s381262381', 's492513248', 's365258073'] | [2940.0, 2940.0, 3060.0] | [17.0, 17.0, 17.0] | [203, 207, 210] |
p03001 | u934099192 | 2,000 | 1,048,576 | There is a rectangle in a coordinate plane. The coordinates of the four vertices are (0,0), (W,0), (W,H), and (0,H). You are given a point (x,y) which is within the rectangle or on its border. We will draw a straight line passing through (x,y) to cut the rectangle into two parts. Find the maximum possible area of the p... | ['# -*- coding: utf-8 -*-\n\n#a = int(input())\n\n#b, c = map(int, input().split())\n\n#s = input()\n\n#print("{} {}".format(a+b+c, s))\n\nW, H, x, y = map(int, input().split())\n\ncount = 0\ns = 0\nif 2 * x == W and 2 * y == H:\n s = W * H / 2\n count = 4\nelse:\n\n if (x == 0 and y == 0) or (x == 0 and y == ... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s187549860', 's250654293', 's727376806'] | [3060.0, 3060.0, 3188.0] | [17.0, 17.0, 17.0] | [1317, 1096, 1421] |
p03001 | u957872856 | 2,000 | 1,048,576 | There is a rectangle in a coordinate plane. The coordinates of the four vertices are (0,0), (W,0), (W,H), and (0,H). You are given a point (x,y) which is within the rectangle or on its border. We will draw a straight line passing through (x,y) to cut the rectangle into two parts. Find the maximum possible area of the p... | ['w, h, x, y = map(int,input().split())\ns = (w*h)/2\nif x == int(w/2) and y == int(h/2):\n print(s, 1)\nelif x == 0:\n print(s, 0)\nelif y == 0:\n print(s, 0)\nelif x == w:\n print(s, 0)\nelif y == h:\n print(s, 0)\nelse:\n s1 = x*h\n s2 = s*2-s1\n s3 = y*w\n s4 = s*2-s3\n s5 = min(s1,s2)\n s6 = min(s3,s4)\... | ['Wrong Answer', 'Accepted'] | ['s084997121', 's282683027'] | [3064.0, 2940.0] | [17.0, 17.0] | [332, 145] |
p03001 | u962479059 | 2,000 | 1,048,576 | There is a rectangle in a coordinate plane. The coordinates of the four vertices are (0,0), (W,0), (W,H), and (0,H). You are given a point (x,y) which is within the rectangle or on its border. We will draw a straight line passing through (x,y) to cut the rectangle into two parts. Find the maximum possible area of the p... | ['W,H,x,y=map(int, input().split())\ns=format(W*H/2, ".6f")\nif x*2 == W and y*2 == H:\n flag="1"\nelse:\n flag="0"\nprint("{}, {}".format(s,flag))', 'W,H,x,y=map(int, input().split())\ns=format(W*H/2, ".6f")\nif x*2 == W and y*2 == H:\n flag="1"\nelse:\n flag="0"\nprint("{} {}".format(s,flag))'] | ['Wrong Answer', 'Accepted'] | ['s360547841', 's441566763'] | [2940.0, 2940.0] | [17.0, 17.0] | [145, 144] |
p03001 | u977642052 | 2,000 | 1,048,576 | There is a rectangle in a coordinate plane. The coordinates of the four vertices are (0,0), (W,0), (W,H), and (0,H). You are given a point (x,y) which is within the rectangle or on its border. We will draw a straight line passing through (x,y) to cut the rectangle into two parts. Find the maximum possible area of the p... | ["import math\nW, H, x, y = map(int, input().split(' '))\n\nf_x, i_x = math.modf(W / x)\nf_y, i_y = math.modf(H / y)\n\nif f_x == 0 and f_y == 0:\n print(float(W * y), 1)\nelif f_x == 0:\n print(float(H * x), 0)\nelif f_y == 0:\n print(float(H * x), 0)\n", 'def main(W: int, H: int, x: int, y: int):\n area =... | ['Runtime Error', 'Accepted'] | ['s636020172', 's049596707'] | [3060.0, 2940.0] | [17.0, 17.0] | [249, 265] |
p03001 | u981931040 | 2,000 | 1,048,576 | There is a rectangle in a coordinate plane. The coordinates of the four vertices are (0,0), (W,0), (W,H), and (0,H). You are given a point (x,y) which is within the rectangle or on its border. We will draw a straight line passing through (x,y) to cut the rectangle into two parts. Find the maximum possible area of the p... | ['W , H ,x , y = map(int,input().split())\nhorizon = min(W * y , W * (H - y))\nvertical = min(H * x , H * (W - x))\nprint(max(horizon , vertical) , end = \' \')\nif horizon == vertical:\n print("1")\nelse:\n print(\'0\')', 'W , H ,x , y = map(int,input().split())\nhorizon = min(W * y , W * (H - y))\nvertical = mi... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s481320623', 's634642947', 's631898936'] | [3060.0, 2940.0, 2940.0] | [17.0, 18.0, 17.0] | [213, 482, 578] |
p03001 | u995102075 | 2,000 | 1,048,576 | There is a rectangle in a coordinate plane. The coordinates of the four vertices are (0,0), (W,0), (W,H), and (0,H). You are given a point (x,y) which is within the rectangle or on its border. We will draw a straight line passing through (x,y) to cut the rectangle into two parts. Find the maximum possible area of the p... | ['W, H, x, y = map(int, input().split())\n\nans = (W * H) / 2\ndiv = 1 if (x == W // 2 and y == H // 2) else 0\n\nprint("{0:.9f} {1}".format(ans, div))\n', 'W, H, x, y = map(int, input().split())\n\nans = (W * H) / 2\ndiv = 1 if (x == W / 2 and y == H / 2) else 0\n\nprint("{0:.6f} {1}".format(ans, div))\n'] | ['Wrong Answer', 'Accepted'] | ['s286077768', 's294615605'] | [2940.0, 2940.0] | [17.0, 18.0] | [145, 143] |
p03004 | u176354582 | 5,000 | 1,048,576 | There are N points in a two-dimensional plane. The initial coordinates of the i-th point are (x_i, y_i). Now, each point starts moving at a speed of 1 per second, in a direction parallel to the x\- or y\- axis. You are given a character d_i that represents the specific direction in which the i-th point moves, as follow... | ['import itertools\n\ndef enum(a):\n t = [0]\n for a1, a2 in itertools.combinations(a, 2):\n t.append(a1[0]-a2[0])\n t.append(a2[0]-a1[0])\n return t\n\ndef calcWidth(l, t):\n x_min = x_max = l[0][0] + l[0][1] * t\n for item in l:\n x_min = min(x_min, item[0] + item[1] * t)\n ... | ['Wrong Answer', 'Accepted'] | ['s429911748', 's067065653'] | [11252.0, 11252.0] | [367.0, 383.0] | [1806, 1919] |
p03004 | u297574184 | 5,000 | 1,048,576 | There are N points in a two-dimensional plane. The initial coordinates of the i-th point are (x_i, y_i). Now, each point starts moving at a speed of 1 per second, in a direction parallel to the x\- or y\- axis. You are given a character d_i that represents the specific direction in which the i-th point moves, as follow... | ["import sys\ninput = sys.stdin.readline\n\nN = int(input())\nptss = [[] for _ in range(4)]\nconvs = dict(zip('LRUD', range(4)))\nfor _ in range(N):\n x, y, d = input().split()\n x, y = int(x), int(y)\n ptss[convs[d]].append((x, y, d))\n\npts = []\nfor pt2s in ptss:\n if not pt2s: continue\n pt2s.sort(ke... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s206901519', 's502901358', 's771921315'] | [17824.0, 17696.0, 3316.0] | [5256.0, 5256.0, 403.0] | [1522, 1526, 2250] |
p03004 | u310678820 | 5,000 | 1,048,576 | There are N points in a two-dimensional plane. The initial coordinates of the i-th point are (x_i, y_i). Now, each point starts moving at a speed of 1 per second, in a direction parallel to the x\- or y\- axis. You are given a character d_i that represents the specific direction in which the i-th point moves, as follow... | ["inf = float('inf')\nfrom scipy.optimize import fmin\nfrom collections import defaultdict\ndir = {'R', 'L', 'U', 'D'}\nN = int(input())\ndic = defaultdict(list)\nfor _ in range(N):\n x, y, d = input().split()\n x, y = int(x), int(y)\n dic[d].append((x, y))\nx_max = defaultdict(lambda : -inf)\nx_min = defaultd... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s256685297', 's659383375', 's903036423', 's789157460'] | [31484.0, 31360.0, 32744.0, 32012.0] | [665.0, 677.0, 657.0, 686.0] | [1022, 1002, 1022, 1377] |
p03004 | u340781749 | 5,000 | 1,048,576 | There are N points in a two-dimensional plane. The initial coordinates of the i-th point are (x_i, y_i). Now, each point starts moving at a speed of 1 per second, in a direction parallel to the x\- or y\- axis. You are given a character d_i that represents the specific direction in which the i-th point moves, as follow... | ["import sys\n\n\ndef check(t):\n maxx, minx, maxy, miny = -1e9, 1e9, -1e9, 1e9\n for x, y in dots['R']:\n maxx = max(maxx, x + t)\n minx = min(minx, x + t)\n maxy = max(maxy, y)\n miny = min(miny, y)\n for x, y in dots['L']:\n maxx = max(maxx, x - t)\n minx = min(minx... | ['Wrong Answer', 'Accepted'] | ['s154414176', 's622591788'] | [25396.0, 3192.0] | [5257.0, 228.0] | [1202, 1704] |
p03004 | u353797797 | 5,000 | 1,048,576 | There are N points in a two-dimensional plane. The initial coordinates of the i-th point are (x_i, y_i). Now, each point starts moving at a speed of 1 per second, in a direction parallel to the x\- or y\- axis. You are given a character d_i that represents the specific direction in which the i-th point moves, as follow... | ['def men(t):\n xmin = min(st + i * t for i, st in enumerate(mg[0]))\n xmax = max(st + i * t for i, st in enumerate(mg[1]))\n ymin = min(st + i * t for i, st in enumerate(ue[0]))\n ymax = max(st + i * t for i, st in enumerate(ue[1]))\n return (xmax - xmin) * (ymax - ymin)\n\nn = int(input())\ninf = 10**9... | ['Time Limit Exceeded', 'Time Limit Exceeded', 'Accepted'] | ['s055370722', 's287087144', 's650422000'] | [3316.0, 3192.0, 3192.0] | [5256.0, 5255.0, 303.0] | [1053, 1235, 997] |
p03004 | u467736898 | 5,000 | 1,048,576 | There are N points in a two-dimensional plane. The initial coordinates of the i-th point are (x_i, y_i). Now, each point starts moving at a speed of 1 per second, in a direction parallel to the x\- or y\- axis. You are given a character d_i that represents the specific direction in which the i-th point moves, as follow... | ['inf = float("inf")\nN = int(input())\n# if N==1:\n# print(0)\n# exit()\nlr = inf\nll = inf\nrr = -inf\nrl = -inf\nud = -inf\nuu = -inf\ndd = inf\ndu = inf\nl_stop = inf\nr_stop = -inf\nu_stop = -inf\nd_stop = inf\nfor _ in range(N):\n x, y, d = input().split()\n x, y = int(x), int(y)\n if d=="R":\n ... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s112802105', 's162974195', 's381182575', 's449248047', 's605127337', 's754911928', 's813510953', 's917555573', 's940431331'] | [3188.0, 3188.0, 3192.0, 3188.0, 3188.0, 3188.0, 3188.0, 3316.0, 3188.0] | [378.0, 383.0, 5256.0, 377.0, 382.0, 5255.0, 383.0, 383.0, 371.0] | [1125, 1124, 1155, 1141, 1122, 1088, 1146, 1119, 1140] |
p03004 | u619458041 | 5,000 | 1,048,576 | There are N points in a two-dimensional plane. The initial coordinates of the i-th point are (x_i, y_i). Now, each point starts moving at a speed of 1 per second, in a direction parallel to the x\- or y\- axis. You are given a character d_i that represents the specific direction in which the i-th point moves, as follow... | ["import sys\nsys.setrecursionlimit(10**6)\n\ndef main():\n input = sys.stdin.readline\n inf = 10**8 + 1\n err = 10**(-9)\n N = int(input())\n x_max = [-inf, -inf, -inf] \n x_min = [inf, inf, inf] \n y_max = [-inf, -inf, -inf] \n y_min = [inf, inf, inf] \n for _ in range(N):\n ... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s090131680', 's133087715', 's157493359', 's177059482', 's258868814', 's286058136', 's753591877', 's894879606', 's132135585'] | [3192.0, 3320.0, 3192.0, 3320.0, 3192.0, 3316.0, 3320.0, 3192.0, 3316.0] | [253.0, 5256.0, 5256.0, 256.0, 249.0, 256.0, 254.0, 263.0, 240.0] | [2305, 2103, 2297, 2305, 2301, 2305, 2299, 2306, 2895] |
p03004 | u638795007 | 5,000 | 1,048,576 | There are N points in a two-dimensional plane. The initial coordinates of the i-th point are (x_i, y_i). Now, each point starts moving at a speed of 1 per second, in a direction parallel to the x\- or y\- axis. You are given a character d_i that represents the specific direction in which the i-th point moves, as follow... | ['def examA():\n import numpy as np\n def powDetMod(n,arr,k,MOD=-1):\n repeat = 60\n local_doubling = [[] for _ in range(repeat+1)]\n local_doubling[0] = arr\n for i in range(repeat):\n local_doubling[i+1] = np.dot(local_doubling[i],local_doubling[i])\n if MOD>0:\... | ['Runtime Error', 'Accepted'] | ['s758121619', 's715054505'] | [6284.0, 5428.0] | [241.0, 240.0] | [4042, 4058] |
p03004 | u828766688 | 5,000 | 1,048,576 | There are N points in a two-dimensional plane. The initial coordinates of the i-th point are (x_i, y_i). Now, each point starts moving at a speed of 1 per second, in a direction parallel to the x\- or y\- axis. You are given a character d_i that represents the specific direction in which the i-th point moves, as follow... | ['from decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN\n\ndef want(n):\n\n xmax = float("-inf")\n xmin = float("inf")\n ymax = float("-inf")\n ymin = float("inf")\n\n if L:\n xmax = max(xmax,L_R - n)\n xmin = min(xmin,L_L - n)\n ymax = max(ymax,LR_U)\n ymin = min(ymin,L... | ['Wrong Answer', 'Accepted'] | ['s465938498', 's017814143'] | [5204.0, 5076.0] | [411.0, 640.0] | [2154, 2321] |
p03004 | u844789719 | 5,000 | 1,048,576 | There are N points in a two-dimensional plane. The initial coordinates of the i-th point are (x_i, y_i). Now, each point starts moving at a speed of 1 per second, in a direction parallel to the x\- or y\- axis. You are given a character d_i that represents the specific direction in which the i-th point moves, as follow... | ["I = float('inf')\nN = int(input())\nXYD = [input().split() for _ in range(N)]\nxL = set()\nxR = set()\nxS = set()\nyD = set()\nyU = set()\nyS = set()\nfor xyd in XYD:\n x, y, d = xyd\n x = int(x)\n y = int(y)\n if d == 'L':\n xL.add(x)\n yS.add(y)\n elif d == 'R':\n xR.add(x)\n ... | ['Wrong Answer', 'Accepted'] | ['s642814163', 's180455632'] | [53424.0, 53420.0] | [418.0, 387.0] | [1861, 1804] |
p03011 | u003501233 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['P,Q,R = list(map(int,input().split()))\n\na = P + Q\nb = P + R\nc = Q + R\nd = Q + P\ne = R + Q\nf = R + P\n\nmn_list = list[a,b,c,d,e,f]\nmn = min(mn_list)\n\nprint(mn)', 'a,b,c = map(int,input().split())\nprint(min(a+b,a+c,b+c)', 'P,Q,R = map(int,input().split())\n\na = P + Q\nb = P + R\nc = Q + R\nd = Q + P\ne = R... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s312775951', 's374812289', 's400122587', 's410694128', 's547817221', 's607895449', 's214478517'] | [3060.0, 2940.0, 3060.0, 2940.0, 3064.0, 3060.0, 2940.0] | [17.0, 17.0, 18.0, 17.0, 18.0, 18.0, 17.0] | [157, 55, 151, 53, 138, 130, 56] |
p03011 | u007785897 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['l = [map(int, input())]\n\nl.sort()\n\nprint(l[0] + l[1])', 'p,q,r = map(int, input().split())\n\nl = [p, q, r]\n\nl.sort()\n\nprint(l[0] + l[1])'] | ['Runtime Error', 'Accepted'] | ['s546583560', 's248817503'] | [2940.0, 2940.0] | [18.0, 18.0] | [53, 78] |
p03011 | u014724123 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['p, q, r = map(int, input().split())\n\nmin = p + q\nif min > r + q:\n min = r + q\n\nif min > p + r:\n min = p + r\n', 'p, q, r = map(int, input().split())\n\nmin = p + q\nif min > r + q:\n min = r + q\n\nif min > p + r:\n min = p + r\n\nprint(min)\n'] | ['Wrong Answer', 'Accepted'] | ['s403020589', 's617029568'] | [2940.0, 2940.0] | [19.0, 17.0] | [114, 126] |
p03011 | u017624958 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['import math\n\nN = int(input())\nW = list(map(int, input().split()))\n\n\ndef search(start, end, i, W):\n S1 = sum(W[0:i + 1])\n S2 = sum(W[i + 1:len(W)])\n\n next_i = math.floor(i / 2) if S1 >= S2 else math.floor((i + end) / 2)\n\n if S1 == S2: return i\n if S1 > S2:\n next_start = start\n ... | ['Runtime Error', 'Accepted'] | ['s238718559', 's979660681'] | [3064.0, 2940.0] | [17.0, 17.0] | [733, 221] |
p03011 | u018679195 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['k=list(map(int,input().split().strip()))\nkk=max(k)\nk.remove(kk)\nprint(sum(k))', 'i = input().split()\n\np = int(i[0])\nq = int(i[1])\nr = int(i[2])\n\nv1 = p + q\nv2 = q + r\nv3 = p + r\n\nif v1 < v2 and v1 < v3:\n print(v1)\nelif v2 < v3:\n print(v2)\nelse:\n print(v3)\n'] | ['Runtime Error', 'Accepted'] | ['s834285076', 's474350506'] | [2940.0, 3060.0] | [17.0, 17.0] | [77, 184] |
p03011 | u020177355 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['N, M = list(map(int, input().split(" ")))\nA = [1] * (N+1)\nfor i in range(M):\n A[int(input())] = -1\nfor i in range(2, N + 1):\n if(A[i] == -1):\n A[i] = 0\n else:\n A[i] = A[i-1] + A[i-2]\nprint(A[-1] % 1000000007)\n', 'import itertools\npqr = list(map(int,input().split(" ")))\nprint(sum(min... | ['Runtime Error', 'Accepted'] | ['s875708552', 's629864739'] | [3060.0, 3060.0] | [17.0, 17.0] | [232, 131] |
p03011 | u020639289 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['list = input().split()\nlist = sort(list)\nprint(list[0] + list[1])', 'list = input().split()\nlist.sort()\nprint(int(list[0]) + int(list[1]))'] | ['Runtime Error', 'Accepted'] | ['s450206152', 's457936756'] | [2940.0, 2940.0] | [17.0, 17.0] | [65, 69] |
p03011 | u021086907 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['*A = map(int,input().split())\nA.sort()\nprint(A[0]+A[1])', '*A, = map(int,input().split())\nA.sort()\nprint(A[0]+A[1])'] | ['Runtime Error', 'Accepted'] | ['s602448349', 's262481682'] | [8980.0, 9156.0] | [26.0, 26.0] | [55, 56] |
p03011 | u023229441 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['a,b,c=map(int,input().split())\nprint(a+b+c-min(a,b,c))', 'a,b,c=map(int,input().split())\nprint(a+b+c-max(a,b,c))'] | ['Wrong Answer', 'Accepted'] | ['s984059098', 's071609061'] | [2940.0, 3316.0] | [18.0, 22.0] | [54, 54] |
p03011 | u024340351 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['H, W = map(int, input().split())\nS = [int(input()) for _ in range(W)]\n \nfloor = list(range(0,H+1))\n\nif S.count(1) >0:\n\tfloor[1]=0\n\tfloor[2]=1\nif S.count(2) >0:\n floor[2]=0\n\nfor i in range (3, H+1):\n\t\tfloor[i]=floor[i-2]*(1-S.count(i-2))+floor[i-1]*(1-S.count(i-1))\nprint(floor[H]%(10**9+7))', 'a... | ['Runtime Error', 'Accepted'] | ['s325895604', 's491659665'] | [3064.0, 2940.0] | [17.0, 17.0] | [296, 59] |
p03011 | u036340997 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['p, q, r = map(int, input().split())\nprint(max(p+q, q+r, r+p))', 'p, q, r = map(int, input().split())\nprint(min(p+q, q+r, r+p))'] | ['Wrong Answer', 'Accepted'] | ['s795818031', 's971509613'] | [2940.0, 2940.0] | [17.0, 17.0] | [61, 61] |
p03011 | u037221289 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ["P,Q,R = map(int,input().split(' '))\nList = [P,Q,R].sort()\nprint(List[0]+List[1])", "List = list(map(int,input().split(' ')))\nList.sort()\nprint(sum(List[0:2]))\n"] | ['Runtime Error', 'Accepted'] | ['s262569224', 's953424505'] | [2940.0, 2940.0] | [17.0, 17.0] | [80, 75] |
p03011 | u043409756 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['p = int(input())\nq = int(input())\nr = int(input())\na = p + q\nb = q + r\nc = p + r\nprint(max(a,b,c))', 'p = int(input())\nq = int(input())\nr = int(input())\na = p + q\nb = q + r\nc = p + r\nprint(min(a,b,c))', 'p,q,r = list(map(int,input().split()))\na = p + q\nb = q + r\nc = p + r\nprint(min(a,b,c))'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s055388553', 's942939481', 's769903190'] | [3060.0, 3060.0, 2940.0] | [17.0, 18.0, 17.0] | [98, 98, 86] |
p03011 | u045953894 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['A = [map(int,input().split()) for i in range(1)]\n\nA.sort()\n\nprint(A[0]+A[1])\n\n\n\n', 'A = list(map(int,input().split()))\n\nA.sort()\n\nprint(A[0]+A[1])\n\n\n\n'] | ['Runtime Error', 'Accepted'] | ['s124621744', 's952313280'] | [2940.0, 2940.0] | [17.0, 17.0] | [80, 66] |
p03011 | u046585946 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['pqr=list(map(int,input().split()))\npqr.sorted()\nprint(pqr[0]+pqr[1])', 'pqr=list(map(int,input().split()))\npqr.sort()\nprint(pqr[0]+pqr[1])'] | ['Runtime Error', 'Accepted'] | ['s835522279', 's318306801'] | [2940.0, 2940.0] | [17.0, 17.0] | [68, 66] |
p03011 | u048259718 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['time = list(map(int, input().split()))\n\ntime = time.sort()\n\nprint(time[0] + time[1])', 'data = list(map(int, input().split()))\ntime = sorted(data)\nanswer = time[0] + time[1]\nprint(answer)'] | ['Runtime Error', 'Accepted'] | ['s245875383', 's270254920'] | [2940.0, 2940.0] | [17.0, 17.0] | [84, 99] |
p03011 | u052640789 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['n, m = list(map(int, input().split()))\nb = [-1]\nans = 1\n\ndef dfs(top, bot):\n if top == bot:\n return 1\n elif top < bot:\n return 0\n else:\n return dfs(top - 1, bot) + dfs(top - 2, bot)\n \nfor i in range(m):\n broken = int(input())\n b.append(broken)\n\nb.append(n + 1)\n#... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s326250749', 's725842752', 's382998316'] | [3064.0, 3064.0, 2940.0] | [17.0, 18.0, 17.0] | [526, 674, 74] |
p03011 | u057079894 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['a,b,c=map(int,input().split())\nx=max(a,max(b,c))\ninput(a+b+c-x)\n', 'a,b,c=map(int,input().split())\nx=max(a,max(b,c))\ninput(a+b+c-x)', 'a,b,c=map(int,input().split())\nx=max(a,max(b,c))\nprint(a+b+c-x)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s504936354', 's722809338', 's779618256'] | [3064.0, 3060.0, 2940.0] | [18.0, 17.0, 17.0] | [64, 63, 63] |
p03011 | u058882869 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['a,b,c =input().split(",")\nmylist = [int(a),int(b),int(c)]\nmylist.sort()\nprint(sum(mylist[0:2]))', 'a,b,c =input().split(" ")\nmylist = [int(a),int(b),int(c)]\nmylist.sort()\nprint(sum(mylist[0:2]))'] | ['Runtime Error', 'Accepted'] | ['s158641899', 's448337848'] | [2940.0, 2940.0] | [17.0, 17.0] | [95, 95] |
p03011 | u062314674 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['import statistics\nlis = []\nfor i in range(3):\n a = int(input())\n a = [a]\n lis += a\nx = min(lis)\ny = statistics.median(lis)\nprint(x+y)\n', 'import statistics\nlis = []\nfor i in range(3):\n a = int(input())\n a = [a]\n lis += a\nx = min(lis)\ny = statistics.median(lis)\nprint(x+y)', 'a, b, c = [int... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s659397660', 's875846911', 's054829324'] | [5148.0, 5148.0, 2940.0] | [36.0, 36.0, 17.0] | [143, 136, 93] |
p03011 | u062604519 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['p,q,r = map(int,input().split())\na = p+q\nb = q+r\nc = r+p\nl=[a,b,c]\nl.sort()\nprint(l[0]+l[1])', 'p,q,r = map(int,input().split())\na = p+q\nb = q+r\nc = r+p\nl=[a,b,c]\nif max(l) == a:\n print(b+c)\nelif max(l) == b:\n print(c+a)\nelse:\n print(a+b)', 'p,q,r = map(int,input().split())\na = p+q\nb = q+r\nc = r... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s642668213', 's722954450', 's801180012'] | [3060.0, 3316.0, 2940.0] | [17.0, 20.0, 17.0] | [92, 145, 81] |
p03011 | u068142202 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['distances = list(map(int, input().split()))\ndistances.sort()\nans = 0\nfor i in range(2):\n ans += distances\nprint(ans)', 'distances = list(map(int, input().split()))\ndistances.sort()\nans = 0\nfor i in range(2):\n ans += distances[i]\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s608609597', 's203839936'] | [2940.0, 2940.0] | [17.0, 17.0] | [117, 120] |
p03011 | u069273180 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['from sys import stdin\n\nP,Q,R = int(stdin.readline().rstrip().split())\nprint(min(P+Q,Q+R,P+R))', 'from sys import stdin\n\nP,Q,R = map(int,input().split())\nprint(min(P+Q,Q+R,P+R))'] | ['Runtime Error', 'Accepted'] | ['s724899000', 's362593218'] | [2940.0, 2940.0] | [17.0, 17.0] | [93, 79] |
p03011 | u069386342 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['A = list(map(int,input().split()))\n\n\nB =[A[0]+A[1],A[0]+A[2],A[1]+A[2]]\ntmp = 0\nfor i in range(len(B)-1):\n if B[i]>B[i+1]:\n tmp = B[i+1]\n\n\nprint(tmp)', 'A = list(map(int,input().split()))\n\n\nB =[A[0]+A[1],A[0]+A[2],A[1]+A[2]]\ntmp = B[0]\nfor i in range(len(B)):\n if tmp>=B[i]:\n tmp =... | ['Wrong Answer', 'Accepted'] | ['s878247403', 's978646971'] | [3060.0, 3060.0] | [17.0, 17.0] | [159, 156] |
p03011 | u069978048 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['P = int(input())\nQ = int(input())\nR = int(input())\n\nAns1 = P + Q\nAns2 = Q + R\nAns3 = R + P\n\nif(Ans1 > Ans2):\n\tAns1 = Ans2\n\nif(Ans1 > Ans3):\n\tAns1 = Ans3\n\nprint (Ans1)\n', 'P = int(input())\nQ = int(input())\nR = int(input())\n \nAns1 = P + Q\nAns2 = Q + R\nAns3 = R + P\n \nif(Ans1 > Ans2):\n\tAns1 = A... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s383454317', 's516151111', 's742737816', 's213274030'] | [2940.0, 3060.0, 2940.0, 2940.0] | [17.0, 18.0, 17.0, 17.0] | [167, 170, 164, 149] |
p03011 | u070163338 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['a,b,c = map(int, input().split())\nx = a+b\ny = b+c\nz = c+a\nif x >= y and x >= z:\n print(x)\nelif y >= x and y >= z:\n print(y)\nelif z >= x and z >= y:\n print(z)', 'a,b,c = map(int, input().split())\nx = a+b\ny = b+c\nz = c+a\nif x > y :\n if x > z :\n print(x)\n else : print(z)\nelif y > z:\n print(y)\... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s007511084', 's299473815', 's476840275', 's026804648'] | [3060.0, 3060.0, 3060.0, 3060.0] | [17.0, 20.0, 17.0, 17.0] | [160, 150, 153, 160] |
p03011 | u075303794 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['p = list(map(int, input().split()))\nprint(p[0] + p[1] + [2] - max(p))\n', 'p = list(map(int, input().split()))\nprint(p[0] + p[1] + p[2] - max(p))\n'] | ['Runtime Error', 'Accepted'] | ['s411748384', 's758860079'] | [2940.0, 2940.0] | [17.0, 18.0] | [70, 71] |
p03011 | u082861480 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['data = list(map(int, input().split()))\nn = len(data)\nres = 0\nfor i in range(n-1):\n for j in range(i, n):\n if data[i] + data[j] < res:\n res = data[i] + data[j]\nprint(res)\n ', 'data = list(map(int, input().split()))\nn = len(data)\nres = max(data)\nfor i in range(n-1):\n for j in range(i, n):\n ... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s411581463', 's559755878', 's866330024'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 18.0] | [183, 191, 187] |
p03011 | u088241798 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['import math\n \ndef comb(n, r):\n return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))\n \ndef count_combinations(min_val, max_val):\n path_len = max_val - min_val - 2\n if path_len < 2:\n return 1\n twos = path_len // 2\n min_amount = twos + (path_len % 2)\n count = 0\n ... | ['Runtime Error', 'Accepted'] | ['s235148347', 's392570218'] | [9160.0, 9140.0] | [25.0, 27.0] | [786, 80] |
p03011 | u089230684 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['valores = [int(input()), int(input()), int(input())]\nvalores[valores.index(max(valores))]=0\nprint(valores[0]+valores[1]+valores[2])\n', 'line = input()\na, b, c = [int(n) for n in line.split()]\nif a+b <= a+c and a+b <= b+c:\n print(a+b)\nelif a+c <= a+b and a+c <= b+c:\n print(a+c)\nelse:\n print(b+c)'] | ['Runtime Error', 'Accepted'] | ['s933393117', 's259009488'] | [2940.0, 3060.0] | [17.0, 18.0] | [132, 168] |
p03011 | u093033848 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['a, b, c = map(int, input().split())\n\nprint(min([a + b, a + c, b + c])', 'a, b, c = map(int, input().split())\n\nprint(min([a + b, a + c, b + c]))'] | ['Runtime Error', 'Accepted'] | ['s574221045', 's353323472'] | [2940.0, 2940.0] | [17.0, 17.0] | [69, 70] |
p03011 | u093036549 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['a,b,c = input().split()\nprint(min(a+b,b+c,c+a))', 'a,b,c = map(int, input().split())\nprint(min([a+b,b+c,c+a]))'] | ['Wrong Answer', 'Accepted'] | ['s489017803', 's445454912'] | [2940.0, 2940.0] | [17.0, 17.0] | [47, 59] |
p03011 | u095756391 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['n = int(input())\n\nw = list(map(int, input().split()))\n\nsubs = []\ns = 0\nfor i in range(n):\n s += w[i]\n subs.append(s)\n\nans = 1000\nfor i in range(n-1):\n a = abs(subs[-1] - 2*subs[i])\n ans = min(ans, a)\n\nprint(ans)', 'p, q, r = map(int, input().split())\n\nprint(min(min(p+q, q+r), p+r))\n'] | ['Runtime Error', 'Accepted'] | ['s101761874', 's342886761'] | [3064.0, 2940.0] | [17.0, 17.0] | [223, 68] |
p03011 | u096514906 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['l = []\nfor i in range(3):\n l.append(int(input()))\nl.sort()\nprint(l[0]+l[1])', 'l = input().split()\nl.sort()\nprint(int(l[0])+int(l[1]))'] | ['Runtime Error', 'Accepted'] | ['s844731946', 's422998033'] | [2940.0, 2940.0] | [17.0, 17.0] | [78, 55] |
p03011 | u097700948 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ["p = input('P:')\nq = input('Q:')\nr = input('R:')\n\nABC = p + q\nBCA = q + r\nCAB = r + p\n\nmin = ABC\nif min > BCA:\n min = BCA\n \nif min > CAB:\n min = CAB\n\nprint(min)", 'p,q,r = map(int,input().split())\n\n\nABC = p + q\nBCA = q + r\nCAB = r + p\n\nmin = ABC\nif min > BCA:\n min = BCA\n \nif min > CAB:\n... | ['Runtime Error', 'Accepted'] | ['s102204312', 's770231383'] | [3060.0, 3060.0] | [17.0, 17.0] | [162, 148] |
p03011 | u103305058 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['n = int(input())\nw = list(map(int,input(),split()))\nans = 1000000000\nfor t in range(1, n):\n left = sum(w[:t])\n right = sum(w[t:])\n ans = min(ans , abs(left - right))\nprint(ans)\n ', 'n = int(input())\nw = list(map(int,input().split()))\nans = 1000000000\nfor t in range(1, n):\n left = sum(w[... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s604276432', 's870593678', 's936704061'] | [3060.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [194, 194, 55] |
p03011 | u104442591 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['n, m = map(int, input().split())\na = []\nfor i in range(m):\n a.append(int(input()))\nans = 0\nflag = 0\na = set(a)\n\n\ndp = [0] * (n+1)\ndp[0] = 1\nif 1 in a:\n dp[1] = 0\nelse:\n dp[1] = 1\n \nfor i in range(2, n+1):\n if dp[i-2] == 0 and dp[i-1] == 0:\n ans = 0\n flag = 1\n break\n elif i in a:\n ... | ['Runtime Error', 'Accepted'] | ['s637844785', 's720259658'] | [3064.0, 2940.0] | [18.0, 17.0] | [440, 103] |
p03011 | u104930676 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['li = list(map(int, input().split()))\nli.sort\nprint(li[2]+li[1])', 'li = list(map(int, input().split()))\nli.sort()\nprint(li[0]+li[1])'] | ['Wrong Answer', 'Accepted'] | ['s232072790', 's649094447'] | [2940.0, 2940.0] | [17.0, 18.0] | [63, 65] |
p03011 | u106311097 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ["# -*- coding: utf-8 -*-\n# abc129/abc129_a\nimport sys\n\ns2nn = lambda s: [int(c) for c in s.split(' ')]\nss2nn = lambda ss: [int(s) for s in list(ss)]\nss2nnn = lambda ss: [s2nn(s) for s in list(ss)]\ni2s = lambda: sys.stdin.readline().rstrip()\ni2n = lambda: int(i2s())\ni2nn = lambda: s2nn(i2s())\nii2ss = lambda n... | ['Wrong Answer', 'Accepted'] | ['s811639503', 's461445168'] | [3064.0, 3064.0] | [17.0, 18.0] | [495, 495] |
p03011 | u106342872 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['p,q,r = map(int, input().split())\n\nprint(max(p+q,q+r,r+p))\n', 'p,q,r = map(int, input().split())\n\nprint(min(p+q,q+r,r+p))\n'] | ['Wrong Answer', 'Accepted'] | ['s847265604', 's960848197'] | [2940.0, 2940.0] | [17.0, 17.0] | [59, 59] |
p03011 | u111365362 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['#23:39\na = map(int,input().split())\nprint( sum(a) - max(a) )', '#23:39\na = list(map(int,input().split()))\nprint(sum(a) - max(a))'] | ['Runtime Error', 'Accepted'] | ['s645313954', 's208011266'] | [3056.0, 2940.0] | [18.0, 17.0] | [60, 64] |
p03011 | u113971909 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['a=list(map(int,input().split()))\na.sort\nprint(a[0:2])', 'a=list(map(int,input().split()))\na.sort()\nprint(sum(a[0:2]))'] | ['Wrong Answer', 'Accepted'] | ['s078202811', 's085771066'] | [2940.0, 2940.0] | [17.0, 17.0] | [53, 60] |
p03011 | u114648678 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['n,m=map(int,input().split())\na=[]\nfor i in range(m):\n a.append(int(input()))\na=set(a)\ndp=[0]*(n+1)\ndp[0]=1\nif 1 in a:\n dp[1]=0\nelse:\n dp[1]=1\nfor i in range(2,n+1):\n if i in a:\n dp[i]=0\n else:\n dp[i]=dp[i-1]+dp[i-2]\nprint(dp[n]%1000000007)\n', 'n,m=map(int,input().split())\na=[int(input()) ... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s424999898', 's813147244', 's452512285'] | [3064.0, 3064.0, 2940.0] | [17.0, 17.0, 17.0] | [251, 222, 53] |
p03011 | u115877451 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['a,b,c=map(int,input().split())\nn=[a,b,c]\nd=[]\nfor i in range(1,len(n)):\n d.append(n[i]+n[i])\nprint(min(d))', 'a,b,c=map(int,input(),.split())\nn=[a,b,c]\nd=[]\nfor i in range(1,len(n)):\n d.append(n[i]+n[i])\nprint(min(d))', 'a,b,c=map(int,input().split())\nn=sorted([a,b,c])\nprint(n[0]+n[1])\n'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s715693370', 's985418361', 's089791135'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [107, 108, 66] |
p03011 | u116233709 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['n,m=map(int,input().split())\na=[]\nb=[0]*(n+1)\nb[0]=1\nMOD=(10**9)+7\n\na.append(int(input()) for i in range(m))\n \nif 1 not in a:\n b[1]=1\nelse:\n b[1]=0\n \nfor j in range(2,n+1):\n if j in a:\n continue\n else:\n b[j]=(b[j-1]+b[j-2])%MOD\n \nprint(b[n]%MOD) \n \n \n \n \n\n', 'p,q,r=map... | ['Runtime Error', 'Accepted'] | ['s109875100', 's755913236'] | [3064.0, 2940.0] | [17.0, 18.0] | [280, 66] |
p03011 | u127499732 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['p,q,r=map(int,input().split())\nprint(sum(p,q,r)-max(p,q,r))', 'p,q,r=map(int,input().split())\nprint(sum([p,q,r])-max([p,q,r]))'] | ['Runtime Error', 'Accepted'] | ['s250682691', 's454051783'] | [2940.0, 2940.0] | [17.0, 17.0] | [59, 63] |
p03011 | u131944095 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['#nn\nN,M=map(int,input().split())\na = [int(input()) for _ in range(M)]\ndp = [0]*(N+1)\nj = 0\ndp[0] = 1\nmod = 10**9+7\nfor i in range(1, N+1):\n if j < M and i == a[j]:\n j += 1\n elif i == 1:\n dp[i] = 1\n else:\n dp[i] = (dp[i-1]+dp[i-2]) % mod\nprint(dp[N])', 'times = list(map(int,... | ['Runtime Error', 'Accepted'] | ['s108505732', 's850358901'] | [3064.0, 2940.0] | [17.0, 17.0] | [279, 89] |
p03011 | u133566678 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['N, M = map(int, input().split())\nbre = []\nflag = 0\nA = []\nfor i in range(M):\n bre.append(int(input()))\n#print(bre)\nA.append(bre[0] - 1)\ncount = 0\nif len(bre) >= 2:\n for i in range(len(bre) - 1):\n a = bre[i + 1] - bre[i]\n A.append(a - 2)\n if a == 1:\n #print(0)\n ... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s182916302', 's323751755', 's885393061', 's195330286'] | [3064.0, 3064.0, 3064.0, 2940.0] | [17.0, 17.0, 17.0, 17.0] | [643, 654, 306, 64] |
p03011 | u135389999 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['a=list(map(int,input().split()))\na.pop(max(a))\nprint(sum(a))', 'a=list(map(int,input().split()))\na.remove(max(a))\nprint(sum(a))'] | ['Runtime Error', 'Accepted'] | ['s635970446', 's440623169'] | [2940.0, 2940.0] | [17.0, 17.0] | [60, 63] |
p03011 | u142984055 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['N = int(input())\nW = list(map(int, input().split()))\n \nsum_W = sum(W)\nadd_W = 0\n \nfor i in range(N):\n add_W += W[i]\n if add_W >= sum_W - add_W:\n print(min(abs(add_W - sum_W + add_W), abs(add_W - W[i] - sum_W + add_W - W[i])))\n break', 'N = int(input())\nW = list(map(int, input().split()))\n ... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s736977774', 's993231429', 's341569198'] | [3060.0, 3064.0, 2940.0] | [17.0, 17.0, 18.0] | [248, 248, 65] |
p03011 | u152614052 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['a, b, c = map(int, input().split())\nprint(min(min(a+b,b+c),a+c)', 'a, b, c = map(int, input().split())\nprint(min(min(a+b,b+c),a+c))'] | ['Runtime Error', 'Accepted'] | ['s774126831', 's965290260'] | [8928.0, 9008.0] | [19.0, 23.0] | [63, 64] |
p03011 | u153335839 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['p, q, r = map(int, input().split())\nprint(min([p+q, q+r, r+p])', 'p, q, r = map(int, input().split())\nprint(min([p+q, q+r, r+p]))'] | ['Runtime Error', 'Accepted'] | ['s507352852', 's303537056'] | [2940.0, 2940.0] | [17.0, 17.0] | [62, 63] |
p03011 | u155687575 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['pqr = list(map(int, input().split()))\nkumi = [(pqr[0], pqr[1]), (pqr[1], pqr[2]), (pqr[0], pqr[2])\nseki = []\nfor c in kumi:\n\tseki.append(c[0]*c[1])\nprint(min(seki))', "def main():\n p,q,r = map(int, input().split())\n min_time = min([p, q, r])\n print(min_time)\n\nif __name__ == '__main__':\n\tmain()",... | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s459779557', 's976466975', 's987127793', 's600304416'] | [2940.0, 9096.0, 8924.0, 9104.0] | [17.0, 32.0, 20.0, 26.0] | [164, 135, 141, 141] |
p03011 | u156113867 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['P, Q, R = map(int, input().split())\ntimes = [P, Q, R]\nfrom itertools import combinations\n \nmin_ = 200\nfor i in combinations(times, r=2):\n j = sum(i)\n if j < max_:\n min_ = j\n\nprint(min_)', 'P, Q, R = map(int, input().split())\ntimes = [P, Q, R]\nfrom itertools import combinations\n\nmax = 0\nfor i in co... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s280669623', 's572359877', 's983978919'] | [3060.0, 3060.0, 3060.0] | [18.0, 17.0, 17.0] | [190, 183, 189] |
p03011 | u162612857 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['a,b,c = list(map(input.split() ))\nprint (min(a+b, b+c, c+a))', 'a,b,c = list(map(int, input().split() ))\nprint (min(a+b, b+c, c+a))\n'] | ['Runtime Error', 'Accepted'] | ['s040323497', 's922662718'] | [2940.0, 2940.0] | [17.0, 17.0] | [60, 68] |
p03011 | u163874353 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['l= map(int, input().split())\nprint(sum(l) - max(l))', 'l= list(map(int, input().split()))\nprint(sum(l) - max(l))\n'] | ['Runtime Error', 'Accepted'] | ['s257789754', 's447702912'] | [2940.0, 2940.0] | [18.0, 17.0] | [51, 58] |
p03011 | u168416324 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['print(sum(sorted(list(map(int,input().split())[:2]))))', 'print(sum(sorted(list(map(int,input().split()))[:1])))\n', 'print(sum(sorted(list(map(int,input().split())))[:2]))\n'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s167916577', 's771627394', 's362089867'] | [8940.0, 9184.0, 9036.0] | [24.0, 29.0, 25.0] | [54, 55, 55] |
p03011 | u175746978 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['p, q, r = map(int, input().split())\np + q = a\nq + r = b\nr + p = c\nprint(min(a,min(b,c)))', 'p, q, r = map(int, input().split())\na = p + q \nb = q + r\nc = r + p \nprint(min(a,min(b,c)))'] | ['Runtime Error', 'Accepted'] | ['s168277183', 's725011934'] | [2940.0, 2940.0] | [17.0, 17.0] | [88, 91] |
p03011 | u177756077 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['N=int(input())\nW=list(map(int,input().split()))\n\ndiff=[]\nfor i in range(N-1):\n diff.append(abs(sum(W[:i+1])-sum(W[i+1:])))\nprint(min(diff))', 'A=list(map(int,input().split()))\n\nA=sorted(A)\nprint(A[0]+A[1])'] | ['Runtime Error', 'Accepted'] | ['s024691303', 's196720204'] | [3060.0, 2940.0] | [17.0, 17.0] | [142, 62] |
p03011 | u181215519 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['S = [ int(x) for x in input().split() ]\nprint( sum( S ) - min( S ) )', 'S = [ int(x) for x in input().split() ]\nprint( sum( S ) - max( S ) )'] | ['Wrong Answer', 'Accepted'] | ['s301474003', 's071195825'] | [2940.0, 2940.0] | [17.0, 17.0] | [68, 68] |
p03011 | u181668771 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['i = list(map(int, input().split()))\nprint(i)\ni.sort()\nprint(i[0]+i[1])\n', 'list = list(map(int, input().split()))\nprint(list)\nlist.sort()\nprint(list[0]+list[1])\n', 'i = list(map(int, input().split()))\nprint(i)\ni.sort()\nprint(i[0]+i[1])\n', 'i = list(map(int, input().split()))\ni.sort()\nprint(i[0]+i[1])\n'... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s140869210', 's535192843', 's811869768', 's513177705'] | [2940.0, 2940.0, 2940.0, 3316.0] | [17.0, 17.0, 17.0, 21.0] | [71, 86, 71, 62] |
p03011 | u188272222 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['import heapq\npqr = list(map(int,input().split()))\nsum(heapq.nlargest(2,pqr))', 'import heapq\npqr = list(map(int,input().split()))\nprint(sum(heapq.nsmallest(2,pqr)))\n'] | ['Wrong Answer', 'Accepted'] | ['s235919165', 's030422327'] | [9064.0, 9132.0] | [25.0, 29.0] | [76, 85] |
p03011 | u191557685 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['n, m = map(int, input().split())\na = [int(input()) for i in range(m)]\nres_arr = [-1] * n\n\nfor i in a:\n res_arr[i] = 0\n\nfor i in range(1, n):\n if res_arr[i] == 0:\n next\n elif i == 1:\n res_arr[i] = 1\n elif i == 2:\n res_arr[i] = 1 + res_arr[i-1]\n else:\n res_arr[i... | ['Runtime Error', 'Accepted'] | ['s815378384', 's580245674'] | [3064.0, 2940.0] | [17.0, 17.0] | [474, 69] |
p03011 | u193641816 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['p, q, r = map(int, input())\n\nprint(min(p+q, q+r, r+p)', 'p, q, r = map(int, input().split())\n\nprint(min(p+q, q+r, r+p))\n'] | ['Runtime Error', 'Accepted'] | ['s182469353', 's635895470'] | [2940.0, 2940.0] | [18.0, 18.0] | [53, 63] |
p03011 | u194894739 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['N, M = map(int, input().split())\nstatus = [True]*(N+2)\nfor _ in range(M):\n status[int(input())] = False\n\ndp = [0]*(N+2)\ndp[0] = 1\nfor i in range(N):\n if status[i+1]:\n dp[i+1] += dp[i]\n if status[i+2]:\n dp[i+2] += dp[i]\nprint(dp[N])\n', 'P, Q, R = map(int, input().split())\nprint(min... | ['Runtime Error', 'Accepted'] | ['s123432343', 's346839254'] | [3060.0, 2940.0] | [17.0, 17.0] | [255, 62] |
p03011 | u197777377 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['p,q,r = map(int, input().split())\nprint(min(p+q,q+r,r+s))', 'p,q,r = map(int, input().split())\nprint(min(p+q, q+r, r+s))', 'p,q,r = map(int, input().split())\nans = min(p+q, q+r, r+p)\nprint(ans)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s041146641', 's293362452', 's912022854'] | [3064.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [57, 59, 69] |
p03011 | u201802797 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['# solution\nimport io\n\nnim,mike = map(int,input().split())\n\nsets={int(input()) for _ in range(mike)}\n\nmodulous=10**9+7\n\narray=[0]*(nim+1)\narray[0]=1\narray[1]=1\nif 1 in sets:\n array[1]=0\n\nfor i in range(2,nim+1):\n if i in sets:\n continue\n array[i]=(array[i-1]+array[i-2])%modulous\nprint(array[ni... | ['Runtime Error', 'Accepted'] | ['s969611815', 's390666091'] | [3064.0, 2940.0] | [18.0, 17.0] | [302, 79] |
p03011 | u205087376 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['p.q,r = map(int,input().split())\na = int(p+q)\nb = int(q+r)\nc = int(r+p)\nl = []\nl.append(a)\nl.append(b)\nl.append(c)\nprint(min(l))', 'p,q,r = map(int,input().split())\na = int(p+q)\nb = int(q+r)\nc = int(r+p)\nl = []\nl.append(a)\nl.append(b)\nl.append(c)\nprint(min(l))\n'] | ['Runtime Error', 'Accepted'] | ['s231167523', 's747337901'] | [3060.0, 2940.0] | [17.0, 18.0] | [128, 129] |
p03011 | u206787454 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['N, M = map(int, input().split())\nlack = []\nfor _ in range(M):\n lack.append(int(input()))\n\ndef fib(n):\n memo=["EMPTY"]*(n+1)\n def inner(n):\n if n in lack:\n return 0\n elif n == 0:\n return 1\n elif n == 1:\n return 1\n elif memo[n] != "EMPT... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s697482843', 's908000505', 's426793219'] | [3064.0, 3064.0, 2940.0] | [17.0, 17.0, 17.0] | [477, 483, 90] |
p03011 | u214434454 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['p,q,r = map(int,input().split)\nprint(min(p+q, q+r, r+p))', 'p,q,r = map(int,input().split())\nprint(min(p+q, q+r, r+p))'] | ['Runtime Error', 'Accepted'] | ['s317506183', 's177176581'] | [2940.0, 2940.0] | [17.0, 17.0] | [56, 58] |
p03011 | u219506024 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['import sys\n\nargv = sys.argv\na = []\n\nP = int(argv[0])\nQ = int(argv[1])\nR = int(argv[2])\n\na.append(P)\na.append(Q)\na.append(R)\nmax = 0\nfor i in a:\n if max < i:\n max = i\n\nprint(sum(a)-max)', 'import sys\n\nargv = sys.argv\na = []\n\nP = int(argv[1])\nQ = int(argv[2])\nR = int(argv[3])\n\na.appe... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s104887867', 's447837747', 's979139702'] | [3064.0, 3064.0, 3060.0] | [17.0, 17.0, 17.0] | [194, 194, 161] |
p03011 | u220345792 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['data = list(map(int, input().split()))\ndata.sort()\n\nprint(sum(data[:1]))', 'data = list(map(int, input().split()))\ndata.sort()\n\nprint(sum(data[:2]))\n\n'] | ['Wrong Answer', 'Accepted'] | ['s364060136', 's031528000'] | [3060.0, 2940.0] | [19.0, 17.0] | [72, 74] |
p03011 | u223555291 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['a=list(map(int,input().split()))\na.sort()\nprint(a[0]*2+a[1])\n', 'a=list(map(int,input().split()))\na.sort()\nprint(a[0]+a[1])\n'] | ['Wrong Answer', 'Accepted'] | ['s428566137', 's287529283'] | [2940.0, 3060.0] | [17.0, 18.0] | [61, 59] |
p03011 | u225388820 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['def dp(n):\n d=[0]*(n+1)\n if n==1:\n return 1\n else:\n d[0]=1\n if a[1]==0:\n d[1]=1\n else:\n d[1]=0\n for i in range(2,n+1):\n if a[i]==0:\n d[i]=(d[i-1]+d[i-2])%1000000007\n else:\n d[i]=0\n ... | ['Runtime Error', 'Accepted'] | ['s080658132', 's423667093'] | [3064.0, 2940.0] | [17.0, 17.0] | [429, 54] |
p03011 | u225627575 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['STR = input().split()\n\nP = int(STR[0])\nQ = int(STR[1])\nR = int(STR[2])\n\nMAX = P\nif Q > MAX:\n print(P+R)\nelif R > MAX:\n print(Q+P)\nelse:\n print(R+Q)', 'STR = input().split()\n\nP = int(STR[0])\nQ = int(STR[1])\nR = int(STR[2])\n\n\nprint(min(P+Q,Q+R,R+P))'] | ['Wrong Answer', 'Accepted'] | ['s718387573', 's129049279'] | [3060.0, 2940.0] | [17.0, 17.0] | [156, 96] |
p03011 | u227082700 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['p,g,r=map(int,input().split())\nprint(min(p+q,q+r,r+p))', 'p,q,r=map(int,input().split())\nprint(p+q+r-max(p,q,r))'] | ['Runtime Error', 'Accepted'] | ['s749046435', 's252855760'] | [9084.0, 9128.0] | [24.0, 32.0] | [54, 54] |
p03011 | u227085629 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['p,q,r = map(int, input().split())\na = min(p,q,r)\nprint(p+q+r-a)', 'p,q,r = map(int, input().split())\na = max(p,q,r)\nprint(p+q+r-a)'] | ['Wrong Answer', 'Accepted'] | ['s576963982', 's877986457'] | [2940.0, 2940.0] | [18.0, 17.0] | [63, 63] |
p03011 | u227585789 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['P = input()\nQ = input()\nR = input()\n\na = min(P + Q, Q + R, R + P)\nprint(a)', 'P = int(input())\nQ = int(input())\nR = int(input())\n\na = min(P + Q, Q + R, R + P)\nprint(a)', 'a = list(map(int, input().split()))\nb = min(a[0] + a[1], a[1] + a[2], a[2] + a[0])\nprint(b)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s449167451', 's724594400', 's065491763'] | [2940.0, 2940.0, 2940.0] | [17.0, 18.0, 17.0] | [74, 89, 91] |
p03011 | u229621546 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['A,B,C = map(int,input().split())\nprint(A + B + C + max([A,B,C]))', 'A,B,C = map(int,input().split())\nprint(A + B + C - max([A,B,C]))'] | ['Wrong Answer', 'Accepted'] | ['s553295053', 's407559172'] | [2940.0, 2940.0] | [17.0, 17.0] | [64, 64] |
p03011 | u234631479 | 2,000 | 1,048,576 | There are three airports A, B and C, and flights between each pair of airports in both directions. A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours. Consider a route where we start at one of th... | ['L = list(map(int, input().split()))\nL.sort()\nprint(sum(L[1:]))', 'L = list(map(int, input().split()))\nL.sort()\nprint(sum(L[:-1]))'] | ['Wrong Answer', 'Accepted'] | ['s149818910', 's995768861'] | [2940.0, 2940.0] | [17.0, 17.0] | [62, 63] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.