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 |
|---|---|---|---|---|---|---|---|---|---|---|
p03011 | u243373163 | 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())\nif p+q<q+r and p+q<p+r:\n print(p+q)\nelse:\n print(q+r)\n\n', 'p=int(input())\nq=int(input())\nr=int(input())\nif p+q<q+r and p+q<p+r:\n print(p+q)\nif p+r<p+q and p+r<q+r:\n print(p+r)\nelse:\n print(q+r)\n\n', 'p=int(input())\nq=int(input())\nr=int(inp... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s015245003', 's037157917', 's536278337', 's672662446', 's884863264', 's785159044'] | [8968.0, 9112.0, 8972.0, 9180.0, 9160.0, 9060.0] | [21.0, 25.0, 24.0, 29.0, 25.0, 26.0] | [106, 145, 107, 161, 145, 159] |
p03011 | u246639932 | 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'] | ['s773599422', 's887815091'] | [2940.0, 2940.0] | [17.0, 17.0] | [61, 61] |
p03011 | u251075661 | 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(p + q + r - map(p, q, r))', 'import sys\nn, m = map(int, input().split())\n\nif m > 0:\n As = set(map(int, sys.stdin))\nelse:\n As = set()\n\nnums = [0] * (n + 1)\nnums[0] = 1\nif 1 in As:\n pass\nelse:\n nums[1] = 1\n \nfor i in range(2, n + 1):\n if i in As:\n c... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s175394249', 's242273000', 's970309222'] | [2940.0, 3064.0, 2940.0] | [17.0, 17.0, 17.0] | [68, 314, 68] |
p03011 | u252401277 | 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'] | ['s742551553', 's584312197'] | [2940.0, 2940.0] | [17.0, 17.0] | [56, 56] |
p03011 | u252964975 | 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([a+b,b+c,c+a])', 'P,Q,R=map(int, input().split())\nprint(min([P+Q,Q+R,R+P]))'] | ['Runtime Error', 'Accepted'] | ['s530489654', 's914068970'] | [2940.0, 2940.0] | [17.0, 17.0] | [56, 57] |
p03011 | u255406953 | 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\nif P < Q < R:\n\tt1 = P\n t2 = Q\nelif P < R < Q:\n t1 = P\n t2 = R\nelse:\n t1 = Q\n t2 = R\n\nprint(t1+t2)', 'P = int(input())\nQ = int(input())\nR = int(input())\n\nif P < Q < R:\n t1 = P\n t2 = Q\nelif P < R < Q:\n t1 = P\n t2 = R\... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s475204281', 's589689738', 's731993044', 's800965453', 's826741210'] | [2940.0, 3060.0, 2940.0, 3060.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0] | [164, 167, 164, 167, 120] |
p03011 | u261891508 | 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(p+q+r-max[p,q,r])', 'p,q,r=map(int,input().split())\nprint(p+q+r-max([p,q,r]))'] | ['Runtime Error', 'Accepted'] | ['s518426901', 's452052838'] | [2940.0, 2940.0] | [17.0, 17.0] | [54, 56] |
p03011 | u262869085 | 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())\nl.sort()\nprint(l[0]+l[1])\n', 'l =[int(i) for i in input().split()]\nl.sort()\nprint(l[0]+l[1])\n'] | ['Runtime Error', 'Accepted'] | ['s708034480', 's422313066'] | [2940.0, 2940.0] | [17.0, 22.0] | [54, 63] |
p03011 | u264989012 | 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(),sprit()))\nsum = time[0] + time[1]\nif sum > time[1] + time[2]:\n sum = time[1] + time[2]\nif sum > time[0] + time[2]:\n sum = time[0] + time[2]\nprint(sum)\n\n', 'time = list(map(int, input(),split()))\nsum = time[0] + time[1]\nif sum > time[1] + time[2]:\n sum = time[1] + time[2]\nif... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s104174543', 's919837655', 's923437549'] | [2940.0, 3064.0, 3060.0] | [17.0, 18.0, 17.0] | [183, 183, 181] |
p03011 | u268181283 | 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 operator import mul\nfrom functools import reduce\n\nn, m = [int(i) for i in input().split()]\narr = [int(input()) for i in range(m)]\narr.append(n+1)\narr.insert(0, -1)\ndiv_arr = [arr[i+1]-arr[i]-1 for i in range(len(arr)-1)]\n\n\ndef Fib(n):\n a, b = 0, 1\n if n == 1:\n return a\n elif n == 2:... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s144744561', 's311630489', 's527847869'] | [3572.0, 3064.0, 3060.0] | [22.0, 17.0, 18.0] | [501, 783, 158] |
p03011 | u268792407 | 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 math import factorial\nfrom operator import mul\nfrom functools import reduce\nfrom math import sqrt\n\ndef c(n,r):\n r = min(n-r,r)\n if r == 0 or r == n:\n return 1\n else:\n over = reduce(mul, range(n, n - r, -1))\n under = reduce(mul, range(1,r + 1))\n return over // under\ndef num(k): \n ret... | ['Runtime Error', 'Accepted'] | ['s495871149', 's173444053'] | [3572.0, 2940.0] | [22.0, 17.0] | [810, 58] |
p03011 | u271430213 | 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(sorted(list(map(int, input().split())))) \n', 'print(sum(sorted(list(map(int, input().split())))[:2])) '] | ['Wrong Answer', 'Accepted'] | ['s786883500', 's048589980'] | [2940.0, 2940.0] | [17.0, 17.0] | [48, 56] |
p03011 | u274080981 | 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... | ['\np,q,r = map(int, input().split())\n\n\nPrint(p+q+r-max(p, q, r))\n', '\np,q,r = map(int, raw_input().split())\n\n\nPrint(p+q+r-max(p, q, r))', '\np,q,r=map(int, input().split())\n\n\nPrint(p+q+r-max(p, q, r))', '\np,q,r = map(int, raw_input().split())\n\n\nPrint(p+q+r-max(p, q, r))', '\np, q, r = map(int, raw_input... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s229635855', 's302523159', 's356495383', 's458466692', 's697076458', 's759920663', 's771412645', 's888035764', 's031783323'] | [3060.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 3064.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [112, 115, 109, 66, 124, 127, 117, 114, 111] |
p03011 | u276204978 | 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 _ in range(m)]\n \ns = [0 if n-i in a else -1 for i in range(n+1)] \ns[0] = s[1] = 1\n\nfor i in range(2, n+1):\n if s[i] == 0:\n continue\n s[i] = (s[i-1] + s[i-2]) % 1000000007\n\nif s[n] < 0:\n print(0)\nelse:\n print(s[n])', '\n#include ... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s025639446', 's281039978', 's310548247', 's834520542', 's315218950'] | [3064.0, 3060.0, 2940.0, 3064.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0] | [289, 352, 325, 270, 86] |
p03011 | u282228874 | 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#include<string>\n#include<cstdio>\n\n#include<cmath>\n#include<algorithm>\n#include<functional>\n#include<iomanip>\n\n#include<ciso646>\n#include<random>\n#include<map>\n#include<set>\n#include<complex>\n#include<bitset>\n#include<stack>\n\n#include<utility>\n\nusing namespace std;\n\ntypedef long long ll;\nconst ... | ['Runtime Error', 'Accepted'] | ['s037864345', 's308727359'] | [2940.0, 3316.0] | [17.0, 24.0] | [635, 56] |
p03011 | u282657760 | 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())\nNG = []\na = 10**9+7\nfor i in range(M):\n NG.append(int(input()))\nans = [0 for _ in range(N + 2)]\nans[0] = 1\nfor i in range(N):\n if not i + 1 in NG:\n ans[i + 1] = (ans[i + 1] + ans[i])%a\n if not i + 2 in NG:\n ans[i + 2] = (ans[i + 2] + ans[i])%a\nprint(ans[N])', 'P, ... | ['Runtime Error', 'Accepted'] | ['s043076648', 's917973673'] | [3064.0, 2940.0] | [17.0, 17.0] | [299, 59] |
p03011 | u283929013 | 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.sorted()\nprint(a[0] + a[1])', 'a = list(map(int,input().split()))\na.sort()\nprint(a[0] + a[1])'] | ['Runtime Error', 'Accepted'] | ['s248386631', 's490104109'] | [2940.0, 2940.0] | [17.0, 17.0] | [64, 62] |
p03011 | u286486951 | 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 numpy as np\nNM = input()\nN, M = NM.split(" ")\ndel NM\nN, M = int(N), int(M)\nbroken_steps = [int(input()) for num in range(M)]\n#all_steps = [num for num in range(N+1)]\nall_steps = np.ones(N+1, dtype=np.int64) \nall_steps[broken_steps] = 0\nok_steps = list(all_steps)\n#ok_steps = [0 if num in broken_steps... | ['Runtime Error', 'Accepted'] | ['s846907269', 's145965795'] | [12440.0, 2940.0] | [152.0, 17.0] | [1016, 108] |
p03011 | u295811595 | 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=[]\na.append(P)\na.append(Q)\na.append(R)\nprint(a)\na.sort()\nprint(a[0]+a[1])', 'P,Q,R=map(int,input().split())\na=[]\na.append(P+Q)\na.append(P+R)\na.append(Q+R)\nprint(min(a))'] | ['Wrong Answer', 'Accepted'] | ['s321187578', 's681004881'] | [3060.0, 2940.0] | [18.0, 17.0] | [106, 91] |
p03011 | u296150111 | 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,q+p))', 'a,b,c=map(int,input().split())\ns=a+b+c\nd=max(a,b,c)\nprint(s-d)'] | ['Wrong Answer', 'Accepted'] | ['s136250401', 's964572031'] | [2940.0, 2940.0] | [18.0, 17.0] | [54, 62] |
p03011 | u297046168 | 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()))\nP.sort()\nprint(P[0]+P[1])', 'P= list(map(int, input().split()))\nP.sort()\nprint(P[0]+P[1])'] | ['Runtime Error', 'Accepted'] | ['s460801183', 's179188764'] | [2940.0, 2940.0] | [17.0, 17.0] | [59, 60] |
p03011 | u297801580 | 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=[int(x) for x in input().split()]\nprint(max(P+Q,Q+R,R+P))', 'P,Q,R=[int(x) for x in input().split()]\nprint(min(P+Q,Q+R,R+P))'] | ['Wrong Answer', 'Accepted'] | ['s431043823', 's140998986'] | [2940.0, 2940.0] | [17.0, 17.0] | [63, 63] |
p03011 | u299840026 | 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 numpy as np\nn, m = [int(i) for i in input().split()]\na =[]\nd = 1000000007\n\nfor i in range(m):\n a1=int(input())\n a.append(a1)\n\na.append(n+1)\na = np.array(a)\n#print(a)\n\nif 1 in a[1:]-a[:-1]:\n print(0)\n \nelif m == 0:\n dp = [0] * (n + 1)\n dp[1] = 1\n dp[2] = 1\n for i in r... | ['Runtime Error', 'Accepted'] | ['s358936663', 's071506185'] | [12408.0, 3316.0] | [148.0, 24.0] | [763, 74] |
p03011 | u306060982 | 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\na = P + Q\nb = Q + R\nc = R + P\n\nif a > b and a > c:\n print('a')\nelif b > c:\n print('b')\nelse\n print('c')", 'P,Q,R = map(int,input().split())\n\na = P + Q\nb = Q + R\nc = R + P\n\nif b > a and c > a:\n print(a)\nelif b > c:\n print(c)\nelse:\n print(b)'] | ['Runtime Error', 'Accepted'] | ['s575373917', 's986716847'] | [2940.0, 3060.0] | [17.0, 17.0] | [140, 135] |
p03011 | u306497037 | 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 = set([int(x) for x in stdin.readline().rstrip().split()])\nprint(sum(L)-max(L))', 'l = list(map(int, input().split()))\nprint(sum(l)-max(l))'] | ['Runtime Error', 'Accepted'] | ['s713344767', 's892219605'] | [2940.0, 2940.0] | [17.0, 17.0] | [81, 56] |
p03011 | u309120194 | 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\n\nm = 10**10\nfor i in range(1, N):\n a, b = 0, 0\n for j in range(i):\n a += W[j]\n for j in range(i, N):\n b += W[j]\n m = min(m, abs(a-b))\nprint(m)', 'P, Q, R = map(int, input().split())\n \nprint(P + Q + R - max(P, Q, R))'] | ['Runtime Error', 'Accepted'] | ['s888745961', 's170442761'] | [9132.0, 9044.0] | [26.0, 24.0] | [241, 69] |
p03011 | u314906167 | 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... | ['3 2 3\n', 'P, Q, R = map(int, input().split())\nprint(min(P + Q, Q + R, R + P))\n'] | ['Runtime Error', 'Accepted'] | ['s818732301', 's299884792'] | [2940.0, 2940.0] | [17.0, 18.0] | [6, 68] |
p03011 | u315354220 | 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\nif (P + Q) >= (R + Q) and (P + Q) >= (R + P):\n print(P + Q)\nelif (R + Q) >= (P + Q) and (R + Q) >= (R + P):\n print(R + Q)\nelif (R + P) >= (P + Q) and (R + P) >= (P + Q):\n print(R + P)', 'P, Q, R = map(int, input().split())\n\nif (P + Q) <= (R + Q) and (P + Q) <= (R + P):... | ['Wrong Answer', 'Accepted'] | ['s121997807', 's298278991'] | [3064.0, 3064.0] | [18.0, 17.0] | [223, 223] |
p03011 | u318205491 | 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 = input().split()\na = [int(i) for i in a]\na = sort(a)\nprint(a[0]+a[1])', 'a = input().split()\na = [int(i) for i in a]\na = sorted(a)\nprint(a[0]+a[1])'] | ['Runtime Error', 'Accepted'] | ['s845049844', 's971714105'] | [3068.0, 2940.0] | [17.0, 17.0] | [72, 74] |
p03011 | u320763652 | 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(r-q + q-p)', 'line = list(map(int, input().split()))\nline.sort()\nprint(line[0]+line[1])'] | ['Wrong Answer', 'Accepted'] | ['s550559060', 's348142897'] | [2940.0, 2940.0] | [18.0, 18.0] | [51, 73] |
p03011 | u329455846 | 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 itertools\na= list(map(int, input().split()))\nresult = []\ntest = list(itertools.permutations(a, 2))\nfor i in range(test):\n result.append(test[i][0] + test[i][1])\nprint(min(result))', 'import itertools\na= list(map(int, input().split()))\nresult = []\ntest = list(itertools.permutations(a, 2))\nfor i in ... | ['Runtime Error', 'Accepted'] | ['s984012545', 's209263709'] | [3060.0, 3060.0] | [17.0, 17.0] | [189, 194] |
p03011 | u331997680 | 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, P+R, Q+R]\nprint(A)\n', 'P,Q,R = map(int, input().split())\nA = [P+Q, P+R, Q+R]\nprint(min(A))\n'] | ['Wrong Answer', 'Accepted'] | ['s750992271', 's253952815'] | [2940.0, 2940.0] | [17.0, 17.0] | [63, 68] |
p03011 | u332926534 | 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(int(input()) for i in range(3))\ntime.remove(max(time))\nprint(sum(time))', 'time = list(map(int, input().split()))\ntime.remove(max(time))\nprint(sum(time))'] | ['Runtime Error', 'Accepted'] | ['s486900185', 's246367267'] | [2940.0, 2940.0] | [19.0, 17.0] | [83, 78] |
p03011 | u333404917 | 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 = sorted([int(x) for x in input().split()])\nprint(sum(l[1:]))', 'l = sorted([int(x) for x in input().split()],reverse=True)\nprint(sum(l[1:]))'] | ['Wrong Answer', 'Accepted'] | ['s477789500', 's911331558'] | [2940.0, 2940.0] | [17.0, 17.0] | [63, 76] |
p03011 | u335736666 | 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(int, input().split()))\n\nd = max(a, b, c)\ne = min(a, b, c)\n\nprint(d+e)\n', 'lista = input().split(" ")\na, b, c = lista\na = int(a)\nb = int(b)\nc = int(c)\nlista1 = [a, b, c]\nlista1.sort()\nt = lista1[0]+lista1[1]\nprint(t)'] | ['Wrong Answer', 'Accepted'] | ['s390137209', 's382355121'] | [2940.0, 2940.0] | [17.0, 18.0] | [89, 141] |
p03011 | u335951563 | 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 -*-\nN, M = map(int, input().split())\nA = []\nfor _ in range(M):\n A.append(int(input()))\n\nnum_goup = [1]\nfor s in range(1, N + 1):\n if s in A:\n num_goup.append(0)\n continue\n \n if s == 1:\n num_goup.append(1)\n continue\n \n if num_goup[-1] ==... | ['Runtime Error', 'Accepted'] | ['s225413791', 's006611756'] | [3064.0, 2940.0] | [17.0, 17.0] | [618, 67] |
p03011 | u339922532 | 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(input().split())\ns_l = l.sort()\n\nprint(s_l[0] + s_l[1])', 'l = list(map(int, input().split()))\ns_l = sorted(l)\n\nprint(s_l[0] + s_l[1])\n'] | ['Runtime Error', 'Accepted'] | ['s381497584', 's616411568'] | [2940.0, 2940.0] | [17.0, 17.0] | [64, 76] |
p03011 | u342563578 | 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 = []\nmod = 10**9+7\nd = [0 for i in range(n+1)]\n d[0] = 1\n d[1] = 1\n d[2] = 2\n for i in range(3,n+1):\n d[i] = d[i-1] + d[i-2]\n d.append(0)\nif m != 0:\n for i in range(m):\n b = int(input())\n a.append(b)\n ans = 1\n if a[0] == 1:\n... | ['Runtime Error', 'Accepted'] | ['s338839614', 's068208999'] | [2940.0, 2940.0] | [17.0, 17.0] | [489, 65] |
p03011 | u344030307 | 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)]\na.append(n)\na.insert(0, 0)\n\ndef nCr(n, r):\n num = 1\n for i in range(r+1, n+1):\n num *= i\n return num\n\n\nP = 1\nfor i in range(m):\n if a[i] + 1 == a[i+1]:\n print(0)\n exit()\n\nfor i in range(1, m+2):\n step = a[i] - a[i-1]... | ['Runtime Error', 'Accepted'] | ['s111472962', 's167332886'] | [9232.0, 9056.0] | [22.0, 25.0] | [421, 57] |
p03011 | u347545486 | 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+p))'] | ['Runtime Error', 'Accepted'] | ['s777724422', 's218217691'] | [2940.0, 2940.0] | [17.0, 17.0] | [59, 59] |
p03011 | u349091349 | 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... | ['#!/home/ryo/.pyenv/versions/anaconda3-2019.03/envs/hoge/bin/python\nimport time\ntime.sleep(2)\nP,Q,R = map(int,input().split())\nprint(min(P+Q,min(Q+R,R+P)))', '#!/home/ryo/.pyenv/versions/anaconda3-2019.03/envs/hoge/bin/python\n\nP,Q,R = map(int,input().split())\nprint(min(P+Q,min(Q+R,R+P)))'] | ['Time Limit Exceeded', 'Accepted'] | ['s225592555', 's881135434'] | [2940.0, 2940.0] | [2022.0, 17.0] | [154, 129] |
p03011 | u352359612 | 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 = input().split()\n\nif s[0] >= s[1] and s[0] >= s[2]:\n print(s[1] + s[2])\nelif s[1] >= s[0] and s[1] >= s[2]:\n print(s[0] + s[2])\nelse:\n print(s[0] + s[1])', 'a, b, c= (int(i) for i in input().split()) \n\nif a >= b and a >= c:\n print(b + c)\nelif b >= a and b >= c:\n print(a + c)\nelse:\n ... | ['Wrong Answer', 'Accepted'] | ['s464088325', 's199382396'] | [3060.0, 2940.0] | [18.0, 18.0] | [165, 147] |
p03011 | u353919145 | 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\na.sort()\nreturn(a[0]+a[1])', 'valores = [int(input()), int(input()), int(input())]\nvalores.remove(max(valores))\nprint(valores[0]+valores[1])\n', 'linha = input()\nlinha = linha.split()\nmenor = 101\nsegundoMenor = 101\nfor x in linha:\n if int(x) < menor:\n menor = i... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s274880683', 's467253363', 's662400932'] | [3064.0, 2940.0, 3060.0] | [17.0, 17.0, 19.0] | [62, 111, 357] |
p03011 | u360613784 | 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... | ['T=[map(int,input().split())]\nT.sort()\nprint(T[0]+T[1])\n', 'P,Q,R=map(int,input().split())\nT=list(P,Q,R)\nT.sort()\nprint(T[0]+T[1])', 'T=[(map(int,input().split()))]\nT.sort()\nprint(T[0]+T[1])', 'T=list(map(int,input().split()))\nT.sort()\nprint(T[0]+T[1])'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s314181915', 's363578676', 's507333775', 's937524736'] | [2940.0, 2940.0, 2940.0, 2940.0] | [18.0, 17.0, 17.0, 18.0] | [55, 70, 56, 58] |
p03011 | u363237465 | 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 = input().split()\nfor i in range(3):\n pqr[i] = int(pqr[i])\na = min(pqr[0]*pqr[1], pqr[1]*pqr[2], pqr[2]*pqr[0])\nprint(a)\n', 'pqr = input().split()\nfor i in range(3):\n pqr[i] = int(pqr[i])\na = min(pqr[0]+pqr[1], pqr[1]+pqr[2], pqr[2]+pqr[0])\nprint(a)\n'] | ['Wrong Answer', 'Accepted'] | ['s057921752', 's356156709'] | [2940.0, 2940.0] | [17.0, 17.0] | [129, 129] |
p03011 | u364785529 | 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]+a[1])', 'a = list(map(int,input().split()))\na.sort()\nprint(a[0]+a[1])'] | ['Runtime Error', 'Accepted'] | ['s146185021', 's517155390'] | [2940.0, 2940.0] | [17.0, 17.0] | [62, 60] |
p03011 | u366482170 | 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 = set(int(input()) for _ in range(m))\n\n# a.append(int(input()))\nb=[0 for x in range(n+1)]\nb[0]=1\nfor i in range(1,n+1):\n if i in a:\n continue\n x=b[i-1]\n if i>1:x+=b[i-2]\n b[i]=x\nprint(b[n]%(10**9+7))', 'n,m=map(int,input().split())\na=[]\nfor i in range(m):\n a.appe... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s104124861', 's239336249', 's191306131'] | [3064.0, 3064.0, 2940.0] | [19.0, 17.0, 17.0] | [257, 229, 54] |
p03011 | u371530330 | 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(min(p+q,q+r,r+p)', 'p, q, r = map(int, input().split())\nprint(min(p+q, p+r, q+r))'] | ['Runtime Error', 'Accepted'] | ['s887626114', 's419234758'] | [2940.0, 2940.0] | [17.0, 18.0] | [57, 61] |
p03011 | u376328830 | 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 math import *\n\ndef fib(n):\n return ((1+sqrt(5))**(n+1) - (1-sqrt(5))**(n+1)) // (2**(n+1)*sqrt(5))\n\n\ndef how_many_ways(lst_of_broken_steps,goal):\n\n for i in range(len(lst_of_broken_steps)-1):\n if lst_of_broken_steps[i]+1==lst_of_broken_steps[i+1]:\n return 0\n \n \n an... | ['Runtime Error', 'Accepted'] | ['s532552318', 's772047058'] | [3064.0, 3060.0] | [17.0, 20.0] | [985, 69] |
p03011 | u379535139 | 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... | ['num_list = [int(i) for i in input().split()]\n\nLEN = 3\nabc_sum = 0\nfor i in range(len(num_list) - 1):\n abc_sum += num_list[i]\n\nbca_sum = 0\nreversed_list = list(reversed(num_list))\nfor i, num in enumerate(reversed_list, 1):\n if i == LEN:\n break\n bca_sum += num\n\ncab_sum = 0\ncab_sum += num_list[-1]\n... | ['Wrong Answer', 'Accepted'] | ['s409092940', 's851104168'] | [3064.0, 3064.0] | [17.0, 18.0] | [428, 372] |
p03011 | u385244248 | 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(' ') ) )\nif P+Q > P+R. Q+R ;\n print(P+Q)\nelif P+R>P+Q,Q+R:\n print(P+R)\nelse:\n print(Q+R)\n ", 'P, Q, R =map(int, input().split())\nif P+Q <= P+R and P+Q <= Q+R:\n print(P+Q)\nelif P+R <= P+Q and P+R <= Q+R:\n print(P+R)\nelse:\n print(Q+R)'] | ['Runtime Error', 'Accepted'] | ['s016053345', 's105771126'] | [2940.0, 2940.0] | [17.0, 17.0] | [141, 147] |
p03011 | u386782537 | 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... | ['\ntime_list = input().split()\ntime_list = [int(i) for i in time_list]\ntime_list.sort(reverse = True)\nprint(time_list[0]+time_list[1])\n', '\ntime_list = input().split()\ntime_list = [int(i) for i in time_list]\ntime_list.sort()\nprint(time_list[0]+time_list[1])\n'] | ['Wrong Answer', 'Accepted'] | ['s994620758', 's356837066'] | [2940.0, 2940.0] | [17.0, 17.0] | [141, 127] |
p03011 | u390170391 | 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()))\np = list[0]\nq = list[1]\nr = list[2]\nprint(min(p+q,q+r,r+p))', 'l = list(map(int,input().split()))\np = list[0]\nq = list[1]\nr = list[2]\nprint(min([p+q,q+r,r+p]))\n', 'l = list(map(int,input().split()))\np = l[0]\nq = l[1]\nr = l[2]\nprint(min(p+q,q+r,r+p))\n'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s133255141', 's621291516', 's813310703'] | [2940.0, 2940.0, 2940.0] | [18.0, 18.0, 17.0] | [94, 97, 86] |
p03011 | u390883247 | 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,M = map(int,input().split())\nstep = [-1] * (N + 1)\n\nfor _ in range(M):\n a = int(input())\n step[a-1] = 0\n\nif step[0] == -1:\n step[0] = 1\n\nif step[1] == -1:\n step[1] = step[0]+1\n\nfor i in range(2,N):\n if step[i] == -1:\n step[i] = step[i-1]+step[i-2]\n\nprint(step[N-1] % 1000000... | ['Runtime Error', 'Accepted'] | ['s224380847', 's768161200'] | [3064.0, 2940.0] | [17.0, 17.0] | [305, 61] |
p03011 | u392918440 | 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... | ['count = 0\ntotal = 0\nfor i in sorted(a_i):\n total = total + i\n count = count + 1\n if count == 2:\n break\nprint(total)', 'a_i = list(map(int, input().split()))\ncount = 0\ntotal = 0\nfor i in sorted(a_i):\n total = total + i\n count = count + 1\n if count == 2:\n break\nprint(total... | ['Runtime Error', 'Accepted'] | ['s087106307', 's114122346'] | [3064.0, 3060.0] | [17.0, 17.0] | [131, 169] |
p03011 | u396391104 | 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=list(map(int,input().split()))\nprint(sorted(list)[1]+sorted(list)[2])', 'list=list(map(int,input().split()))\nprint(sorted(list)[0]+sorted(list)[1])'] | ['Wrong Answer', 'Accepted'] | ['s573717622', 's522960731'] | [2940.0, 2940.0] | [17.0, 17.0] | [74, 74] |
p03011 | u399973890 | 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.sort\nprint(PQR[0]+PQR[1]', 'PQR = list(map(int, input().split()))\nPQR.sort\nprint(PQR)\nprint(PQR[0]+PQR[1])', 'PQR = list(map(int, input().split()))\nPQR.sort(reverse=False)\nprint(PQR[0]+PQR[1])'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s252390300', 's734526769', 's665407446'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [66, 78, 82] |
p03011 | u411544692 | 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(sum(A,B,C)-max(A,B,C))', 'A, B, C = map(int,input().split())\nprint(sum([A,B,C])-max(A,B,C))\n\n'] | ['Runtime Error', 'Accepted'] | ['s068841502', 's275324237'] | [2940.0, 2940.0] | [17.0, 18.0] | [63, 67] |
p03011 | u440129511 | 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,r)+min(p,q,r)[1])', 'k=list(map(int,input().split()))\nk.sort\nprint(k[2]+k[1])', 'k=list(map(int,input().split()))\nk.sort()\nprint(int(k[0])+int(k[1]))'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s396595135', 's898920813', 's701730752'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [62, 56, 68] |
p03011 | u440478998 | 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... | ['sum(sorted(list(map(int, input().split())))[:2])', 'print(sum(sorted(list(map(int, input().split())))[:2]))'] | ['Wrong Answer', 'Accepted'] | ['s356791766', 's066469855'] | [9056.0, 9124.0] | [29.0, 23.0] | [48, 55] |
p03011 | u446628914 | 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()))\nl=[p[i]*p[j] for i in range(3) for j in range(i+1,3)]\nprint(min(l))', 'p = list(map(int,input().split()))\nl=[p[i]+p[j] for i in range(3) for j in range(i+1,3)]\nprint(min(l))\n'] | ['Wrong Answer', 'Accepted'] | ['s749197705', 's595731193'] | [2940.0, 2940.0] | [17.0, 18.0] | [102, 103] |
p03011 | u453634575 | 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 = list(map(int, input().split()))\nn,m = s[0],s[1]\na = [int(input()) for i in range(m)]\n\n\n\nif n == 1:\n print(1)\n\nelif n == 2:\n if m == 0:\n print(2)\n elif m == 1:\n if a[0] == 2:\n print(0)\n else:\n print(1)\n \n \nelif n == a[-1]:\n print(... | ['Runtime Error', 'Accepted'] | ['s901443854', 's605863875'] | [3064.0, 2940.0] | [17.0, 17.0] | [709, 61] |
p03011 | u459965464 | 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())\ng = input().split()\na = [int(i) for i in g]\nb = list()\nfor i in reversed(g):\n b.append(int(i))\nx = list()\ny = list()\nz = list()\np = 0\nq = 0\nr = 0\ns = 0\nc = n-1\nfor i in range(n):\n for i in a:\n x.append(i)\n r += 1\n if r == c:\n break\n p = sum(x)-p\n for i in b:\n... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s156118807', 's182450840', 's410973825', 's441843636', 's361126339'] | [3064.0, 2940.0, 3060.0, 3064.0, 3060.0] | [17.0, 17.0, 18.0, 18.0, 17.0] | [419, 85, 109, 393, 111] |
p03011 | u460386402 | 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=sorted(a)\ncon=0\nfor i in range(1):\n con+=a[i]\n \nprint(con)', 'a=list(map(int,input().split()))\na=sorted(a)\ncon=a[0]+a[1]\nprint(con)'] | ['Wrong Answer', 'Accepted'] | ['s043752281', 's221501852'] | [2940.0, 2940.0] | [17.0, 17.0] | [95, 69] |
p03011 | u461251541 | 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\nimport sys\ndef compare(i,j,k):\n if i>=j:\n if j>=k:\n print(j+k)\n elif j<k:\n if i<=k:\n print(i+j)\n else:\n print(k+j)\n elif i<j:\n if k>=j:\n print(i+j)\n elif k<j:\n ... | ['Wrong Answer', 'Accepted'] | ['s377200623', 's535068382'] | [3064.0, 2940.0] | [17.0, 17.0] | [379, 54] |
p03011 | u464028149 | 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... | ['\nCopy\nCopy\nfrom functools import lru_cache\n \n \nN, M = map(int, input().split())\n\na = []\nfor _ in range(M):\n a.append(int(input()))\n\nroot = 0\n\nnow = 0\n \n \ndef isSafe(now):\n \n now_1 = not (now-1) in a\n now_2 = not (now-2) in a\n if now<=1:\n return 0\n elif now==2:\n ... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s302932240', 's718465448', 's213190100'] | [3064.0, 2940.0, 2940.0] | [17.0, 17.0, 18.0] | [1060, 112, 113] |
p03011 | u468189539 | 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(L[0]+L[1])', 'L=list(input())\nL.sort()\n\nans= L[0]+L[1]\n\nprint(ans)', 'L=list(input())\nL.sort()\nprint(L[0]+L[1])', 'L= list(map(int, input().split()))\nL.sort()\nprint(L[0]+L[1])'] | ['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s441630463', 's684417393', 's828482230', 's906489545'] | [2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 18.0, 17.0] | [56, 52, 41, 60] |
p03011 | u472492255 | 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\np, q, r = [int(x) for x in input().rstrip().split(" ")]\n\ns = []\ns[0] = p + q\ns[1] = q + r\ns[2] = r + p\n\nprint(min(s))\n', '# coding: utf-8\n\np, q, r = [int(x) for x in input().rstrip().split(" ")]\n\ns = [0, 0, 0]\ns[0] = p + q\ns[1] = q + r\ns[2] = r + p\n\nprint(min(s))\n'] | ['Runtime Error', 'Accepted'] | ['s517518252', 's420686268'] | [2940.0, 2940.0] | [17.0, 17.0] | [135, 142] |
p03011 | u474423089 | 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... | ["mod = 10**9+7\n\ndef fac(n):\n fac = [1]*(n+1)\n fac[0] = 1\n fac[1] = 1\n for i in range(1,n+1):\n fac[i] = fac[i-1]*i%mod\n return fac\n\ndef main():\n n,m=map(int,input().split(' '))\n fact = fac(n)\n check = 0\n pattern = 1\n a = [0]\n a_list = []\n tmp = -1\n for i i... | ['Runtime Error', 'Accepted'] | ['s227773076', 's860793311'] | [3064.0, 2940.0] | [17.0, 17.0] | [751, 148] |
p03011 | u474514603 | 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# -*-\n"""\noj dl https://atcoder.jp/contests/abc116/tasks/abc116_d -d test-d\noj test -d test-d -c "python abc116d.py"\noj test -d test-d -c "python abc116d.py" test-d/sample-3.in\n"""\nfrom collections import defaultdict\nimport sys\nimport math\nfrom datetime import datetime\n\ndef sol(p, q, r... | ['Wrong Answer', 'Accepted'] | ['s106047719', 's509364687'] | [3816.0, 3688.0] | [288.0, 22.0] | [1276, 1276] |
p03011 | u477977638 | 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=sorted(list(input()))\nprint(int(a[0])+int(a[1]))', 'a=sorted(list(input()))\nprint(int(a[0])+int(a[1])', 'a=sorted(list(input().split()))\nprint(int(a[0])+int(a[1]))'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s365301517', 's652743343', 's812924847'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [50, 49, 58] |
p03011 | u495903598 | 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... | ['#!/usr/bin/env python\n# coding: utf-8\n\n# In[64]:\n\n\nimport numpy as np\nH, W = map(int, input().split())\nS = np.array([list(input()) for i in range(H)])\n"""\n4 6\n#..#..\n.....#\n....#.\n#.#...\n"""\n\n\n# In[72]:\n\n\nfield = np.ones((H, W))\nfield[S==\'#\'] = 0\nlm, rm, um, dm = (field.copy() for _ in [0]*4)... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s722544538', 's756739261', 's894294423'] | [12408.0, 12424.0, 2940.0] | [151.0, 148.0, 17.0] | [652, 1250, 149] |
p03011 | u500297289 | 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, P + R))', 'P, Q, R = map(int, input().split())\nprint(min(P + Q, Q + R, P + R))'] | ['Wrong Answer', 'Accepted'] | ['s635410876', 's963364545'] | [2940.0, 2940.0] | [17.0, 17.0] | [67, 67] |
p03011 | u507613674 | 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, math, heapq\nstdin = sys.stdin\nread_int = lambda : list(map(int,stdin.readline().split()))\nH, W = read_int()\n\n\n# nomal\nL = [[0 for _ in range(W)] for _ in range(H)]\nR = [[0 for _ in range(W)] for _ in range(H)]\nU = [[0 for _ in range(W)] for _ in range(H)]\nD = [[0 for _ in range(W)] for _ in rang... | ['Runtime Error', 'Accepted'] | ['s307984998', 's660281260'] | [3188.0, 3948.0] | [18.0, 36.0] | [1224, 357] |
p03011 | u508486691 | 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\nimport numpy as np\nfrom decimal import *\nL,A,B,M=map(int, input().split())\n\ndef matpow(X,n,mod):\n E = np.eye(N=X.shape[0],dtype=int)\n Y = X%mod\n if n == 1:\n return Y\n else:\n return np.dot(matpow(np.dot(Y,Y)%mod,n//2,mod), (Y if n % 2 else E))%mod\n \na = 0\nfor d in range(1,19):\n l... | ['Runtime Error', 'Accepted'] | ['s377467515', 's531395910'] | [13652.0, 2940.0] | [156.0, 17.0] | [707, 62] |
p03011 | u518064858 | 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())\nans=min(p*2,q*2,r*2,p+q,q+r,r+p)', 'p,q,r=map(int,input().split())\nans=min(p*2,q*2,r*2,p+q,q+r,r+p)\nprint(ans)', 'p,q,r=map(int,input().split())\nans=min(p+q,q+r,r+p)\nprint(ans)\n'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s632978113', 's649313099', 's902165481'] | [2940.0, 3316.0, 3316.0] | [17.0, 19.0, 19.0] | [63, 74, 63] |
p03011 | u521607149 | 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 = int(x) for x in 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'] | ['s469052896', 's804779925'] | [2940.0, 2940.0] | [17.0, 17.0] | [68, 62] |
p03011 | u524765246 | 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 numpy as np\nlst = list(input().split())\n\nnum = len(lst)\n\nA = lst[0] + lst[1]\nB = lst[1] + lst[2]\nC = lst[0] + lst[2]\n\nprint(np.min(np.array(A,B,C)))', 'import numpy as np\nlst = list(input().split())\n\nnum = len(lst)\n\nA = lst[0] + lst[1]\nB = lst[1] + lst[2]\nC = lst[0] + lst[2]\n\nprint(min(np.arr... | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s357720357', 's438252784', 's784169090', 's928351210', 's701659544'] | [13328.0, 12504.0, 3060.0, 12396.0, 3060.0] | [169.0, 150.0, 17.0, 152.0, 17.0] | [155, 152, 109, 147, 132] |
p03011 | u525180860 | 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())\nprint("{}".format(min([P+Q,Q+R,R+P])))', 'P=int(input())\nQ=int(input())\nR=int(input())\n\na=[P+Q,Q+R,R+P]\n\nprint("{}".format(min(a))\n\n', 'P, Q,R = map(int, input().split())\nprint("{}".format(min([P+Q,Q+R,R+P])))'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s713077713', 's787573791', 's104245580'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [83, 90, 73] |
p03011 | u527993431 | 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 = int(input())\nW = list(map(int,input().split()))\ntmp = 0\nans = 0\nwa = 0\n\nfor i in range (A):\n wa += W[i]\nfor i in range (A):\n tmp += W[i]\n tmp_r = wa-tmp\n if i == 0:\n ans = tmp\n if ans > abs(tmp-tmp_r):\n ans = abs(tmp-tmp_r)\nprint(ans)', 'P,Q,R=map(int,input().split())\n... | ['Runtime Error', 'Accepted'] | ['s060093306', 's780801966'] | [3064.0, 2940.0] | [17.0, 17.0] | [267, 54] |
p03011 | u532966492 | 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=[[i=="." for i in input()+"#"] for _ in range(H)]+[[False]*(W+1)]\n\nmap_=[[0]*W for _ in range(H)]\nfor i in range(H):\n cnt=0\n q=[]\n for j in range(W+1):\n if S[i][j]==False and cnt!=0:\n for Q in q:\n map_[Q[0]][Q[1]]=cnt\n cnt=... | ['Runtime Error', 'Accepted'] | ['s411120200', 's861415747'] | [3064.0, 2940.0] | [18.0, 17.0] | [698, 54] |
p03011 | u534308356 | 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())\nbroken_data = [int(input()) for _ in range(M) ]\nans = 0\n \nmemo = [-1] * (N+1)\ndef countWays(n):\n if n < 0 or (n in broken_data):\n return 0\n elif n == 0:\n return 1\n else:\n if memo[n] > -1:\n return memo[n]\n else:\n ... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s689531623', 's869063757', 's666996110'] | [3064.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [411, 87, 76] |
p03011 | u536685012 | 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\ntotal = p + q + r\n\na = min(p, q, r)\n\nprint(total - a)', 'p, q, r = map(int, input().split())\n\ntotal = p + q + r\n\na = max(p, q, r)\n\nprint(total - a)\n'] | ['Wrong Answer', 'Accepted'] | ['s974948697', 's874646311'] | [3064.0, 2940.0] | [17.0, 17.0] | [90, 91] |
p03011 | u538956308 | 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... | ['result=[]\nN = int(input())\nW = list(map(int,input().split()))\nfor i in range(1:N+1):\n a = W[:i]\n b = W[i+1:N]\n c = sum(a)\n d = sum(b)\n e = abs(c-d)\n result.append(e)\n \nprint(min(result))', 'i = list(map(int,input().split()))\na = i[0]+i[1]\nb = i[0]+i[2]\nc = i[1]+i[2]\nd = list(a,b,c)\nprint(min(d))... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s225645869', 's541143875', 's789556336', 's380702951'] | [2940.0, 2940.0, 2940.0, 3064.0] | [17.0, 17.0, 17.0, 17.0] | [192, 106, 107, 102] |
p03011 | u543954314 | 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))\n', 'l = map(int,input().split())\nprint(sum(l)-max(l))\n', 'l* = map(int,input().split())\nprint(sum(l)-max(l))', 'l = list(map(int,input().split()))\nprint(sum(l)-max(l))'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s576658248', 's776043812', 's836051017', 's243908730'] | [2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0] | [52, 50, 50, 55] |
p03011 | u546104065 | 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\n\n\n\n\nprint("{} {}".format(min(p+q, q+r, r+p), s))\n', 'p, q, r = map(int, input().split())\n\n\n\n \n \nprint("{}".format(min(p+q, q+r, r+p)))'] | ['Runtime Error', 'Accepted'] | ['s226725317', 's533355431'] | [2940.0, 2940.0] | [17.0, 17.0] | [127, 122] |
p03011 | u549497563 | 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))', 'x= list(map(int,input().split()))\nprint(sum(x)-max(x))'] | ['Runtime Error', 'Accepted'] | ['s701679923', 's776190412'] | [2940.0, 2940.0] | [17.0, 17.0] | [61, 54] |
p03011 | u550061714 | 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 _ in range(M):\n A.append(int(input()))\n\ncase = [0] * (N + 1)\ncase[0] = 1\nif not 1 in A:\n case[1] = 1\nfor x in range(2, N + 1):\n if x in A:\n case[x] = 0\n elif x - 1 in A:\n case[x] = case[x - 2]\n else:\n case[x] = case[x - 1] ... | ['Runtime Error', 'Accepted'] | ['s319871272', 's840149544'] | [3064.0, 2940.0] | [18.0, 19.0] | [345, 55] |
p03011 | u556477263 | 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(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'] | ['s157717607', 's791967090'] | [9028.0, 9100.0] | [21.0, 28.0] | [53, 57] |
p03011 | u556594202 | 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(R+Q,Q+R,R+P))', 'P,Q,R = map(int,input().split())\nprint(min(P+Q,Q+R,R+P))\n'] | ['Wrong Answer', 'Accepted'] | ['s843494758', 's269084944'] | [9064.0, 9152.0] | [31.0, 27.0] | [56, 57] |
p03011 | u558059388 | 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=(int(x) for x in input().split())\nif P >= Q and R:\n print(Q+R)\nelif Q >= P and R:\n print(P+R)\nelif R >= P and Q:\n print(P+Q)\n ', 'P,Q,R=(int(x) for x in input().split())\nif P >= Q and R:\n print(Q+R)\nelif Q >= P and R:\n print(P+R)\nelse:\n print(P+Q)\n ', 'P,Q,R=(int(x) for x in input().split(... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s005642614', 's613968807', 's918716989'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [136, 123, 66] |
p03011 | u564589929 | 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 \nsys.setrecursionlimit(10 ** 6)\nINF = float("inf")\nMOD = 10 ** 9 + 7\n \n \ndef input():\n return sys.stdin.readline().strip()\n \n \ndef main():\n N, M = map(int, input().split())\n dp = [0] * (N + 1)\n safe = [True] * (N + 1)\n for _ in range(M):\n a = int(input())\n saf... | ['Runtime Error', 'Accepted'] | ['s649915809', 's824160102'] | [3064.0, 2940.0] | [17.0, 17.0] | [595, 66] |
p03011 | u564906058 | 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'] | ['s105710725', 's294223684'] | [2940.0, 2940.0] | [17.0, 17.0] | [58, 58] |
p03011 | u566483072 | 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]+a[1])', 'a = list(map(int,input().split()))\na.sort()\nprint(a[0]+a[1])'] | ['Runtime Error', 'Accepted'] | ['s000250658', 's589098314'] | [2940.0, 2940.0] | [17.0, 17.0] | [59, 60] |
p03011 | u569079213 | 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())\ninp=list(map(int,input().split(' ')))\nsu=sum(inp)\nab=su\nfor i in range(N):\n s1=0\n for j in range(i):\n s1+=inp[j]\n if (ab>abs(2*s1-su)):\n ab=abs(2*s1-su)\nprint(ab)", "inp=list(map(int,input().split(' ')))\nprint(min(inp)+sorted(inp)[1])"] | ['Runtime Error', 'Accepted'] | ['s194778085', 's522804746'] | [3060.0, 2940.0] | [17.0, 17.0] | [186, 68] |
p03011 | u572012241 | 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()))\n\nmn = 200\nfor i in p[:-2]:\n for j in p[i+1:]:\n if (i+j < mn):\n mn = i+j\n\nprint(mn)\n\n\n', 'p = list(map(int,input().split()))\n\nmn = 200\nfor i in range(2):\n for j in range(i+1,3):\n if (i+j < mn):\n mn = i+j\n\nprint(mn)\n\n\n', ... | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s050243607', 's099671814', 's828519339', 's975237786'] | [2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0] | [141, 148, 132, 160] |
p03011 | u572142121 | 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... | ['input()', 'p,q,r=map(int,input().split())\nprint(min(p+q,q+r,r+p))'] | ['Wrong Answer', 'Accepted'] | ['s569416477', 's396357827'] | [2940.0, 2940.0] | [17.0, 17.0] | [7, 54] |
p03011 | u575653048 | 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'] | ['s542208171', 's749943815'] | [2940.0, 2940.0] | [17.0, 17.0] | [69, 69] |
p03011 | u577138895 | 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 \nH, W = list(map(int, input().split()))\n\n# H, W = 4, 6\nboard = []\nL = [[0 for i in range(W)] for i in range(H)]\nR = [[0 for i in range(W)] for i in range(H)]\nU = [[0 for i in range(W)] for i in range(H)]\nD = [[0 for i in range(W)] for i in range(H)]\n\n# board = [[\'#\', \'.\', \'.\', \'#\', \'.... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s020633159', 's086803284', 's410345666', 's924454316', 's084222371'] | [3188.0, 3188.0, 2940.0, 2940.0, 2940.0] | [18.0, 18.0, 17.0, 18.0, 17.0] | [1359, 1358, 67, 35, 67] |
p03011 | u580093517 | 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\nn,m = map(int,input().split())\n\nif m > 0:\n broken = set(map(int,sys.stdin))\nelse:\n broken = set()\n \ndp = [0]*(n+1)\ndp[0] = 1\ndp[1] = 1 if 1 not in broken else 0\n\nMOD = 10**9 + 7\n\nfor i in range(2,n+1):\n if i in broken:\n continue\n dp[i] =\u3000(dp[i-1]+dp[i-2])% MOD\n ... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s130234280', 's958410845', 's936544078'] | [3192.0, 3064.0, 2940.0] | [18.0, 17.0, 17.0] | [314, 310, 66] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.