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 | u580236524 | 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(i) for i in input().split(' ')]\n\nl = list(p,q,r)\nl.sort()\n\nans=l[0]+l[1]\n\nprint(ans)", "p,q,r = [int(i) for i in input().split(' ')]\n\nx= p+q\ny= q+r\nz= r+z\n\nprint(min([x,y,z]))", "pqr = [int(i) for i in input().split('')]\n\nx = p+q\ny = q+r\nz = r+p\n\nprint(min([x,y,z]))", "p,q,r = [int(i) ... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s196739016', 's401072941', 's595518930', 's605486537', 's640210626', 's675207308', 's299484443'] | [3060.0, 3060.0, 2940.0, 2940.0, 3060.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [97, 87, 87, 87, 97, 97, 81] |
p03011 | u580258754 | 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)]\ndp = [0 for i in range(N+1)]\ndp[0] = 1\ndp[1] = 1\nfor i in range(2,N+1):\n if (i-2 in a) and (i-1 in a):\n dp[-1] = 0\n break\n elif i-2 in a:\n dp[i] = dp[i-1]\n elif i-1 in a:\n dp[i] = dp[i-2]\n else:\n dp[i] = dp[i-1] + dp... | ['Runtime Error', 'Accepted'] | ['s299035432', 's803174067'] | [3064.0, 2940.0] | [17.0, 17.0] | [334, 56] |
p03011 | u581040514 | 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(int(sum(PQR[:1])))\n', 'PQR = list(map(int, input().split()))\nPQR.sort()\nprint(sum(PQR[:1]))\n', 'PQR = list(map(int, input().split()))\nPQR.sort()\nprint(int(sum(PQR[:2])))\n'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s104001005', 's571441153', 's865951826'] | [3064.0, 2940.0, 3064.0] | [17.0, 17.0, 18.0] | [74, 69, 74] |
p03011 | u589381719 | 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()))\nsum(sorted(s, reverse=True)[0:2])', 's = list(map(int,input().split()))\nsum(sorted(s)[0:2])', 's = list(map(int,input().split()))\nprint(sum(sorted(s)[0:2]))'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s235808618', 's860799224', 's089727679'] | [2940.0, 2940.0, 2940.0] | [17.0, 18.0, 17.0] | [68, 54, 61] |
p03011 | u589432040 | 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+A))\n', 'P, Q, R = map(int, input()split())\nprint(min(P+Q, Q+R, R+A))', 'P, Q, R = map(int, input().split())\nprint(min(P+Q, Q+R, R+P))\n'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s123247192', 's359905731', 's586405994'] | [2940.0, 2940.0, 2940.0] | [18.0, 17.0, 17.0] | [62, 60, 62] |
p03011 | u589578850 | 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(input())\nprint(min(p+q, p+p+r, q+r, q+q+p, r+p, r+r+q))', 'p,q,r = map(int,input().split())\nprint(min(p+q, p+p+r, q+r, q+q+p, r+p, r+r+q))'] | ['Runtime Error', 'Accepted'] | ['s923405575', 's705925547'] | [2940.0, 2940.0] | [17.0, 17.0] | [67, 79] |
p03011 | u589969467 | 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()))\nprint(sum(a)-min(a))', 'a = list(map(int,input().split()))\nprint(sum(a)-max(a))'] | ['Wrong Answer', 'Accepted'] | ['s798760956', 's671896076'] | [9092.0, 8940.0] | [30.0, 28.0] | [55, 55] |
p03011 | u591016708 | 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(input().split())[:2]))', 'print(sum(sorted(list(map(int, input().split())))[:2]))'] | ['Runtime Error', 'Accepted'] | ['s011471252', 's048371807'] | [2940.0, 2940.0] | [17.0, 17.0] | [39, 55] |
p03011 | u591919975 | 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... | ['is=list(map(int,input().split()))\nprint(sorted(lis)[0]+sorted(lis)[1])', 'lis=list(map(int,input().split()))\nprint(sorted(lis)[0]+sorted(lis)[1])'] | ['Runtime Error', 'Accepted'] | ['s685432463', 's875193124'] | [8908.0, 9072.0] | [24.0, 27.0] | [70, 71] |
p03011 | u594391527 | 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()\nld = sorted(s, reverse=False)[:2]\nprint(ld)\nsum(int(i) for i in ld)', 's = input().split()\nld = sorted(s, reverse=False)[:2]\ns = sum(int(i) for i in ld)\nprint(s)'] | ['Wrong Answer', 'Accepted'] | ['s719113332', 's759811179'] | [2940.0, 2940.0] | [17.0, 17.0] | [87, 90] |
p03011 | u594956556 | 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()))\nprint(sum(p)-max(p))', 'p = list(map(int, input().split()))\nprint(sum(p)-max(p))'] | ['Runtime Error', 'Accepted'] | ['s166135439', 's979995124'] | [2940.0, 2940.0] | [17.0, 17.0] | [48, 56] |
p03011 | u595657182 | 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 main():\n PQR = list(map(int, input().split()))\n newPQR = sorted(PQR)\n print(newPQR)\n arr = newPQR[:2]\n print(arr[0]+arr[1])\nmain()', 'def main():\n PQR = list(map(int, input().split()))\n newPQR = sorted(PQR)\n arr = newPQR[:2]\n print(arr[0]+arr[1])\nmain()'] | ['Wrong Answer', 'Accepted'] | ['s413170713', 's898951641'] | [2940.0, 3064.0] | [17.0, 17.0] | [149, 131] |
p03011 | u596331001 | 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()))\n\nm=sorted(l)[:2]\n\nn=sum(m)\n', 'P,Q,R=map(int,input().split())\n\n#P=AB Q=BC R=AC\n#ABC ACB BAC BCA CAB CBA\n\nlist=[]\nlist.append(P+Q)\nlist.append(R+Q)\nlist.append(P+R)\nlist.append(Q+R)\nlist.append(R+P)\nlist.append(Q+P)\n\n\na=sorted(list)\n\nprint(a[0])'] | ['Wrong Answer', 'Accepted'] | ['s533140495', 's982182569'] | [2940.0, 3060.0] | [17.0, 17.0] | [60, 213] |
p03011 | u600261652 | 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'] | ['s181635703', 's606608664'] | [2940.0, 2940.0] | [17.0, 17.0] | [61, 61] |
p03011 | u600319862 | 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 = [int(i) for i in input().split()] \ns = min(list)\nlist.strip(s)\nt = min(list)\nTime = s+t\nprint(Time)', 'list = [int(i) for i in input().split()] \ns = min(list)\nlist.remove(s)\nt = min(list)\nTime = s+t\nprint(Time)'] | ['Runtime Error', 'Accepted'] | ['s397407657', 's499708375'] | [2940.0, 2940.0] | [17.0, 17.0] | [106, 107] |
p03011 | u607729897 | 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()))\nsorted(PQR)\nprint(PQR[1]+PQR[2])\n\n\n\n', 'PQR=list(map(int,input().split()))\nPQR.sort()\nprint(PQR[1]+PQR[0])'] | ['Wrong Answer', 'Accepted'] | ['s010710757', 's520091139'] | [2940.0, 2940.0] | [17.0, 17.0] | [71, 66] |
p03011 | u608726540 | 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=0\nif m!=0:\n a=int(input())\nb=1\ns=[1]*(n+1)\nfor i in range(1,n+1):\n if i!=a:\n if i-2>=0:\n s[i]=(s[i-1]+s[i-2])%1000000007\n else:\n s[i]=s[i-1]%1000000007\n elif b!=m:\n s[i]=0\n a=int(input())\n b+=1\n else:\n... | ['Runtime Error', 'Accepted'] | ['s335473777', 's050420309'] | [3064.0, 2940.0] | [17.0, 17.0] | [337, 82] |
p03011 | u615968644 | 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=100000000;\ns1=0\ns2=0\n \nfor i in range(n):\n s1 += sum(w[:i+1])\n s2 += sum(w[i+1:])\n \n if abs(s1-s2) < ans:\n ans = abs(s1-s2)\n \nprint(ans)', 'p, q, r =(int(i) for i in input().split())\nans1=p+q\nans2=q+r\nans3=p+r\n\nif ans1... | ['Runtime Error', 'Accepted'] | ['s174711610', 's492958105'] | [3064.0, 3060.0] | [17.0, 18.0] | [218, 189] |
p03011 | u619819312 | 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\ndef f(a,r):\n s=[[0,0],[0,0]]\n s[0][0]=(a[0][0]*r[0][0]+a[0][1]*r[1][0])%mod\n s[0][1]=(a[0][0]*r[0][1]+a[0][1]*r[1][1])%mod\n s[1][0]=(a[1][0]*r[0][0]+a[1][1]*r[1][0])%mod\n s[1][1]=(a[1][0]*r[0][1]+a[1][1]*r[1][1])%mod\n return s\nb=[[1,1],[1,0]]\nk=[b]\nfor i in range(20):\n k.ap... | ['Runtime Error', 'Accepted'] | ['s669343693', 's251680286'] | [3192.0, 2940.0] | [18.0, 17.0] | [956, 48] |
p03011 | u626337957 | 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 = int(input())\nA = list(map(int, input().split()))\nH = sum(A) / 2\nS = 0\nfor i in range(num):\n S += A[i]\n if abs(H - (S + A[i+1])) >= abs(H - S):\n print(abs(2 * S - 2 * H))\n break\n \n', 'F, S, T = map(int, input().split())\nFS = F + S\nST = S + T\nTF = T + F\nL = [FS, ST, TF]\nprint(max(L))', '... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s704056097', 's752901687', 's111347103'] | [2940.0, 2940.0, 2940.0] | [17.0, 18.0, 17.0] | [196, 99, 100] |
p03011 | u631579948 | 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(max(a+b,b+c,a+c))', 'a,b,c=map(int,input().split())\nprint(min(a+b,b+c,a+c))\n'] | ['Wrong Answer', 'Accepted'] | ['s356511589', 's711582084'] | [2940.0, 2940.0] | [17.0, 17.0] | [54, 55] |
p03011 | u632423548 | 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(hello)', 'x = input().split()\nsum1 = int(x[0]) + int(x[1])\nsum2 = int(x[1]) + int(x[2])\nsum3 = int(x[0]) + int(x[2])\nprint(min(sum1, sum2, sum3))'] | ['Runtime Error', 'Accepted'] | ['s630359137', 's917702177'] | [2940.0, 2940.0] | [18.0, 17.0] | [12, 135] |
p03011 | u633320358 | 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\n\ntime=input().split()\n\ntimed=sorted(time)\n\nprint(timed[0]+timed[1])', 'import numpy as np\n\ntime=input().split()\n\ntimed=sorted(time)\nprint(timed)\n\nprint(int(timed[0])+int(timed[1]))', 'time=list(map(int,input().split()))\n\ntimed=sorted(time)\n\nprint(int(timed[0])+int(timed[1]))'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s560208122', 's799650466', 's857122309'] | [12392.0, 20392.0, 2940.0] | [151.0, 307.0, 17.0] | [86, 109, 91] |
p03011 | u635540732 | 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 = float('inf')\nfor j in range(n):\n ans = min(ans,abs(sum(w[0:j])-sum(w[j:n])))\nprint(ans)\n\n", 'def fib(n):\n a, b = 1, 1\n if n == 1:\n return a\n elif n == 2:\n return b\n else:\n for i in range(n-2):\n a, b =... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s854106115', 's975861007', 's975915977'] | [2940.0, 3316.0, 2940.0] | [17.0, 21.0, 17.0] | [148, 488, 57] |
p03011 | u636775911 | 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(i) for i in input().split]\nn.sort()\nprint(n[0]+n[1])', 'n=[int(i) for i in input().split()]\nn.sort()\nprint(n[0]+n[1])'] | ['Runtime Error', 'Accepted'] | ['s064892094', 's931956529'] | [3060.0, 3060.0] | [18.0, 21.0] | [59, 61] |
p03011 | u638393586 | 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\nlist = [P, Q, R]\nmin1 = min(list)\nlist.pop(min1)\nmin2 = min(list)\nprint(min1 + min2)', 'P, Q, R = map(int, input().split())\n\nlist = [P, Q, R]\nmin1 = min(list)\nlist.remove(min1)\nmin2 = min(list)\nprint(min1 + min2)'] | ['Runtime Error', 'Accepted'] | ['s372380743', 's999156117'] | [2940.0, 2940.0] | [17.0, 18.0] | [121, 124] |
p03011 | u642418876 | 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(A+B,B+C,C+A))\n', 'P,Q,R=map(int,input().split())\nprint(min(P+Q,Q+R,R+P))\n'] | ['Runtime Error', 'Accepted'] | ['s647124565', 's380144014'] | [2940.0, 2940.0] | [17.0, 17.0] | [55, 55] |
p03011 | u648212584 | 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 = input().split()\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))'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s217549168', 's378195985', 's661975933'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 18.0] | [58, 48, 58] |
p03011 | u652569315 | 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\ninput = sys.stdin.readline\np,q,r = map(int,input().split())\nprint(min[p+q,q+r,r+p])\n', 'import sys\ninput = sys.stdin.readline\np,q,r = map(int,input().split())\nprint(min(p+q,q+r,r+p))\n'] | ['Runtime Error', 'Accepted'] | ['s164196332', 's002423167'] | [2940.0, 2940.0] | [17.0, 17.0] | [95, 95] |
p03011 | u652737716 | 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())\nprint(sum(a) - max(a))', 'a = list(map(int,input().split()))\nprint(sum(a) - max(a))\n'] | ['Runtime Error', 'Accepted'] | ['s197917278', 's040875734'] | [2940.0, 2940.0] | [17.0, 17.0] | [51, 58] |
p03011 | u657994700 | 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 \ndef fibo(n):\n a, b = 0, 1\n if n == 1:\n return 1\n else:\n for i in range(n):\n a0 = a\n a = b\n b = a0 + b\n return b\n \nN, M = map(int, input().split())\na = []\n \nif M == 0:\n print(fibo(N) % 1000000007)\n sys.exit()\n \... | ['Runtime Error', 'Accepted'] | ['s659253905', 's417004342'] | [3064.0, 2940.0] | [17.0, 17.0] | [671, 60] |
p03011 | u661977789 | 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()))\nprint(SUM(A) - MAX(A))', 'A = list(map(int,input().split()))\nprint(sum(A)-max(A))'] | ['Runtime Error', 'Accepted'] | ['s073128319', 's412772104'] | [2940.0, 2940.0] | [17.0, 17.0] | [57, 55] |
p03011 | u663014688 | 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\nl = W[0]\nr = sum(W[1:])\ndiff = abs(l - r)\nfor i in range(1, N):\n l += W[i]\n r -= W[i]\n new_diff = abs(l-r)\n if new_diff < diff:\n diff = new_diff\nprint(diff)', 'p,q,r = map(int, input().split())\nl = [p,q,r]\nl = sorted(l, reverse=Tru... | ['Runtime Error', 'Accepted'] | ['s412227330', 's820132999'] | [3064.0, 2940.0] | [17.0, 17.0] | [229, 92] |
p03011 | u666964944 | 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 copy\n\nparams = [1, 3, 4]\ncount = len(params)-1\n\nminTime = 100\n\nfor i in range(count):\n pattern = copy.copy(params)\n total = 0\n pattern.pop(i)\n\n print(params)\n for j in range(len(pattern)-1):\n total = params[i]+pattern[j]\n if total <= minTime:\n minTime = total\n\nprint(mi... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s168860080', 's316647195', 's878552860', 's030890978'] | [3444.0, 3444.0, 2940.0, 3700.0] | [22.0, 22.0, 17.0, 29.0] | [306, 306, 286, 307] |
p03011 | u667084803 | 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())).sort()\nprint(sum[:2])', 'A = list(map(int, input().split()))\nA.sort()\nprint(sum(A[:2]))'] | ['Runtime Error', 'Accepted'] | ['s150624722', 's142965309'] | [2940.0, 2940.0] | [17.0, 17.0] | [57, 62] |
p03011 | u667694979 | 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())\nmin=P+Q\nif min>Q+R:\n min=Q+R\nif min>R+P:\n min=R+P:\nprint(min)', 'P,Q,R=map(int,input().split())\nmin=P+Q\nif min>Q+R:\n min=Q+R\nif min>R+P:\n min=R+P\nprint(min)'] | ['Runtime Error', 'Accepted'] | ['s566675324', 's070723222'] | [2940.0, 2940.0] | [17.0, 18.0] | [94, 93] |
p03011 | u668199686 | 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(min(P + Q, PL R), Q + R)', 'P, Q, R = map(int, input().split())\nprint(min(min(P + Q , P + R), Q + R))'] | ['Runtime Error', 'Accepted'] | ['s519753168', 's393322641'] | [2940.0, 2940.0] | [17.0, 17.0] | [70, 73] |
p03011 | u670180528 | 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])', 'a,b,c = map(int,input().split())\nprint(min(a+b,b+c,c+a))'] | ['Runtime Error', 'Accepted'] | ['s300217848', 's794455963'] | [2940.0, 2940.0] | [17.0, 17.0] | [56, 56] |
p03011 | u670567845 | 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]))\n'] | ['Runtime Error', 'Accepted'] | ['s369569017', 's231484793'] | [2940.0, 2940.0] | [17.0, 17.0] | [59, 62] |
p03011 | u670961163 | 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( a+b+c- max(a, b, c))\n'] | ['Runtime Error', 'Accepted'] | ['s240085160', 's186295055'] | [9104.0, 8964.0] | [21.0, 27.0] | [70, 63] |
p03011 | u674990183 | 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()\nl = s.split(' ')\nm = list (map(int, l))\np, q, r = m\n\ndef shortest_round(p, q, r):\n list_of_times = [p + q, p + r, q + r]\n return min(list_of_times)\n\nprint(shortest_round(s))", "s = input()\nl = s.split(' ')\nm = list(map(int, l))\np, q, r = m\nlist_of_times = [p + q, p + r, q + r]\nf = min(list... | ['Runtime Error', 'Accepted'] | ['s156727725', 's889272542'] | [2940.0, 2940.0] | [17.0, 17.0] | [187, 132] |
p03011 | u677523557 | 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 copy\n\nH, W = map(int, input().split())\nstate = []\nfor i in range(H):\n row_list = list(input())\n state.append(row_list)\n\n\ndef light(row, col, state):\n lighted_count = 0\n col1 = copy.copy(col)\n next = '.'\n while next == '.':\n lighted_count += 1\n col1 += 1\n i... | ['Runtime Error', 'Accepted'] | ['s214692026', 's133615103'] | [3444.0, 2940.0] | [23.0, 17.0] | [1410, 94] |
p03011 | u681110193 | 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\nn,m=map(int,input().split())\nA=[1 for i in range(n)]\nif n!=1:\n A[1]=2\n for i in range(m):\n A[int(input())-1]=0\n \n if A[0]==0 and A[1]!=0:\n A[1]=1\n\n\n for i in range(2,n):\n if A[i]!=0:\n A[i]=(A[i-1]+A[i-2])\n A[i]%=MOD\n\n \n print(A[n-1])\n \nelse:print(1)\n', 'p,... | ['Runtime Error', 'Accepted'] | ['s952709038', 's077235250'] | [3064.0, 2940.0] | [18.0, 17.0] | [291, 65] |
p03011 | u685244071 | 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())\nx = p + q\ny = q + r\nz = r + p\n\nif x>=y and x>=z:\n print(x)\nelif y>=x and y>=z:\n print(y)\nelse:\n print(z)', 'p, q, r = map(int, input().split())\nx = p + q\ny = q + r\nz = r + p\n\nif x<=y and x<=z:\n print(x)\nelif y<=x and y<=z:\n print(y)\nelse:\n print(z)\n'] | ['Wrong Answer', 'Accepted'] | ['s271403808', 's194386719'] | [3060.0, 2940.0] | [17.0, 17.0] | [143, 144] |
p03011 | u689193446 | 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())\nlst = []\nlst.extend(p, q, r)\nlst.sort()\n\nprint(lst[0] +lst[1])', 'lst = [map(int, input().split())]\nlst.sort()\n \nprint(lst[0] +lst[1])', 'lst = list(map(int, input().split()))\nlst.sort()\n \nprint(lst[0] +lst[1])'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s246123816', 's724553306', 's888974266'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [98, 68, 72] |
p03011 | u693007703 | 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\n\nroutes = list(map(int,input().split()))\n\ncombos = itertools.combinations(routes,2)\n\ntime = []\nfor c in combos:\n time.append(c[0] + c[1])\n \nmin(time)', 'import itertools\n\nroutes = list(map(int,input().split()))\n\ncombos = itertools.combinations(routes,2)\n\ntime = []\nfor c in comb... | ['Wrong Answer', 'Accepted'] | ['s951018592', 's603575988'] | [3060.0, 3060.0] | [17.0, 17.0] | [172, 179] |
p03011 | u698460655 | 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 = [[] for i in range(H)]\nfor i in range(H): s[i] = list(input())\nl = [[0]*W for i in range(H)]\nr = [[0]*W for i in range(H)]\nd = [[0]*W for i in range(H)]\nu = [[0]*W for i in range(H)]\n\nfor h in range(H):\n for w in range(W):\n if s[h][w] == ".":\n l[h][w]... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s002255686', 's942817852', 's518768955'] | [3064.0, 3064.0, 3064.0] | [18.0, 18.0, 17.0] | [863, 564, 57] |
p03011 | u700929101 | 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... | ['o_list = o.split(" ")\no_list_i = [int(s) for s in o_list]\no_list_i.sort()\n\no0 = int(o_list_i[0])\no1 = int(o_list_i[1])\nprint( o0 + o1 )', 'o = input()\no_list = o.split(" ")\no_list_i = [int(s) for s in o_list]\no_list_i.sort()\n\no0 = int(o_list_i[0])\no1 = int(o_list_i[1])\nprint( o0 + o1 )'] | ['Runtime Error', 'Accepted'] | ['s345232472', 's528317193'] | [2940.0, 3060.0] | [17.0, 17.0] | [135, 147] |
p03011 | u702144572 | 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 sym\n\ndef fib(n):\n x = sym.symbols('x',nonnegative=True,integer=True) \n Fib=1/sym.sqrt(5)*(((1+sym.sqrt(5))/2)**(n-1)-((1-sym.sqrt(5))/2)**(n-1)) \n result=Fib.subs(x,n) \n result=result.evalf() \n return int(result)\n\nn,m = map(int,input().split())\na = [int(input()) for i in rang... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s376533442', 's417652824', 's446554690'] | [12512.0, 3064.0, 3064.0] | [149.0, 17.0, 17.0] | [682, 745, 60] |
p03011 | u705427370 | 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 >= p+r or p+q >= q+r:\n print(p+q)\n\nelif q+r >= p+q and q+r >= p+r:\n print(q+r)\n\nelif p+r >= p+q and p+r >= q+r:\n print(p+r)', 'p,q,r = map(int,input().split())\n\nif p+q >= p+r or p+q >= q+r:\n print(p+q)\n\nelif q+r >= p+q and q+r >= p+r:\n print(q+r)\... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s452824098', 's976430920', 's424945828'] | [3060.0, 3060.0, 3060.0] | [18.0, 18.0, 17.0] | [173, 173, 174] |
p03011 | u706330549 | 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... | ['div = 1000000007\n\nn, m = map(int, input().split())\na = [int(input()) for i in range(m)]\n\nf = [0] * (n + 1)\nf[0] = 1\n\nif 1 not in a:\n f[1] = 1\n\nfor i in range(2, n + 1):\n if i in a:\n continue\n f[i] = (f[i - 1] + f[i - 2]) % div\n\nprint(f[-1])', 'a_n = list(map(int, input().split()))\n\na... | ['Runtime Error', 'Accepted'] | ['s503076157', 's767752018'] | [3064.0, 2940.0] | [17.0, 18.0] | [256, 81] |
p03011 | u706414019 | 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)]\nM=10**9+7\nlis = [1] + [0]*n\n\nfor i in a:\n lis[i]=-1\nlis[1] += 1\nfor i in range(n-1):\n if lis[i+2]<0:\n lis[i+2]= 0\n else:\n lis[i+2] = (lis[i+1] + lis[i])%M\nprint(lis[n])', 'import sys\ninput = sys.stdin.readline\n\nP=list(map(in... | ['Runtime Error', 'Accepted'] | ['s680412368', 's635028149'] | [9104.0, 9136.0] | [26.0, 27.0] | [246, 94] |
p03011 | u712052023 | 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... | ['AB, BC, AC = [int(_) for _ in raw_input().split(" ")]\n\nM = [[0, AB, AC],\n [AB, 0, BC],\n [AC, BC, 0]]\n\ndef A(l):\n t = [0] * l\n def Sub(targetList, n):\n if 1:\n if len(targetList) == 1:\n t[n] = targetList[0]\n yield t\n t[n] = 0\n ... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s561955059', 's737057792', 's652028839'] | [3064.0, 3064.0, 3064.0] | [17.0, 18.0, 17.0] | [829, 851, 878] |
p03011 | u719886494 | 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(i) for i in input().split())\nif p >= q & p >= r :\n max = p\nif q >= p & q >= r :\n max = q\nif r >= p & r >= q :\n max = r\nprint(p + q + r - max)', 'l = list(map(int, input().split()))\nsum = 0\nmax = 0\nfor i in range(3) :\n sum += l[i]\n if max <= l[i] :\n max = l[i]\nprint(sum - max)'] | ['Runtime Error', 'Accepted'] | ['s963792025', 's594401482'] | [2940.0, 3060.0] | [17.0, 17.0] | [159, 136] |
p03011 | u721425712 | 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 = max(p, q, r)\nprint(a)\nif a == p:\n print(q+r)\nelif a == q:\n print(p+r)\nelif a == r:\n print(p+q)', 'p, q, r = map(int, input().split())\na = max(p, q, r)\nif a == p:\n print(q+r)\nelif a == q:\n print(p+r)\nelif a == r:\n print(p+q)'] | ['Wrong Answer', 'Accepted'] | ['s952848037', 's117666596'] | [3060.0, 3060.0] | [17.0, 17.0] | [137, 128] |
p03011 | u722189950 | 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 fib(n):\n a1 = 2\n a2 = 1 \n if n==2:\n return 2\n elif n==1:\n return 1\n else:\n count = 1\n for i in range(n-2):\n count = a1 + a2\n a2 = a1\n a1 = count\n return count\n \nN,M = list(map(int,input().split()))\nans = 1\nz... | ['Runtime Error', 'Accepted'] | ['s035982137', 's055263283'] | [3064.0, 2940.0] | [17.0, 17.0] | [715, 70] |
p03011 | u725085386 | 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\na = int(input())\nb = int(input())\nc = int(input())\n\n\n \nab = a+b\nbc = b+c\nac = a+c\n \nminimum = min(ab,bc,ac)\n \nprint(minimum)\n', 'import math\na = int(input())\nb = int(input())\nc = int(input())\n\n\n \nab = a+b\nbc = b+c\nac = a+c\n \nminimum = min(ab,bc,ac)\n \nprint(minimum)', "import mat... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s863188570', 's917877477', 's787369408'] | [2940.0, 3060.0, 3064.0] | [17.0, 17.0, 18.0] | [137, 136, 352] |
p03011 | u727787724 | 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... | ['y=input().split()\nfor i in range(len(y)):\n y[i]=int(y[i])\na=[]\na.append(y[0]+y[1])\na.append(y[2]+y[1])\na.append(y[0]+y[2])\na.sort()\nprint(a[1])', 'y=input().split()\nfor i in range(len(y)):\n y[i]=int(y[i])\na=[]\na.append(y[0]+y[1])\na.append(y[2]+y[1])\na.append(y[0]+y[2])\na.sort()\nprint(a[0])'] | ['Wrong Answer', 'Accepted'] | ['s545223595', 's740156628'] | [3064.0, 3060.0] | [18.0, 17.0] | [146, 146] |
p03011 | u739843002 | 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... | ['ary = list(map(lambda n: int(n), input().split(" "))).sort(reverse=True)\n\nprint(ary[0] + ary[1])', 'ary = list(map(lambda n: int(n), input().split(" ")))\nary.sort()\n\nprint(ary[0] + ary[1])'] | ['Runtime Error', 'Accepted'] | ['s087061981', 's296737641'] | [9012.0, 9096.0] | [25.0, 30.0] | [96, 88] |
p03011 | u739959951 | 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\nl=list(p,q,r)\nl=sorted(l)\n\nprint(l[0]+l[1])', 'p,q,r=map(int,input().split())\n\nprint(p+q+r-max(p,q,r))'] | ['Runtime Error', 'Accepted'] | ['s366811374', 's279117558'] | [2940.0, 2940.0] | [17.0, 17.0] | [75, 55] |
p03011 | u740047492 | 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=[int(input() for i in range(3))]\npqr.sort()\nprint(pqr[0]+pqr[1])', 'p,q,r=map(int,input().split())\npqr=[p,q,r]\npqr.sort()\nprint(pqr[0]+pqr[1])'] | ['Runtime Error', 'Accepted'] | ['s722310989', 's635196347'] | [2940.0, 2940.0] | [18.0, 17.0] | [68, 74] |
p03011 | u740260565 | 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 \n#n = int(input())\nn, m = [int(i) for i in input().split()]\n#table = [[int(i) for i in input().split()] for n in range(n)]\n\n#s = input()\n#list = list(s)\n \ns = [int(input()) for i in range(m)] \n \nMOD = 1000000007\n \n \ndef fib(n):\n a = 0\n b = 1\n temp = 0\n if (n == 0) :\n ... | ['Runtime Error', 'Accepted'] | ['s801220674', 's564297476'] | [3064.0, 3060.0] | [17.0, 18.0] | [863, 291] |
p03011 | u740767776 | 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 = input().split()\nprint(sum(p,q,r) - max(p,q,r))', 'p,q,r = input().split()\np = int(p)\nq = int(q)\nr = int(r)\nprint((p + q + r) - max(p,q,r))\n'] | ['Runtime Error', 'Accepted'] | ['s911691659', 's874556172'] | [2940.0, 2940.0] | [17.0, 17.0] | [54, 89] |
p03011 | u743164083 | 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()))\nn = len(l)\nd = 0\nl.sort()\nfor i in range(0,n-1):\n d += l.pop(0)\n print(l)\n\nprint(d)\n', 'p = list(map(int, input().split()))\nprint(sum(p) - max(p))\n'] | ['Wrong Answer', 'Accepted'] | ['s812684194', 's915155766'] | [2940.0, 9056.0] | [17.0, 25.0] | [126, 59] |
p03011 | u745010317 | 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[1]+l[2])', 'l=list(map(int,input().split()))\nl.sort()\nprint(l[0]+l[1])'] | ['Wrong Answer', 'Accepted'] | ['s977575220', 's462875453'] | [2940.0, 3060.0] | [17.0, 20.0] | [58, 58] |
p03011 | u747873993 | 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\nL,A,B,M=(int(i) for i in input().split())\narray=np.arange(A,A+B*L-1,B)\nresult=""\nfor i in range(L):\n result+=str(array[i])\nprint(int(result)%M)', 'A=[int(i) for i in input().split()]\nprint(sum(A)-max(A))'] | ['Runtime Error', 'Accepted'] | ['s991339317', 's471154343'] | [12500.0, 2940.0] | [150.0, 18.0] | [165, 56] |
p03011 | u749770850 | 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()\nb = input()\nc = input()\n \nprint( (a + b + c) - max(a, b, c)) ', 'a = int(input())\nb = int(input())\nc = int(input())\n \nprint((a+b+c)-max(a,b,c))', 'a = int(input())\nb = int(input())\nc = int(input())\n\nprint( (a + b + c) - max(a, b, c)) ', 'a = [i for i in input().split()]\nprint(int(sorted(a)[0]... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s036282913', 's412102293', 's510393847', 's305757049'] | [2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0] | [73, 78, 87, 77] |
p03011 | u754511616 | 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()))\nb=a.sorted()\nprint(b[0]+b[1])', 'a=list(map(int,input().split()))\nb=a.sorted()\nprint(int(b[0])+int(b[1]))', 'a=list(map(int,input().split()))\nb=sorted(a)\nprint(int(b[0])+int(b[1]))'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s187692241', 's469277738', 's521121565'] | [9068.0, 9164.0, 9140.0] | [22.0, 22.0, 26.0] | [62, 72, 71] |
p03011 | u756518877 | 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 -*-\np,q,r=map(int,input().split())\nptint(min(p+q,q+r,r+p))', '# -*- coding: utf-8 -*-\np,q,r=map(int,input().split())\nptint(min(p+q,q+r,r+p)', '# -*- coding: utf-8 -*-\np,q,r=map(int,input().split())\nprint(min(p+q,q+r,r+p))'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s534837945', 's729253742', 's865842406'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [78, 77, 78] |
p03011 | u756696693 | 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,p+r,q+r))', 'p,q,r = map(int(input().split()))\nprint(min((p+q),(p+r),(q+r)))', 'p,q,r = map(int(input().split()))\nprint(min(p+q,p+r,q+r)', 'p,q,r = map(int,input().split())\nprint(min(p+q, q+r, r+p))'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s687495420', 's810581224', 's930964179', 's609980389'] | [3064.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0] | [57, 63, 56, 58] |
p03011 | u760961723 | 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-min(P,Q,R))', 'P,Q,R = map(int,input().split())\n \nprint(P+Q+R-max(P,Q,R))'] | ['Wrong Answer', 'Accepted'] | ['s190200282', 's993804499'] | [2940.0, 3064.0] | [17.0, 18.0] | [57, 58] |
p03011 | u761529120 | 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\nans = float('inf')\n\nfor i in range(3):\n for j in range(3):\n if i != j:\n if ans > a[i] + a[j]:\n print(a[i],a[j])\n ans = a[i] + a[j]\n\nprint(ans)", "a = list(map(int, input().split()))\n\nans = float('inf')\n\nfor i in ran... | ['Wrong Answer', 'Accepted'] | ['s446092724', 's521421880'] | [3060.0, 2940.0] | [17.0, 17.0] | [230, 197] |
p03011 | u763410402 | 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 main():\n a,b,c=map(int,input().split(' '))\n print(sum([a,b,c])-,max(a,b,c))\n\nmain()\n", "def main():\n a,b,c=map(int,input().split(' '))\n print(sum([a,b,c])-max(a,b,c))\n\nmain()\n"] | ['Runtime Error', 'Accepted'] | ['s490253085', 's580339205'] | [8884.0, 9088.0] | [21.0, 28.0] | [94, 93] |
p03011 | u765325669 | 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... | ['aaaa = input()\nA = [int(x) for x in input().split()]\n\n\nfor i in range(len(A)-1):\n s1 = sum(A[:i+1])\n s2 = sum(A[i+1:])\n if s1 >= s2:\n print(abs(s1-s2))\n break', 'aaaa = input()\nA = [int(x) for x in input().split()]\n\n\nfor i in range(len(A)):\n s1 = sum(A[:i+1])\n s2 = sum(A[i+1:])\n if s1 >= s... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s885722883', 's985900988', 's829092490'] | [3060.0, 2940.0, 2940.0] | [18.0, 17.0, 17.0] | [167, 160, 65] |
p03011 | u773246942 | 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 \nPQ = P + Q\nQR = Q + R\nRP = R + Q\n\ntemp1 = min(PQ, QR)\ntemp2 = min(temp2, RP)\n\nprint(temp2)', 'P, Q, R = map(int,input().split())\n \nPQ = P + Q\nQR = Q + R\nRP = R + P\n\ntemp1 = min(PQ, QR)\ntemp2 = min(temp1, RP)\n\nprint(temp2)\n'] | ['Runtime Error', 'Accepted'] | ['s458010609', 's740559972'] | [3060.0, 2940.0] | [17.0, 17.0] | [127, 128] |
p03011 | u777394984 | 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(sum(a[0:1])', 'a = list(map(int,input().split()))\na.sort()\nprint(sum(a[0:2]))\n'] | ['Runtime Error', 'Accepted'] | ['s758060397', 's897748955'] | [2940.0, 3064.0] | [17.0, 17.0] | [61, 63] |
p03011 | u779602548 | 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... | ['\nimport __input\n\n\np,q,r = map(int,input().split())\nans = 999\nans = min(p+q,ans)\nans = min(p+r,ans)\nans = min(q+r,ans)\n\nprint(ans)', '\np,q,r = map(int,input().split())\nans = 999\nans = min(p+q,ans)\nans = min(p+r,ans)\nans = min(q+r,ans)\n\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s390075633', 's632186179'] | [2940.0, 2940.0] | [17.0, 17.0] | [230, 112] |
p03011 | u780420070 | 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())\nM=input().split()\nfor i in range(N):\n M[i]=int(M[i])\nS1=0\nS2=sum(M)\nt=100000\nfor i in range(N):\n S1+=M[i]\n S2=S2-M[i]\n if t>abs(S2-S1):\n t=abs(S2-S1)\nprint(t)', 'P,Q,R=map(int,input().split())\na=min(P+Q,P+R,Q+R)\nprint(a)'] | ['Runtime Error', 'Accepted'] | ['s765035688', 's413649107'] | [3060.0, 2940.0] | [17.0, 17.0] | [192, 58] |
p03011 | u782685137 | 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());print(sum(A)-max(A))', '*A,=map(int,input().split());print(sum(A)-max(A))'] | ['Runtime Error', 'Accepted'] | ['s405697636', 's070136772'] | [2940.0, 2940.0] | [19.0, 17.0] | [48, 49] |
p03011 | u784849232 | 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())))\npq=p+q\nqr=q+r\nrp=r+p\nprint(min([pq,qr,rp])', 'p,q,r=list(map(int,(input().split())))\npq=p+q\nqr=q+r\nrp=r+p\nprint(min([pq,qr,rp]))\t\t\t\t\t\t\t'] | ['Runtime Error', 'Accepted'] | ['s500200970', 's042239618'] | [2940.0, 2940.0] | [17.0, 17.0] | [81, 89] |
p03011 | u790301364 | 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 main17():\n data = input().split()\n num = []\n for i in range(3):\n num.append(int(data[i]))\n num2 = []\n num2.append((num[0]+num[1]))\n num2.append((num[0]+num[2]))\n num2.append((num[2]+num[1]))\n print((max(num2)))\n\nif __name__ == "__main__":\n main17()', 'def main17():\n ... | ['Wrong Answer', 'Accepted'] | ['s765133342', 's250108635'] | [3064.0, 3064.0] | [17.0, 18.0] | [286, 286] |
p03011 | u790812284 | 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())\nmin = min(p, q, r)\nprint(p+q+r-min)', 'p, q, r = map(int, input().split())\nprint(p+q+r-min(p, q, r))', 'p, q, r = map(int, input().split())\nmax = max(p, q, r)\nprint(p+q+r-max)'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s143872771', 's206303166', 's843379613'] | [2940.0, 2940.0, 2940.0] | [18.0, 17.0, 17.0] | [71, 61, 71] |
p03011 | u795323188 | 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... | ['lists = [P+Q,Q+R,R+P]\nprint(min(lists))', 'lists = list(map(int,input().split(" ")))\nlists.sort()\nprint(lists[0] + lists[1])\n'] | ['Runtime Error', 'Accepted'] | ['s674519995', 's248253089'] | [2940.0, 2940.0] | [17.0, 17.0] | [39, 82] |
p03011 | u795684082 | 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... | ['num1, num2, num3 = [int(i) for i in input().split()]\na=list[num1+num2,num2+num3,num1+num3]\nprint(max(a))', 'num1, num2, num3 = [int(i) for i in input().split()]\na=[num1+num2,num2+num3,num1+num3]\nprint(min(a))\n\n'] | ['Runtime Error', 'Accepted'] | ['s551802553', 's523690244'] | [2940.0, 2940.0] | [17.0, 17.0] | [104, 102] |
p03011 | u799428010 | 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,p+r,q,r))', 'p,q,r=map(int, input().split())\nprint(min(p+q,p+r,q+r))'] | ['Wrong Answer', 'Accepted'] | ['s783451456', 's337774633'] | [9036.0, 9140.0] | [27.0, 29.0] | [55, 55] |
p03011 | u805502314 | 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... | ["\nimport sys\n\n\nP = int(sys.argv[1]) \nQ = int(sys.argv[2]) \nR = int(sys.argv[3]) \n \na1 = P + Q.\na2 = P + R\na3 = Q + R\n\nvalue = 300\n\nif __name__ == '__main__':\n if a1 < value:\n value = a1\n if value > a2:\n value = a2\n if value > a3:\n value = a3\n print(value) \n", '\ni... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s027999619', 's105138833', 's278836973', 's794570350', 's153880971'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0] | [289, 230, 344, 289, 181] |
p03011 | u812803774 | 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\nn, m = [int(i) for i in input().split()]\np = [int(input()) for i in range(m)]\n\na = []\na.append(1)\nif 1 in p:\n a.append(0)\nelse:\n a.append(1)\nfor i in range(2, n + 1):\n if i in p:\n a.append(0)\n else:\n a.append((a[i - 2] + a[i - 1]) % 1000000007)\n \nprint(a[n])', ... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s695472701', 's945521759', 's518207600'] | [3064.0, 3064.0, 2940.0] | [17.0, 18.0, 17.0] | [299, 345, 70] |
p03011 | u816631826 | 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())]\ndel(valores[valores.index(max(valores))])\nprint(valores[0]+valores[1])\n', '\na = list(map(int, input().split()))\n\na.sort()\n\nprint(a[0] + a[1])'] | ['Runtime Error', 'Accepted'] | ['s709985972', 's733941063'] | [2940.0, 2940.0] | [17.0, 17.0] | [124, 66] |
p03011 | u816878803 | 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()\np=int(P)\nq=int(Q)\nr=int(R)\na=p+q\nb=q+r\nc=r+p\n\nif a<=b:\n if a<=c:\n print(a)\n else:\n print(c)\nelif b<=a:\n if b<=c:\n print(b)\n else:\n print(c)\n', 'P=int(input())\nQ=int(input())\nR=int(input())\na=P+Q\nb=Q+R\nc=R+P\n\nif a<=b:\n ... | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s103596232', 's321532051', 's327102612', 's381070274', 's975913043', 's386568297'] | [3060.0, 3064.0, 2940.0, 3060.0, 3060.0, 2940.0] | [17.0, 18.0, 17.0, 17.0, 17.0, 17.0] | [210, 196, 168, 209, 203, 190] |
p03011 | u816919571 | 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()))\na = l.pop(min(l))\nb = l.pop(min(l))\nprint(a+b)', 'l = list(map(int,input().split()))\na = l.pop(l.index(min(l)))\nb = l.pop(l.index(min(l)))\nprint(a+b)'] | ['Runtime Error', 'Accepted'] | ['s523550232', 's396464222'] | [2940.0, 2940.0] | [17.0, 17.0] | [81, 99] |
p03011 | u830940424 | 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\nimport numpy as np\nimport itertools\n\np,q,r = input().split()\np = int(p)\nq = int(q)\nr = int(r)\ndest_min = p + q + r\ndest = np.array(list(itertools.combinations([p,q,r],2)))\nprint(dest)\n\nfor dest_sample in dest:\n dest_min = min(dest_min, np.sum(dest_sample))\n\nprint(dest_min)', 'import sys\n... | ['Wrong Answer', 'Accepted'] | ['s584385933', 's861894683'] | [27280.0, 27184.0] | [128.0, 127.0] | [287, 276] |
p03011 | u835732324 | 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(input().split())\nprint(min(P+Q,P+R,Q+R))', 'P,Q,R = map(int,input().split())\nprint(min(P+Q,P+R,Q+R))'] | ['Runtime Error', 'Accepted'] | ['s318357702', 's223809687'] | [2940.0, 2940.0] | [17.0, 18.0] | [52, 56] |
p03011 | u842388336 | 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... | ['times = list(map(int, input().split()))\nprint(sum(times) - min(times))', 'times = list(map(int, input().split()))\nprint(sum(times) - max(times))\n'] | ['Wrong Answer', 'Accepted'] | ['s603964913', 's916878330'] | [2940.0, 3064.0] | [17.0, 17.0] | [70, 71] |
p03011 | u842476069 | 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(input('P:')), int(input('Q:')), int(input('R:'))\nprint(P, Q, R)\nprint(min(P+Q, Q+R, R+P))", "P, Q, R =map(int ,input().split(','))\nprint(min(P+Q, Q+R, R+P))", "P, Q, R = int(input('P:')), int(input('Q:')), int(input('R:'))\nprint(P, Q, R)\nprint(min(P+Q, Q+R, R+P))", 'P, Q, R = int(input()), int(inpu... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s077696559', 's368098814', 's499885512', 's890053438', 's479507179'] | [3060.0, 2940.0, 3060.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0] | [103, 63, 103, 76, 60] |
p03011 | u844123804 | 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 = input().split()\nnum = sorted([int(i) for i in num])\n\nprint(num[-1]+num[-2])', 'num = input().split()\n\nnum = [int(i) for i in num]\nnum_fix = sorted(num)\nprint(num_fix[0]+num_fix[1])'] | ['Wrong Answer', 'Accepted'] | ['s202820881', 's857854262'] | [2940.0, 2940.0] | [18.0, 17.0] | [81, 101] |
p03011 | u846522771 | 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\nl = int(stdin.readline().rstrip().split())\nl.sort()\nsaitan = l[0] + l[1]\nprint(saitan)', 'from sys import stdin\nl = stdin.readline().rstrip().split()\nl.sort()\nsaitan = int(l[0]) + int(l[1])\nprint(saitan)'] | ['Runtime Error', 'Accepted'] | ['s158936285', 's039149105'] | [2940.0, 2940.0] | [17.0, 17.0] | [108, 113] |
p03011 | u848336553 | 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()))\npqr.sort()\nprint(pqr[0] + pqr[1])', 'p, q, r = list(map(int, input().split()))\npqr.sort()\nprint(pqr[0] + pqr[1])', 'pqr = list(map(int, input().split()))\npqr.sort()\nprint(pqr[0] + pqr[1])'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s523547957', 's529414981', 's210712607'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 18.0] | [75, 75, 71] |
p03011 | u857408368 | 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(input().split())\n# P = input().split()\n\n# print(P)\n# print(Q)\n# print(R)\n\nmin = min(P+Q, P+R, Q+R)\n\nprint(min)\n', 'P,Q,R = input().split()\n# P = input().split()\n\n# print(P)\n# print(Q)\n# print(R)\n\nmin = min(P+Q, P+R, Q+R)\n\nprint(min)\n', 'P,Q,R = input().split()\n# P = input().split()\n\... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s134179504', 's677404488', 's633624798'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [123, 118, 148] |
p03011 | u859773831 | 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())\narr=[int(x) for x in input().split(' ')]\ntotal=sum(arr)\ntemp=0\nans=1000\nfor item in arr:\n temp+=item\n a=total-temp\n ans=min(ans,abs(a-temp))\nprint(ans)", "p,q,r=[int(x) for x in input().split(' ')]\nprint(min(p+q,q+r,p+r))"] | ['Runtime Error', 'Accepted'] | ['s931776705', 's521742097'] | [3060.0, 2940.0] | [17.0, 18.0] | [169, 66] |
p03011 | u860546679 | 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'] | ['s481518766', 's039621511'] | [2940.0, 2940.0] | [17.0, 17.0] | [54, 54] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.