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 |
|---|---|---|---|---|---|---|---|---|---|---|
p03029 | u875408597 | 2,000 | 1,048,576 | We have A apples and P pieces of apple. We can cut an apple into three pieces of apple, and make one apple pie by simmering two pieces of apple in a pan. Find the maximum number of apple pies we can make with what we have now. | ['a,b = map(int, input().split())\npart = int(a * 3) + b\nprint(part)\nprint(int(part / 2))\n', 'a,b = map(int, input().split())\npart = int(a * 3) + b\nprint(int(part / 2))'] | ['Wrong Answer', 'Accepted'] | ['s848992207', 's374447786'] | [2940.0, 2940.0] | [17.0, 17.0] | [87, 74] |
p03029 | u885630173 | 2,000 | 1,048,576 | We have A apples and P pieces of apple. We can cut an apple into three pieces of apple, and make one apple pie by simmering two pieces of apple in a pan. Find the maximum number of apple pies we can make with what we have now. | ['def main():\n A, P = (int(i) for i in input().split())\n output = (3*A+P)/2\n print(output)\n return output\n\nmain()', 'A,P = map(int, input().split())\nnum_pie=int((3*A+P)//2)\nprint(num_pie)'] | ['Wrong Answer', 'Accepted'] | ['s075442853', 's322259030'] | [2940.0, 2940.0] | [17.0, 18.0] | [123, 70] |
p03029 | u886902015 | 2,000 | 1,048,576 | We have A apples and P pieces of apple. We can cut an apple into three pieces of apple, and make one apple pie by simmering two pieces of apple in a pan. Find the maximum number of apple pies we can make with what we have now. | ['a,p=map(int,input().split())\nprint((a+p//3)//2)', 'a,p=map(int,input().split())\nprint((3*a+p)//2)\n'] | ['Wrong Answer', 'Accepted'] | ['s510150376', 's822884881'] | [9096.0, 9084.0] | [27.0, 27.0] | [47, 47] |
p03029 | u889763262 | 2,000 | 1,048,576 | We have A apples and P pieces of apple. We can cut an apple into three pieces of apple, and make one apple pie by simmering two pieces of apple in a pan. Find the maximum number of apple pies we can make with what we have now. | ['a, p = map(int, input("A P").split(" "))\n\nSUM = a * 3 + p\n\nprint(int(SUM / 2))\n', 'a, p = map(int, input().split(" "))\n\nSUM = a * 3 + p\n\nprint(int(SUM / 2))\n'] | ['Wrong Answer', 'Accepted'] | ['s417814715', 's338611072'] | [2940.0, 2940.0] | [17.0, 17.0] | [79, 74] |
p03029 | u893063840 | 2,000 | 1,048,576 | We have A apples and P pieces of apple. We can cut an apple into three pieces of apple, and make one apple pie by simmering two pieces of apple in a pan. Find the maximum number of apple pies we can make with what we have now. | ['n = int(input())\nr = []\nfor i in range(n):\n city, score = map(str, input().split())\n score = int(score)\n r.append((city, score, i+1))\n\nr.sort(key=lambda x: x[1], reverse=True)\nr.sort(key=lambda x: x[0])\n\nfor x in r:\n print(x[2])\n', 'a, p = map(int,input().split())\n\nprint((3*a + p) // 2)\n'] | ['Runtime Error', 'Accepted'] | ['s680794261', 's992902967'] | [3060.0, 2940.0] | [17.0, 17.0] | [241, 55] |
p03029 | u897328029 | 2,000 | 1,048,576 | We have A apples and P pieces of apple. We can cut an apple into three pieces of apple, and make one apple pie by simmering two pieces of apple in a pan. Find the maximum number of apple pies we can make with what we have now. | ['a, b = list(map(int, input().split()))\n\nprint(((a * 3) + b) / 2)\n', 'a, b = list(map(int, input().split()))\n\nprint(int(((a * 3) + b) / 2))\n'] | ['Wrong Answer', 'Accepted'] | ['s225123724', 's797519694'] | [2940.0, 2940.0] | [17.0, 17.0] | [65, 70] |
p03029 | u897895794 | 2,000 | 1,048,576 | We have A apples and P pieces of apple. We can cut an apple into three pieces of apple, and make one apple pie by simmering two pieces of apple in a pan. Find the maximum number of apple pies we can make with what we have now. | ["import sys\nimport math\n\n\ndef main():\n a = int(sys.argv[1])\n p = int(sys.argv[2])\n return math.floor((a * 3 + p) / 2)\n\n\nif __name__ == '__main__':\n print(main())\n", "# -*- coding: utf-8 -*-\nimport math\n\n\ndef main():\n inp = input().split()\n a = int(inp[0])\n p = int(inp[1])\n r... | ['Runtime Error', 'Accepted'] | ['s737842900', 's240135640'] | [2940.0, 2940.0] | [17.0, 17.0] | [173, 202] |
p03029 | u898659976 | 2,000 | 1,048,576 | We have A apples and P pieces of apple. We can cut an apple into three pieces of apple, and make one apple pie by simmering two pieces of apple in a pan. Find the maximum number of apple pies we can make with what we have now. | ["apple = int(input('りんごの個数') * 3)\npiece = int(input('りんごの破片の数'))\n\napple_pie = (apple + piece) // 2\nprint(apple_pie)", 'A, P = [int(i) for i in input().split()]\nprint((A * 3 + P) // 2)'] | ['Runtime Error', 'Accepted'] | ['s560423380', 's147011457'] | [3060.0, 2940.0] | [17.0, 17.0] | [142, 64] |
p03029 | u899782392 | 2,000 | 1,048,576 | We have A apples and P pieces of apple. We can cut an apple into three pieces of apple, and make one apple pie by simmering two pieces of apple in a pan. Find the maximum number of apple pies we can make with what we have now. | ["import sys\n\nfor l in sys.stdin:\n a, p = l.rstrip('\\n').split(' ')\npies = (int(a) * 3 + p) //2\nprint(pies)", "import sys\n\nfor l in sys.stdin:\n a, p = l.rstrip('\\n').split(' ')\npies = (3*a+p)//2\nprint(pies)", "import sys\n\nfor l in sys.stdin:\n a, p = l.rstrip('\\n').split(' ')\npies = (int(a) * 3 + int... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s623636028', 's710593932', 's949147577'] | [2940.0, 2940.0, 2940.0] | [17.0, 21.0, 17.0] | [106, 96, 111] |
p03029 | u902468164 | 2,000 | 1,048,576 | We have A apples and P pieces of apple. We can cut an apple into three pieces of apple, and make one apple pie by simmering two pieces of apple in a pan. Find the maximum number of apple pies we can make with what we have now. | ['a, p = mao(int, input().split())\nprint((a * 3 + p) // 2)', 'a, p = map(int, input().split())\nprint((a * 3 + p) // 2)'] | ['Runtime Error', 'Accepted'] | ['s496277504', 's209293113'] | [2940.0, 3064.0] | [17.0, 17.0] | [56, 56] |
p03029 | u903629757 | 2,000 | 1,048,576 | We have A apples and P pieces of apple. We can cut an apple into three pieces of apple, and make one apple pie by simmering two pieces of apple in a pan. Find the maximum number of apple pies we can make with what we have now. | ['a,p = map(int,input().split())\nprint(a*3 + p // 2)', 'a,p = map(int,input().split())\na == a*3*p\na + p == int,ap\nprint(ap)\n', 'a,p = map(int,input().split())\nap = (int,input())\na == 3*p\na + p == ap\nprint(ap)', 'a,p = map(int,input().split())\nprint((a*3+p)//2)'] | ['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s329951213', 's528387216', 's985554723', 's542020213'] | [8976.0, 9156.0, 9140.0, 9132.0] | [27.0, 21.0, 20.0, 28.0] | [50, 68, 80, 48] |
p03029 | u904943473 | 2,000 | 1,048,576 | We have A apples and P pieces of apple. We can cut an apple into three pieces of apple, and make one apple pie by simmering two pieces of apple in a pan. Find the maximum number of apple pies we can make with what we have now. | ['A,P = map(int, input().split())\n\na = int(A/3)\n\nans = int((a + P)/2)\n\nprint(ans)', 'A,P = map(int, input().split())\n \na = int(A*3)\n \nans = int((a + P)/2)\n \nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s236129538', 's056063005'] | [2940.0, 2940.0] | [17.0, 17.0] | [79, 82] |
p03029 | u907433146 | 2,000 | 1,048,576 | We have A apples and P pieces of apple. We can cut an apple into three pieces of apple, and make one apple pie by simmering two pieces of apple in a pan. Find the maximum number of apple pies we can make with what we have now. | ['A,P = map(int, input().split())\nsum_apple = A*3+P\nprint(sum_apple/2)', 'A,P = map(int, input().split())\nsum_apple = A*3+P\nprint(int(sum_apple/2))\n'] | ['Wrong Answer', 'Accepted'] | ['s089477164', 's369803054'] | [2940.0, 2940.0] | [17.0, 17.0] | [68, 74] |
p03029 | u917510978 | 2,000 | 1,048,576 | We have A apples and P pieces of apple. We can cut an apple into three pieces of apple, and make one apple pie by simmering two pieces of apple in a pan. Find the maximum number of apple pies we can make with what we have now. | ['import sys\na = sys.argv[1]\np = sys.argv[2]\na1 = a*3\nprint ((a1+p)/2)', 'from sys import stdin\narg = stdin.readline().rstrip().split()\na = int(arg[0])\np = int(arg[1])\na1 = a*3\nprint (int((a1+p)/2))'] | ['Runtime Error', 'Accepted'] | ['s679734858', 's729980489'] | [2940.0, 2940.0] | [17.0, 17.0] | [68, 124] |
p03029 | u920032768 | 2,000 | 1,048,576 | We have A apples and P pieces of apple. We can cut an apple into three pieces of apple, and make one apple pie by simmering two pieces of apple in a pan. Find the maximum number of apple pies we can make with what we have now. | ['print(a)', 'A, P = map(int, input().split())\nprint((P+A*3)//2)'] | ['Runtime Error', 'Accepted'] | ['s004522398', 's695857897'] | [2940.0, 2940.0] | [17.0, 17.0] | [8, 50] |
p03029 | u921773161 | 2,000 | 1,048,576 | We have A apples and P pieces of apple. We can cut an apple into three pieces of apple, and make one apple pie by simmering two pieces of apple in a pan. Find the maximum number of apple pies we can make with what we have now. | ['input_AP = list(map(int, input().split()))\nA = input_AP[0]\nP = input_AP[1]\n\nresult = (A+P)*3//2\nprint(result)', 'N = int(input())\nA = [0 for i in range(N)]\nfor i in range(N):\n A[i] = list(map(str,input().split()))\nfor i in range(N):\n A[i].append(str(i))\n\n\nB = sorted(A, key=lambda x: x[1], reverse=T... | ['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s038655461', 's131116460', 's171545308', 's361237228', 's463783696', 's543506674', 's585646607', 's632554386', 's699536384', 's736517106', 's813124936', 's702003361'] | [2940.0, 3064.0, 3064.0, 3064.0, 3064.0, 3064.0, 3064.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 18.0, 17.0, 17.0, 17.0, 18.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [109, 277, 277, 250, 326, 276, 330, 105, 91, 277, 94, 111] |
p03029 | u923884575 | 2,000 | 1,048,576 | We have A apples and P pieces of apple. We can cut an apple into three pieces of apple, and make one apple pie by simmering two pieces of apple in a pan. Find the maximum number of apple pies we can make with what we have now. | ['A,P = input().split(" ")\nA=int(A)\nP=int(P)\n\nprint(A)\nprint(P)\n\nP += A*3\n\nprint(P)\npie = int(P/3)\n\nprint(pie)', 'A,P = input().split(" ")\nA=int(A)\nP=int(P)\n\nprint(A)\nprint(P)\n\nP += A*3\n\nprint(P)\npie = int(P/2)\n\nprint(pie)', 'A,P = input().split(" ")\nA=int(A)\nP=int(P)\n\nP += A*3\n\npie = int(... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s689524821', 's695391682', 's161555958'] | [2940.0, 3060.0, 2940.0] | [17.0, 17.0, 18.0] | [108, 108, 80] |
p03029 | u925712467 | 2,000 | 1,048,576 | We have A apples and P pieces of apple. We can cut an apple into three pieces of apple, and make one apple pie by simmering two pieces of apple in a pan. Find the maximum number of apple pies we can make with what we have now. | ['N = int(input())\nlist1 = [(input() + " " + str(i+1)).split() for i in range(N)]\n \nlist1 = [a for a in lis]\n \nlist1.sort(key=lambda a: int(a[1]), reverse=True)\nlist1.sort(key=lambda a: a[0])\n \n \nfor i in lis:\n print(i[2])', 'N = int(input())\nlis = [(input() + " " + str(i+1)).split() for i in range(N)]\n ... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s070953689', 's525815543', 's726018614', 's829216488', 's771277065'] | [9192.0, 9120.0, 9112.0, 9180.0, 9148.0] | [23.0, 23.0, 24.0, 24.0, 26.0] | [223, 216, 228, 226, 123] |
p03029 | u926393759 | 2,000 | 1,048,576 | We have A apples and P pieces of apple. We can cut an apple into three pieces of apple, and make one apple pie by simmering two pieces of apple in a pan. Find the maximum number of apple pies we can make with what we have now. | ['import numpy as np\nA, P = map(int, input().split())\nprint((A/3+P)/2)', 'import numpy as np\nA, P = map(int, input().split())\nprint((A*3+P)//2)'] | ['Wrong Answer', 'Accepted'] | ['s241025328', 's212601116'] | [13000.0, 12388.0] | [161.0, 150.0] | [68, 69] |
p03029 | u927534107 | 2,000 | 1,048,576 | We have A apples and P pieces of apple. We can cut an apple into three pieces of apple, and make one apple pie by simmering two pieces of apple in a pan. Find the maximum number of apple pies we can make with what we have now. | ['A,P = map(int,input().split())\nprint((A*3+P)/2)', 'A,P = map(int,input().split())\nprint((A*3+P)//2)'] | ['Wrong Answer', 'Accepted'] | ['s469138641', 's291281984'] | [2940.0, 2940.0] | [17.0, 17.0] | [47, 48] |
p03029 | u928784113 | 2,000 | 1,048,576 | We have A apples and P pieces of apple. We can cut an apple into three pieces of apple, and make one apple pie by simmering two pieces of apple in a pan. Find the maximum number of apple pies we can make with what we have now. | ['A,P = map(int,input().split())\nprint((A**3+P)//2)', 'A,P = map(int,input().split())\nprint((A*3+P)//2)'] | ['Wrong Answer', 'Accepted'] | ['s196764953', 's464135637'] | [2940.0, 2940.0] | [17.0, 18.0] | [49, 48] |
p03029 | u935522051 | 2,000 | 1,048,576 | We have A apples and P pieces of apple. We can cut an apple into three pieces of apple, and make one apple pie by simmering two pieces of apple in a pan. Find the maximum number of apple pies we can make with what we have now. | ['x,y = map(int,input().split())\na = (3*x+2)//2\nprint(a)', 'x,y = map(int,input().split())\na = (3*x+y)//2\nprint(a)\n'] | ['Wrong Answer', 'Accepted'] | ['s758602758', 's083716952'] | [2940.0, 2940.0] | [17.0, 17.0] | [54, 55] |
p03029 | u937706062 | 2,000 | 1,048,576 | We have A apples and P pieces of apple. We can cut an apple into three pieces of apple, and make one apple pie by simmering two pieces of apple in a pan. Find the maximum number of apple pies we can make with what we have now. | ["N, M = map(int, input().split())\nn_switch = []\nswitch = []\nfor i in range(M):\n\ts = list(map(int, input().split()))\n\tn_switch.append(s[0])\n\tswitch.append(s[1:])\np = list(map(int, input().split()))\nans = 0\nfor i in range(2 ** N):\n\tx = 1\n\tb = bin(i)[2:].rjust(N, '0')\n\tfor j in range(M):\n\t\tn_light = ... | ['Runtime Error', 'Accepted'] | ['s102702387', 's241839303'] | [3064.0, 2940.0] | [17.0, 17.0] | [459, 56] |
p03029 | u940096920 | 2,000 | 1,048,576 | We have A apples and P pieces of apple. We can cut an apple into three pieces of apple, and make one apple pie by simmering two pieces of apple in a pan. Find the maximum number of apple pies we can make with what we have now. | ["import itertools\n\ndef is_lit(i, bit):\n l = [bit[j-1] for j in sockets[i]]\n return p[i] == l.count(True) % 2\n\ncount = 0\nN, M = map(int, input().split())\nbit_list = list(itertools.product([True, False], repeat = N))\n\nsockets = []\nfor i in range(M):\n args = input().split(' ')\n k = int(args[0])\n... | ['Runtime Error', 'Accepted'] | ['s700874501', 's979977455'] | [1648472.0, 2940.0] | [2210.0, 17.0] | [531, 68] |
p03029 | u941458732 | 2,000 | 1,048,576 | We have A apples and P pieces of apple. We can cut an apple into three pieces of apple, and make one apple pie by simmering two pieces of apple in a pan. Find the maximum number of apple pies we can make with what we have now. | ['li = list(int(input()))\nprint(int((li[0]*3+li[1])/2))', 'li = list(map(int, input().split()))\nprint(int((li[0]*3+li[1])/2))'] | ['Runtime Error', 'Accepted'] | ['s912486489', 's325582641'] | [2940.0, 2940.0] | [17.0, 17.0] | [53, 66] |
p03029 | u942033906 | 2,000 | 1,048,576 | We have A apples and P pieces of apple. We can cut an apple into three pieces of apple, and make one apple pie by simmering two pieces of apple in a pan. Find the maximum number of apple pies we can make with what we have now. | ['A,P = map(int,input().split())\np = A*3 + p\nprint(p//2)', 'A,P = map(int,input().split())\np = A*3 + P\nprint(p//2)\n'] | ['Runtime Error', 'Accepted'] | ['s156207018', 's287872140'] | [2940.0, 2940.0] | [18.0, 17.0] | [54, 55] |
p03029 | u947375463 | 2,000 | 1,048,576 | We have A apples and P pieces of apple. We can cut an apple into three pieces of apple, and make one apple pie by simmering two pieces of apple in a pan. Find the maximum number of apple pies we can make with what we have now. | ['A,P=map(int,input().split())\nprint((A*3 + P) / 2)\n', 'A,P=map(int,input().split())\nprint(int((A*3 + P) / 2))\n'] | ['Wrong Answer', 'Accepted'] | ['s739038221', 's389475475'] | [3316.0, 2940.0] | [20.0, 18.0] | [50, 55] |
p03029 | u951076996 | 2,000 | 1,048,576 | We have A apples and P pieces of apple. We can cut an apple into three pieces of apple, and make one apple pie by simmering two pieces of apple in a pan. Find the maximum number of apple pies we can make with what we have now. | ['def pie(A, P):\n P_cra = A*3\n\n P_all = P_cra + P\n\n pie = P_all//2\n\n print(pie)\n\nA, P = input(), input()\npie(A, P)\n ', 'def pie(A, P):\n P_cra = A*3\n \n P_all = P_cra + P\n \n pie = P_all//2\n \n print(pie)\n\nA = input()\nP = input()\npie(int(A), int(P))', 'def pie(A, P):\n P_... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s429231296', 's448611849', 's569048355'] | [2940.0, 2940.0, 2940.0] | [18.0, 18.0, 17.0] | [129, 137, 167] |
p03029 | u957513998 | 2,000 | 1,048,576 | We have A apples and P pieces of apple. We can cut an apple into three pieces of apple, and make one apple pie by simmering two pieces of apple in a pan. Find the maximum number of apple pies we can make with what we have now. | ['a, p = [int(x) for x in input().split()]\nprint((a // 3 + p) // 2)', 'a, p = [int(x) for x in input().split()]\nprint((a * 3 + p) // 2)\n'] | ['Wrong Answer', 'Accepted'] | ['s325910144', 's280102157'] | [9068.0, 9040.0] | [27.0, 27.0] | [65, 65] |
p03029 | u957957759 | 2,000 | 1,048,576 | We have A apples and P pieces of apple. We can cut an apple into three pieces of apple, and make one apple pie by simmering two pieces of apple in a pan. Find the maximum number of apple pies we can make with what we have now. | ['a,p=map(int,input().split())\nprint(int((a*3+b)/2))', 'a,p=map(int,input().split())\nprint(int((a*3+p)/2))'] | ['Runtime Error', 'Accepted'] | ['s463121289', 's148877283'] | [2940.0, 2940.0] | [17.0, 17.0] | [50, 50] |
p03029 | u963903527 | 2,000 | 1,048,576 | We have A apples and P pieces of apple. We can cut an apple into three pieces of apple, and make one apple pie by simmering two pieces of apple in a pan. Find the maximum number of apple pies we can make with what we have now. | ['a, p = map(int, input().split())\nprint(3 * a + p // 2)', 'a, p = map(int, input().split())\nprint((3 * a + p) // 2)'] | ['Wrong Answer', 'Accepted'] | ['s797172966', 's460077684'] | [2940.0, 2940.0] | [17.0, 17.0] | [54, 56] |
p03029 | u969236097 | 2,000 | 1,048,576 | We have A apples and P pieces of apple. We can cut an apple into three pieces of apple, and make one apple pie by simmering two pieces of apple in a pan. Find the maximum number of apple pies we can make with what we have now. | ["import sys\nfrom functools import reduce\ndef a():\n p = [[int(t) for t in r.split(' ')] for r in sys.stdin.read().split('\\n') if r != '']\n A, P = p[0]\n print(int((A*3+P)/2)\na()\n", "import sys\ndef a():\n p = [[int(t) for t in r.split(' ')] for r in sys.stdin.read().split('\\n') if r != '']\n A, P... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s107000007', 's467815549', 's835700154', 's524456934'] | [2940.0, 2940.0, 2940.0, 2940.0] | [18.0, 17.0, 17.0, 17.0] | [184, 155, 339, 156] |
p03029 | u970197315 | 2,000 | 1,048,576 | We have A apples and P pieces of apple. We can cut an apple into three pieces of apple, and make one apple pie by simmering two pieces of apple in a pan. Find the maximum number of apple pies we can make with what we have now. | ['\nsi = lambda: input()\nni = lambda: int(input())\nnm = lambda: map(int, input().split())\nnl = lambda: list(map(int, input().split()))\na,p=nm()\nprint((3*a//2))\n', 'a,p=map(int,input().split())\nans=(3*a)//2\nprint(ans)', 'a,p=map(int,input().split())\nans=(3*a+p)//2\nprint(ans)'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s067460555', 's246492588', 's064513862'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [157, 52, 54] |
p03029 | u978252828 | 2,000 | 1,048,576 | We have A apples and P pieces of apple. We can cut an apple into three pieces of apple, and make one apple pie by simmering two pieces of apple in a pan. Find the maximum number of apple pies we can make with what we have now. | ['A,P = int(input())\nN = 3*A+P\nprint(N//2)', 'A,P = map(int,input().split())\nN = 3*A+P\nprint(N//2)\n'] | ['Runtime Error', 'Accepted'] | ['s841660730', 's580324351'] | [2940.0, 2940.0] | [18.0, 17.0] | [40, 53] |
p03029 | u978313283 | 2,000 | 1,048,576 | We have A apples and P pieces of apple. We can cut an apple into three pieces of apple, and make one apple pie by simmering two pieces of apple in a pan. Find the maximum number of apple pies we can make with what we have now. | ['import numpy as np\nN=int(input())\na=[]\nfor i in range(N):\n s,p=input().split()\n p=int(p)\n a.append([s,p,i+1])\na.sort(key=lambda x:(x[0],x[1]))\ni=0\nwhile i<=N:\n last=a[i][0]\n i+=1\n if i<N and last==a[i][0]:\n s=i-1\n g=i\n while 1:\n if i>=N or last!=a[i][0... | ['Runtime Error', 'Accepted'] | ['s483024455', 's736436019'] | [12456.0, 2940.0] | [152.0, 17.0] | [503, 46] |
p03029 | u986190948 | 2,000 | 1,048,576 | We have A apples and P pieces of apple. We can cut an apple into three pieces of apple, and make one apple pie by simmering two pieces of apple in a pan. Find the maximum number of apple pies we can make with what we have now. | ['a, p=map(int, input().split())\nb=(a/3)+p\nif b%2==0:\n print(b/2¥n)\nelse:\n print((b-1)/2¥n)', 'a, p=map(int, input().split())\nb=(a/3)+p\nif b%2==0:\n print(b/2¥n)\nif else:\n print((b-1)/2¥n)', 'a, p=map(int, input().split())\nb=(a/3)+p\nif b%2==0:\n print(b/2)\nif else:\n print((b-1)/2)', 'a, p... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s290252921', 's471179860', 's519434256', 's999671372'] | [2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0] | [97, 100, 94, 49] |
p03029 | u987001487 | 2,000 | 1,048,576 | We have A apples and P pieces of apple. We can cut an apple into three pieces of apple, and make one apple pie by simmering two pieces of apple in a pan. Find the maximum number of apple pies we can make with what we have now. | ['import math\napple_one, apple_kakera = (int(i) for i in input().split()) \napple_kakera += apple_one * 3\nprint(math.floor(apple_one / 2) )', ' import math\n apple_one, apple_kakera = (int(i) for i in input().split()) \n apple_kakera += apple_one * 3\n print(math.floor(apple_kakera / 2) )', 'import math... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s723207685', 's975301674', 's146718206'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [137, 156, 140] |
p03029 | u989157442 | 2,000 | 1,048,576 | We have A apples and P pieces of apple. We can cut an apple into three pieces of apple, and make one apple pie by simmering two pieces of apple in a pan. Find the maximum number of apple pies we can make with what we have now. | ['print((3*int(input())+int(input()))//2)', 'a, p = map(int, input())\nprint((3 * a + p) // 2)\n', 'a, p = map(int, input().split())\nprint((3 * a + p) // 2)\n'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s404546695', 's938793340', 's889647268'] | [2940.0, 2940.0, 2940.0] | [17.0, 19.0, 17.0] | [39, 49, 57] |
p03029 | u989326345 | 2,000 | 1,048,576 | We have A apples and P pieces of apple. We can cut an apple into three pieces of apple, and make one apple pie by simmering two pieces of apple in a pan. Find the maximum number of apple pies we can make with what we have now. | ['A,P=map(int,input().split())\nans=(3*A+P)%2\nprint(ans)', 'A,P=map(int,input().split())\nans=(3*A+P)//2\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s881019943', 's188121310'] | [2940.0, 2940.0] | [17.0, 17.0] | [53, 54] |
p03029 | u991619971 | 2,000 | 1,048,576 | We have A apples and P pieces of apple. We can cut an apple into three pieces of apple, and make one apple pie by simmering two pieces of apple in a pan. Find the maximum number of apple pies we can make with what we have now. | ['A,P=input().split()\nprint((3*A+2)//2)', 's,t = map(int,input().split())\nf=(s*3+t)//2\nprint(f)\n'] | ['Runtime Error', 'Accepted'] | ['s878522872', 's785804102'] | [2940.0, 2940.0] | [17.0, 20.0] | [37, 53] |
p03029 | u994521204 | 2,000 | 1,048,576 | We have A apples and P pieces of apple. We can cut an apple into three pieces of apple, and make one apple pie by simmering two pieces of apple in a pan. Find the maximum number of apple pies we can make with what we have now. | ['a,p=map(int, input().split())\nprint((3a+p)//2)', 'a,p=map(int,input().split())\npritn((3a+p)//2)', 'a,p=list(map(int, input().split()))\nprint((3a+p)//2)', 'a,p=map(int,input().split())\nprint((3a+p)//2)', 'a,p=map(int, input().split())\nprint((3*a+p)//2)'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s129864557', 's243725050', 's440114621', 's630143640', 's867653715'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [18.0, 17.0, 17.0, 17.0, 17.0] | [46, 45, 52, 45, 47] |
p03029 | u997393081 | 2,000 | 1,048,576 | We have A apples and P pieces of apple. We can cut an apple into three pieces of apple, and make one apple pie by simmering two pieces of apple in a pan. Find the maximum number of apple pies we can make with what we have now. | ['a,p=map(int,input().split())\n_a=a*3\nprint(sum(_a+p)/2)', 'a,p=map(int,input().split());print(a*3+p//2)', 'a,p=map(int,input().split())\n_a=a*3\nprint(int(sum(_a+p)//2))', 'a,p=map(int,input().split());print((a*3+p)//2)'] | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s029496905', 's308219563', 's479473604', 's572711706'] | [2940.0, 3060.0, 2940.0, 2940.0] | [18.0, 18.0, 17.0, 17.0] | [54, 44, 60, 46] |
p03030 | u000349418 | 2,000 | 1,048,576 | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score. You want to in... | ["n = int(input())\nL = []\ni = 0\nwhile i < n:\n s,p = map(str,input().split(' '))\n L.append((s,p,i))\n i += 1\nprint(L)\nL.sort()\nans = ''\nfor l in L:\n ans += str(l[2]-1)+'\\n'\nprint(ans[:-1])", "n = int(input())\nL = []\ni = 0\nwhile i < n:\n s,p = map(str,input().split(' '))\n p = int(p)\n ... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s399864720', 's453959492', 's572822912', 's866640928', 's195037152'] | [3064.0, 3064.0, 3064.0, 3064.0, 3064.0] | [17.0, 18.0, 17.0, 18.0, 17.0] | [196, 202, 197, 202, 205] |
p03030 | u008655389 | 2,000 | 1,048,576 | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score. You want to in... | ['n = int(input())\nSP = []\nfor i in range(n):\n s,p = input().split()\n sp = (i,s,int(p))\n SP.append(sp)\n\nnewSP = sorted(SP,key = lambda tup:(tup[1],-tup[2]))\n\nprint(newSP)\n\nfor i in range(n):\n print(newSP[i][0] + 1)\n', 'n = int(input())\nSP = []\nfor i in range(n):\n s,p = input().split()\n ... | ['Wrong Answer', 'Accepted'] | ['s193438211', 's381133588'] | [3060.0, 3060.0] | [18.0, 17.0] | [225, 211] |
p03030 | u009219947 | 2,000 | 1,048,576 | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score. You want to in... | ['N = int(input())\nR = [input().split() + [i+1] for i in range(N)]\nprint(R)\nR.sort(key=lambda x: -int(x[1]))\nR.sort(key=lambda x: x[0])\n[print(n) for _, _, n in R]', 'N = int(input())\nR = [input().split() + [i+1] for i in range(N)]\n# print(R)\nR.sort(key=lambda x: -int(x[1]))\nR.sort(key=lambda x: x[0])\n[print(... | ['Wrong Answer', 'Accepted'] | ['s862074496', 's388992449'] | [3060.0, 3060.0] | [20.0, 17.0] | [161, 164] |
p03030 | u011367845 | 2,000 | 1,048,576 | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score. You want to in... | ['N = int(input())\nr = []\n\nfor i in range(1, N+1):\n name, point = (x for x in input().split())\n r.append([name, point, i])\nr.sort(key=lambda x: x[0])\nr.sort(key=lambda x: x[1])\n\nfor i in range(N):\n print(r[i][2])\n \n', 'N = int(input())\nr = []\n\nfor i in range(1, N+1):\n name, point = (x for... | ['Wrong Answer', 'Accepted'] | ['s060365774', 's913213381'] | [3060.0, 3060.0] | [17.0, 20.0] | [225, 246] |
p03030 | u021548497 | 2,000 | 1,048,576 | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score. You want to in... | ['N = int(input())\nj = []\nfor _ in zip(range(N)):\n p, q = map(str, input().split())\n j.append(int(q))\n\nfor i in range(N):\n p = max(j)\n q = j.index(p)\n print(q+1)\n j[q] = -1', 'N = int(input())\nj = []\nfor _ in zip(range(N)):\n p, q = map(str, input().split())\n j.append(int(q))\n\nfor... | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s340617605', 's616835617', 's797980493', 's945810184'] | [3060.0, 3060.0, 2940.0, 3064.0] | [20.0, 18.0, 17.0, 17.0] | [188, 187, 359, 390] |
p03030 | u023958502 | 2,000 | 1,048,576 | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score. You want to in... | ['n = int(input())\nlis = []\nfor i in range(n):\n s,p = map(str,input().split())\n lis.append([s,100 - int(p)])\nliss = lis.copy()\nlis.sort()\nprint(liss)\nfor i in range(n):\n print(liss.index(lis[i]) + 1)', 'n = int(input())\nlis = []\nfor i in range(n):\n s,p = map(str,input().split())\n lis.append(... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s675444810', 's935725410', 's644583863'] | [3060.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0] | [206, 206, 194] |
p03030 | u025616818 | 2,000 | 1,048,576 | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score. You want to in... | ['n=int(input())\nres=[]\nfor i in range(n):\n\ts,p=max(str,input().split())\n res.append([s,int(p)])\nres1=res\nres=sorted(res,key=lambda x:(x[0], -x[1]))\nfor i in range(n):\n\tprint(res1.index(res[i])+1)', 'n=int(input())\nres=[]\nfor i in range(n):\n s,p=max(str,input().split())\n res.append([s,int(p)])\nr... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s035464660', 's536407877', 's789926170', 's039722667'] | [8892.0, 9044.0, 8996.0, 8996.0] | [22.0, 25.0, 22.0, 26.0] | [197, 200, 195, 200] |
p03030 | u027675217 | 2,000 | 1,048,576 | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score. You want to in... | ['\nn=int(input())\nfor i in range(n):\n\trest=list(input().split())\na=rest\nrest.sort()\nfor i in range(n):\n\tprint(rest.index(a[i]))\n\t\t\n', '\nn=int(input())\nfor i in range(n):\n\trest=list(input().split())\na=rest\nrest.sort()\nfor i in range(n):\n\tprint(rest.index(a[i])\n\t\t', 'from collections import defau... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s787093982', 's905852460', 's227495053'] | [2940.0, 2940.0, 3316.0] | [17.0, 17.0, 21.0] | [129, 127, 251] |
p03030 | u030649913 | 2,000 | 1,048,576 | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score. You want to in... | ['import copy\nN = int(input())\nSP = [[] for _ in range(N)]\nfor i in range(N):\n SP[i] = list(input().split())\n SP[i][1] = int(SP[i][1])\n \nunique = list(set(s[0] for s in SP))\nunique.sort(reverse=True)\nfor i, uni in enumerate(unique):\n for j, S in enumerate(SP):\n if uni == S[0]:\n ... | ['Wrong Answer', 'Accepted'] | ['s641937471', 's704965420'] | [3444.0, 3444.0] | [24.0, 25.0] | [479, 469] |
p03030 | u040067762 | 2,000 | 1,048,576 | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score. You want to in... | ['n = int(input()) \nt = [input().split() for i in range(n)] \nt2 = t\n\nt.sort()\n\nresult = []\n\ndef bubble_sort(arr):\n change = True\n while change:\n change = False\n for i in range(len(arr) - 1):\n if arr[i][0] == arr[i+1][0] and int(arr[i][1]) < int(arr[i+1][1]):\n ... | ['Wrong Answer', 'Accepted'] | ['s441123480', 's805336318'] | [3064.0, 3064.0] | [23.0, 23.0] | [558, 557] |
p03030 | u040320709 | 2,000 | 1,048,576 | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score. You want to in... | ['n=int(input())\ni = 1\nalllist = []\nwhile i < n :\n a,b=map(str, input().split())\n c = [a ,int(b),i]\n alllist.append(c)\n i += 1\nalllist.sort(key=lambda x:-x[1],reverse=True)\n\nj = 0\nwhile j < n :\n print(alllist[j][2])\n j += 1', 'n=int(input())\ni = 1\nalllist = []\nwhile i < n :\n a,b=map(str, input()... | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s018538720', 's056659816', 's365034738', 's630700489'] | [3060.0, 3060.0, 3064.0, 3060.0] | [18.0, 17.0, 17.0, 17.0] | [248, 250, 268, 253] |
p03030 | u045408189 | 2,000 | 1,048,576 | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score. You want to in... | ['n=input()\na=[input().split() + [i+1] for i in range(n)]\nfor i in range(n):\n a[i][1]= -int(a[i][1])\na.sort()\nfor i in range(n):\n print(a[i][2])', 'n=int(input())\na=[input().split() + [i+1] for i in range(n)]\nfor i in range(n):\n a[i][1]= -int(a[i][1])\na.sort()\nfor i in range(n):\n print(a[i][2])\n'] | ['Runtime Error', 'Accepted'] | ['s077648881', 's191922758'] | [3060.0, 3060.0] | [17.0, 18.0] | [144, 150] |
p03030 | u046585946 | 2,000 | 1,048,576 | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score. You want to in... | ['n=int(input())\nsp=[[0 for i in range(3)]for i in range(n)]\nfor i in range(n):\n sp[i][0],sp[i][1]=input().split()\n sp[i][1]=int(sp[i][1])\n sp[i][2]=i+1\nprint(sp)\nsp=sorted(sp,key=lambda x:(x[0],-x[1]))\nprint(sp)\nfor i in range(n):\n print(sp[i][2])', 'n=int(input())\nsp=[[0 for i in range(3)]for i in ra... | ['Wrong Answer', 'Accepted'] | ['s352692814', 's467177075'] | [3064.0, 3064.0] | [18.0, 17.0] | [252, 232] |
p03030 | u047931063 | 2,000 | 1,048,576 | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score. You want to in... | ['# n, m, l = map(int, input().split())\n\n# list_n = list(map(int, input().split()))\n\n# n = input()\n\n\n# list = [[i for i in range(N)] for _ in range(M)]\n\nimport sys\ninput = sys.stdin.readline\n\nN = int(input())\nL = []\nfor i in range(N):\n c, p = input().split()\n p = int(p)\n L.append([i+1, c, p])\... | ['Runtime Error', 'Accepted'] | ['s496771760', 's451942696'] | [9112.0, 9140.0] | [29.0, 31.0] | [413, 417] |
p03030 | u050876787 | 2,000 | 1,048,576 | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score. You want to in... | ['n, m = list(map(int, input().split()))\na = list(map(int, input().split()))\n\na.sort()\n\nbc = []\n\nfor _ in range(m):\n bc.append(list(map(int, input().split())))\n\nprint(bc)', 'rest = []\n\nn = int(input())\nfor i in range(n):\n tmp = input().split()\n tmp[1] = int(tmp[1]) * (-1)\n tmp.append(i + 1)\n rest.... | ['Runtime Error', 'Accepted'] | ['s055398082', 's063103389'] | [2940.0, 3060.0] | [18.0, 18.0] | [169, 182] |
p03030 | u055875839 | 2,000 | 1,048,576 | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score. You want to in... | ['a = int(input())\n\n#List = map(int, List[,[1]])\nList = []\nfor i in range(a):\n\tb, c = input().split()\n\tc = int(c)\n\tList.append([b, c, i])\nList = sorted(List, key = lambda x:x[0])\nList = sorted(List, key = lambda x:x[1])\n\nList2 = []\nfor i in range(a):\n List2.append(a - List[i][2])\n \nprint(*List2)', '... | ['Wrong Answer', 'Accepted'] | ['s107053657', 's183609996'] | [3064.0, 3060.0] | [17.0, 18.0] | [339, 162] |
p03030 | u055941944 | 2,000 | 1,048,576 | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score. You want to in... | ['n=int(input())\na=[]\nb=[]\n\n\nfor i in range(n):\n s,p=input().split()\n a.append(s)\n b.append(p)\n\nx=list(zip(a,b))\n\ny=sorted(x,key=lambda x:(x[0]))\n\nfor i in range(n):\n print(int(x.index(y[i]))+1)', 'n=int(input())\na=[]\nb=[]\n\n\nfor i in range(n):\n s,p=input().split()\n p=int(p)\n ... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s069684056', 's093480258', 's211682156'] | [3060.0, 3064.0, 3064.0] | [18.0, 18.0, 17.0] | [204, 231, 223] |
p03030 | u057109575 | 2,000 | 1,048,576 | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score. You want to in... | ['N = int(input())\nX = [list(map(int, input().split())) for _ in range(N)]\nX.sort(key=lambda x: (x[0], -x[1]))\nfor a, b in X:\n print(a, b)', 'N = int(input())\nX = [list(input().split()) for _ in range(N)]\nX.sort(key=lambda x: (x[0], -int(x[1])))\nfor a, b in X:\n print(a, b)', 'N = int(input())\nX = [list(input... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s258982478', 's388046435', 's578847103'] | [3056.0, 3060.0, 3060.0] | [17.0, 17.0, 20.0] | [137, 132, 151] |
p03030 | u060569392 | 2,000 | 1,048,576 | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score. You want to in... | ['number=int(input())\nbook=[]\nfor n in range(number):\n book.append(input().split())\n\nfor i in range(len(book)):\n book[i].append(i+1)\n book[i][1]=int(book[i][1])\n\nbook1=sorted(book,key=lambda k:-k[1])\nbook2=sorted(book1,key=lambda k:k[0])\nprint("book2=",book2)\n\nfor i in range(len(book2)):\n prin... | ['Wrong Answer', 'Accepted'] | ['s350478980', 's280963189'] | [3064.0, 3064.0] | [17.0, 18.0] | [318, 296] |
p03030 | u063073794 | 2,000 | 1,048,576 | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score. You want to in... | ['salmonize\nn = int(input())\nl = []\nfor i in range(1,n+1):\n s,p = input().split()\n l.append((s,-int(p),i))\nl.sort()\nfor x in l:\n print(x[2])\n', 'N = int(input())\nl = []\n\nfor i in range(N):\n s,p=input().split()\n p=100-int(p)\n l.append((s,p,i+1))\nl.sort()\nfor i in range(N):\n print(l[i][2])'] | ['Runtime Error', 'Accepted'] | ['s799052552', 's487092051'] | [2940.0, 3060.0] | [17.0, 18.0] | [142, 147] |
p03030 | u065079240 | 2,000 | 1,048,576 | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score. You want to in... | ['import numpy as np\n\nN = int(input())\ncity = []\nscore = []\nitetator = []\nfor i in range(N):\n city_i, score_str = input().split()\n city.append(city_i)\n score_i = int(score_str)\n score.append(score_str)\n itetator.append(i+1)\nfor j in range(N):\n for k in range(N-1):\n if city[k] > ci... | ['Wrong Answer', 'Accepted'] | ['s604150184', 's329147062'] | [12912.0, 12508.0] | [165.0, 152.0] | [961, 756] |
p03030 | u065375429 | 2,000 | 1,048,576 | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score. You want to in... | ['# B\n# Guidebook\n\nN = int(input())\n\nsp_list = []\n\nfor i in range(N):\n \n sp = input().split(" ")\n sp.append(str(i+1))\n sp_list.append(sp)\n\n#print(sp_list)\n\nsp_list.sort(key = lambda x: -int(x[1]))\nsp_list.sort(key = lambda x: x[0])\n\nfor i in sp_list:\n print(sp_list)\n# print(N + 1 -... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s298539430', 's876633246', 's388459324'] | [3188.0, 3060.0, 3060.0] | [23.0, 18.0, 18.0] | [309, 275, 301] |
p03030 | u067025752 | 2,000 | 1,048,576 | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score. You want to in... | ['N = int(input())\nbook= []\nfor i in range(N):\n a = input().split()\n city = a[0]\n score = int(a[1])\n book.append((city, score))\nb=sorted(book)\nfor i in range(N):\n print(b[i][0], b[i][1])', 'N = int(input())\nbook= []\nfor i in range(N):\n a = input().split()\n city = a[0]\n score = (100... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s370167523', 's546455441', 's813455716'] | [3060.0, 3064.0, 3060.0] | [17.0, 19.0, 18.0] | [199, 301, 280] |
p03030 | u072606168 | 2,000 | 1,048,576 | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score. You want to in... | ['l = []\nfor i in range(int(input())):\n s,p = map(str, input().split())\n l.append((s,100-int(p),i+1))\nm = sorted(l)\nfor i in l:\n print(l[2])', 'l = []\nfor i in range(int(input())):\n s,p = map(str, input().split())\n l.append((s,100-int(p),i+1))\nm = sorted(l)\nfor i in m:\n print(i[2])'] | ['Runtime Error', 'Accepted'] | ['s103395719', 's911088248'] | [3060.0, 3060.0] | [17.0, 18.0] | [141, 141] |
p03030 | u073139376 | 2,000 | 1,048,576 | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score. You want to in... | ['N = int(input())\nL = []\nD = {}\nfor _ in range(N):\n k, v = input().split()\n v = int(v)\n L.append((k, v))\n if k not in D.keys():\n D[k] = [v]\n else:\n D[k].append(v)\nprint(D)\nfor v in D.values():\n v.sort(reverse=True)\nD = sorted(D.items(), key=lambda x: x[0])\nprint(D)\nfor d in D:\n for i in r... | ['Wrong Answer', 'Accepted'] | ['s200274673', 's372818595'] | [3064.0, 3064.0] | [17.0, 18.0] | [355, 339] |
p03030 | u076512055 | 2,000 | 1,048,576 | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score. You want to in... | ['N = int(input())\nSP = [0]*N\nfor n in range(N):\n SP[n] = list(input().split())+ [n+1]\n\nfor sp in SP:\n sp[1] = int(sp[1])\n \nSP.sort(key = lambda x: x[0])\nSP.sort(key = lambda x: x[1], reverse=True)\n\nfor sp in SP:\n print(sp[2])', 'N = int(input())\nSP = [0]*N\nfor n in range(N):\n SP[n] = list... | ['Wrong Answer', 'Accepted'] | ['s467185166', 's111410130'] | [3064.0, 3064.0] | [17.0, 18.0] | [236, 232] |
p03030 | u076764813 | 2,000 | 1,048,576 | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score. You want to in... | ['n=int(input())\nsp=[]\nfor i in range(n):\n s,p=input().split()\n sp.append([s,int(p),i+1])\n \nsort=sorted(sp, key=lambda sp: sp[0], -sp[1])\n\nfor i in range(sort):\n print(i[2])\n ', 'n=int(input())\nsp=[]\nfor i in range(n):\n s,p=input().split()\n sp.append([s,int(p),i+1])\n \nsort=sorted... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s032422855', 's699953324', 's939534181'] | [2940.0, 2940.0, 3060.0] | [17.0, 17.0, 17.0] | [188, 190, 183] |
p03030 | u078276601 | 2,000 | 1,048,576 | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score. You want to in... | ['n = int(input())\nrestaurant = [input().split() for i in range(n)]\nrestaurant_sorted = sorted(restaurant)\n\nfor i in range(n):\n print(restaurant.index((restaurant_sorted[i]))', 'n = int(input())\nrestaurant = [input().split() for i in range(n)]\nrestaurant.sort()\n\nfor i in range(n):\n print(restaurant[i])'... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s350939405', 's715348831', 's472928336'] | [8864.0, 9152.0, 9164.0] | [27.0, 25.0, 24.0] | [175, 128, 142] |
p03030 | u079022693 | 2,000 | 1,048,576 | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score. You want to in... | ['N=int(input())\ngrid=[]\nfor i in range(N):\n S_P=list(input().split())\n S_P.append(i+1)\n grid.append(S_P)\n\nfor i in range(N):\n grid[i][1]=int(grid[i][1])\n\ngrid.sort(key=lambda x:x[1],reverse=True)\ngrid.sort(key=lambda x:x[0])\n\nprint(grid)\nfor i in range(N):\n print(grid[i][2])', 'N=int(input())\... | ['Wrong Answer', 'Accepted'] | ['s340562035', 's506161522'] | [3064.0, 3064.0] | [18.0, 17.0] | [284, 272] |
p03030 | u081688405 | 2,000 | 1,048,576 | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score. You want to in... | ['N = int(input())\nrs = []\nfor _ in range(N):\n s, p = map(int, input().split())\n rs.append((i+1, s, p))\n\nrs.sort(key=lambda x:(x[1], -x[2]))\nfor r in rs:\n print(r[0])', 'N = int(input())\nrs = []\nfor i in range(N):\n s, p = input().split()\n rs.append((i+1, s, int(p)))\n\nrs.sort(key=lambda x:(x[1], -x[2]... | ['Runtime Error', 'Accepted'] | ['s166329177', 's742330867'] | [3060.0, 3060.0] | [17.0, 17.0] | [167, 162] |
p03030 | u082059717 | 2,000 | 1,048,576 | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score. You want to in... | ['import collections\ndef sortFirst(val):\n return val[0]\nN=raw_input("")\nN=int(N)\nl={}\nfor i in range(1,N+1):\n S,P = raw_input("").split(\' \')\n if S in l.keys():\n l[S].append([int(P),i])\n\n else:\n l[S]=[[int(P),i]]\n\n\nfor key in l.keys():\n l[key].sort(key=sortFirst,reverse=Tru... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s837804692', 's873587683', 's076541623'] | [3064.0, 3064.0, 3064.0] | [18.0, 17.0, 18.0] | [376, 402, 396] |
p03030 | u085334230 | 2,000 | 1,048,576 | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score. You want to in... | ['N = int(input())\nlines = [input().split(" ") for i in range(N)]\nfor i in lines:\n i[1] = int(i[1])\n\nl = sorted(lines, key=lambda x: (x[1]), reverse=True)\n\nl = sorted(l, key=lambda x: (x[0]))\nprint(l)\nfor u in l:\n for o in lines:\n if o == u:\n print(lines.index(o) + 1)', 'N = int(inpu... | ['Wrong Answer', 'Accepted'] | ['s160820844', 's727877973'] | [3064.0, 3064.0] | [20.0, 18.0] | [330, 263] |
p03030 | u087731474 | 2,000 | 1,048,576 | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score. You want to in... | ["from collections import defaultdict\nn = int(input())\nl1, l2 = [], []\nl3 = []\nd = defaultdict(dict)\n\nfor i in range(n):\n s, p = (x for x in input().split())\n p = int(p)\n d[s][i] = p\n\ns_sorted = sorted(d.items(), key=lambda x:x[0])\n\nfor i in s_sorted :\n s = sorted(i[1].values(), reverse = Tru... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s135813251', 's640509178', 's743666244', 's985419817'] | [3316.0, 3316.0, 3316.0, 3316.0] | [21.0, 21.0, 21.0, 21.0] | [424, 444, 444, 448] |
p03030 | u091051505 | 2,000 | 1,048,576 | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score. You want to in... | ['n = int(input())\nl = []\nfor i in range(1, n+1):\n k = input().split()\n l.append((k, i))\nl.sort()\nfor ll in l:\n print(ll[1])', 'n = int(input())\nl = []\nfor i in range(1, n+1):\n k, m = input().split()\n l.append((k, int(m), i))\nl = sorted(l, key=lambda x:(x[0], -x[1]))\nfor ll in l:\n print(... | ['Wrong Answer', 'Accepted'] | ['s401907645', 's554036055'] | [3060.0, 3060.0] | [17.0, 17.0] | [131, 175] |
p03030 | u092387689 | 2,000 | 1,048,576 | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score. You want to in... | ['n = int(input())\nl = []\nfor i in range(n):\n x,y = input().split()\n y = int(y)\n l.append([i+1,x,y])\n\nl.sort(key=lambda x: (x[1],(x[2]*-1)))\n\nfor i in range(n):\n print(l[i][0])\nprint(l)\n\n', 'n = int(input())\nl = [[i+1]+input().split() for i in range(n) ]\n\n\nl.sort(key=lambda x: [x[1],-1*x[2]... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s835588514', 's869361507', 's590492638'] | [9052.0, 9072.0, 9100.0] | [29.0, 25.0, 24.0] | [197, 141, 189] |
p03030 | u093033848 | 2,000 | 1,048,576 | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score. You want to in... | ['n = int(input())\n\ne = [[i for i in input().split()] for i in range(n)] \n\nfor i in range(n):\n e[i][1] = int(e[i][1])\n e[i].append(i+1)\n\ne.sort(key=lambda x:x[0])\ne.sort(key=lambda x:x[1], reverse=True)\n\nfor i in range(n):\n print(e[i][2])', 'n = int(input())\n\ne = [[i for i in input().split()] for... | ['Wrong Answer', 'Accepted'] | ['s603575943', 's208407233'] | [3060.0, 3060.0] | [18.0, 17.0] | [245, 214] |
p03030 | u093036549 | 2,000 | 1,048,576 | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score. You want to in... | ['n = int(input())\nlst = [list(input().split())+[i+1] for i in range(n)]\n\n# print(lst)\n\nlst = sorted(lst, key= lambda x:x[2])\n\nfor i in range(len(lst)):\n print(lst[i][2])', 'n = int(input())\nlst = [list(input().split())+[i+1] for i in range(n)]\n\n# print(lst)\n\nlst = sorted(lst, key= lambda x:x[0])\n\nfor... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s021098328', 's705551037', 's617618287'] | [3060.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0] | [171, 171, 184] |
p03030 | u094191970 | 2,000 | 1,048,576 | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score. You want to in... | ['N = int(input())\nl = []\nfor i in range(N):\n S, P = input().split()\n P = int(P)\n l.append([S, -P, i+1])\nl.sort\nfor l_ in l:\n print(l_[2])', 'n=int(input())\n\nl=[]\nfor i in range(n):\n s,p=input().split()\n p=-int(p)\n l.append([s,p,i+1])\n\nl.sort()\nfor i in l:\n print(i[-1])'] | ['Wrong Answer', 'Accepted'] | ['s191031299', 's573056209'] | [3060.0, 9156.0] | [18.0, 23.0] | [148, 132] |
p03030 | u098588273 | 2,000 | 1,048,576 | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score. You want to in... | ['n=int(input())\nsp_lis=[]\nfor i in range(n):\n s,p=input().split()\n sp_lis.append([s,100-p,i+1])\nfor j in range(n):\n print(sorted(sp_lis[j][2]))', 'n=int(input())\nsp_lis=[]\nfor i in range(n):\n s,p=input().split()\n sp_lis.append([s,100-int(p),i+1])\nfor j in range(n):\n print(sorted(sp_lis[j]... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s385831514', 's432559419', 's572086404', 's849829967', 's199576600'] | [2940.0, 2940.0, 2940.0, 2940.0, 3060.0] | [17.0, 17.0, 17.0, 17.0, 17.0] | [151, 156, 157, 142, 162] |
p03030 | u102242691 | 2,000 | 1,048,576 | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score. You want to in... | ['\nn = int(input())\na = ""\nb = 0\nl = []\n\nfor i in range(1,n+1):\n a,b = map(str,input().split())\n b = int(b)\n l.append([a,b,i])\nl.sort()\n\n#pprint.pprint(l)\n\nfor i in range(n):\n print(l[i][2])\n', '\nn = int(input())\na = ""\nb = 0\nl = []\n\nfor i in range(1,n+1):\n a,b = map(str,input().sp... | ['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s028846001', 's343617348', 's661309670', 's527166072'] | [3060.0, 3060.0, 3060.0, 3060.0] | [18.0, 17.0, 17.0, 18.0] | [201, 200, 411, 150] |
p03030 | u104005543 | 2,000 | 1,048,576 | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score. You want to in... | ['n = int(input())\nr = []\nfor i in range(n):\n name, point = input().split()\n point = int(point)\n r.append([n, -point, i + 1])\nr.sort()\nfor i in r:\n print(i[2])', 'n = int(input())\nr = []\nfor i in range(n):\n name, point = input().split()\n point = int(point)\n r.append([name, -point, i + ... | ['Wrong Answer', 'Accepted'] | ['s347244494', 's405079158'] | [3060.0, 3060.0] | [17.0, 17.0] | [169, 172] |
p03030 | u106311097 | 2,000 | 1,048,576 | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score. You want to in... | ["# -*- coding: utf-8 -*-\nimport sys\n\ns2nn = lambda s: [int(c) for c in s.split(' ')]\nss2nn = lambda ss: [int(s) for s in list(ss)]\nss2nnn = lambda ss: [s2nn(s) for s in list(ss)]\ni2s = lambda: sys.stdin.readline().rstrip()\ni2n = lambda: int(i2s())\ni2nn = lambda: s2nn(i2s())\nii2ss = lambda n: [i2s() for _ in r... | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s423446880', 's511175518', 's967740797', 's988264237', 's185843903'] | [3064.0, 3064.0, 3064.0, 3064.0, 3064.0] | [18.0, 17.0, 17.0, 17.0, 18.0] | [767, 598, 597, 597, 602] |
p03030 | u109632368 | 2,000 | 1,048,576 | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score. You want to in... | ['n = int(input())\nS = []\ncount = [0] * n\nfor i in range(n):\n a,b = input().split()\n S.append([a,int(b),i+1])\n\n\nS.sort()\n\n\nfor i in range(n-1):\n if S[i][0] != S[i+1][0]:\n count[i] += 1\nS.append([0,0,1])\ncount.append(1)\nfor j in range(n):\n for i in range(n):\n if S[i][1] < S[i+... | ['Wrong Answer', 'Accepted'] | ['s179744923', 's115832987'] | [3064.0, 3060.0] | [21.0, 17.0] | [472, 200] |
p03030 | u111555888 | 2,000 | 1,048,576 | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score. You want to in... | ['N=int(input())\nd=[input().split()+[i+1] for i in range(N)]\nd.sort(key=lambda x:(x[0],-int(x[1])))\nprint(d)\nfor i in d:\n print(i[2])', 'N=int(input())\nd=[input().split()+[i+1] for i in range(N)]\nd.sort(key=lambda x:(x[0],-int(x[1])))\nfor i in d:\n print(i[2])'] | ['Wrong Answer', 'Accepted'] | ['s902295977', 's636385027'] | [3060.0, 3060.0] | [18.0, 17.0] | [132, 123] |
p03030 | u113971909 | 2,000 | 1,048,576 | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score. You want to in... | ['N=int(input())\nA=[]\nfor i in range(N):\n a = list(input().split())\n A.append([a[0],int(a[1]),(i+1)])\nA.sort(key=lambda x:x[1],reverse=True) \nA.sort(key=lambda x:x[0]) \n\nprint(A)', 'N=int(input())\nA=[]\nfor i in range(N):\n a = list(input().split())\n A.append([a[0],int(a[1]),(i+1)])\nA.sort(key=lambda x... | ['Wrong Answer', 'Accepted'] | ['s014665488', 's832805320'] | [3064.0, 3060.0] | [17.0, 18.0] | [260, 276] |
p03030 | u114641312 | 2,000 | 1,048,576 | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score. You want to in... | ['# from math import factorial,sqrt\n# from itertools import permutations as permus\n# from fractions import gcd\n# from collections import deque,Counter\n# from decimal import Decimal, getcontext\n\n# # eps = Decimal(10) ** (-100)\n\n# import numpy as np\n# import scipy as scp\n\n\nn = int(input())\n\ndic = {}\nfor i ... | ['Wrong Answer', 'Accepted'] | ['s723623258', 's589276864'] | [3060.0, 3060.0] | [17.0, 17.0] | [807, 811] |
p03030 | u114928268 | 2,000 | 1,048,576 | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score. You want to in... | ["n = int(input())\nrestaurant = [[n]+input().split(' ') for n in range(n)]\n\nrestaurant.sort(key=lambda x: (x[1], x[2]))\nfor i,_,_ in restaurant:\n print(i)", "n = int(input())\nlist = [input().split(' ') for i in range(n)]\nrestaurant = [[n+1, list[n][0], int(list[n][1])] for n in range(n)]\n\nprint(restaurant)\... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s529949775', 's601939642', 's071531788'] | [3060.0, 3064.0, 3060.0] | [17.0, 17.0, 17.0] | [155, 274, 255] |
p03030 | u116233709 | 2,000 | 1,048,576 | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score. You want to in... | ['n=int(input())\ns,p=list(map(int,input().split()))\nli=[]\nfor i in range(0,n):\n li.append((i+1,s[i],p[i]))\n\nnew_li=sorted(li,key=lambda x:x[1])\nnew2_li=sorted(new_li,key=lambda x:x[2])\n\nfor j in range(0,n):\n print(new2_li[j][0])', 'n=int(input())\ns,p=input().split()\np=int(p)\nli=[]\n\nfor i in range(0,n):... | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s014860210', 's096266274', 's287007877', 's287844174', 's426828339', 's502636308', 's515559439', 's685199283', 's703760475', 's816848608', 's840915440', 's978558859', 's227123136'] | [3064.0, 3060.0, 3060.0, 3060.0, 2940.0, 3060.0, 3064.0, 3060.0, 3064.0, 3064.0, 3060.0, 3064.0, 3060.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 18.0, 17.0, 18.0, 18.0] | [228, 195, 244, 234, 233, 235, 252, 235, 237, 256, 240, 226, 240] |
p03030 | u116328320 | 2,000 | 1,048,576 | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score. You want to in... | ['n = int(input())\nbook = []\nfor i in range(n):\n name, rate = input().split()\n book.append((i+1, name, int(rate)))\nb = sorted(book, key=lambda s: s[2], reverse=True)\nb2 = sorted(b, key=lambda s: s[1])\n\nprint(b2)\n\nfor i, _, _ in b2:\n print(i)\n ', 'n = int(input())\nbook = []\nfor i in range(n):\n... | ['Wrong Answer', 'Accepted'] | ['s523095369', 's330831727'] | [3060.0, 3060.0] | [18.0, 18.0] | [253, 238] |
p03030 | u121192152 | 2,000 | 1,048,576 | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score. You want to in... | ['N = int(input())\n\nSP = {}\n\nfor n in range(N):\n s, p = input().split()\n p = int(p)\n if s not in SP:\n SP[s] = [(p, n+1)]\n else:\n SP[s].append((p, n+1))\n\nprint(SP)\n\nK = sorted(SP)\nprint(K)\n\nfor k in K:\n SP[k].sort(reverse=True)\n for t in SP[k]:\n print(t[1])\n', ... | ['Wrong Answer', 'Accepted'] | ['s232017179', 's904843041'] | [3060.0, 3060.0] | [18.0, 18.0] | [294, 275] |
p03030 | u126823513 | 2,000 | 1,048,576 | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score. You want to in... | ['n = int(input())\nli_w = list()\n\nfor _ in range(n):\n li_w.append(input().split())\n\nli_sorted = sorted(li_w, key=lambda x: (x[0], 100 - int(x[1])))\nfor a in li_w:\n print(li_sorted.index(a))\n', 'n = int(input())\nli_w = list()\n\nfor _ in range(n):\n li_w.append(input().split())\n\nli_sorted = sorted(l... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s060031291', 's128241501', 's749097294'] | [3060.0, 3060.0, 3060.0] | [18.0, 18.0, 17.0] | [194, 199, 198] |
p03030 | u128196936 | 2,000 | 1,048,576 | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score. You want to in... | ['N = int(input())\nR = []\nfor i in range(N):\n l = input().split()\n R.append((l[0], (-1)*int(l[1]), i))\n\nR.sort()\nfor i in range(N):\n print(R[2]+1)', 'N = int(input())\nR = []\nfor i in range(N):\n l = input().split()\n R.append((l[0], (-1)*int(l[1]), i))\n\nR.sort()\nfor i in range(N):\n print(R[i][2]+1)'... | ['Runtime Error', 'Accepted'] | ['s130745389', 's170424308'] | [2940.0, 3060.0] | [17.0, 17.0] | [147, 150] |
p03030 | u129492036 | 2,000 | 1,048,576 | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score. You want to in... | ['# -*- coding: utf-8 -*-\n\nN = int(input())\n\nSP = [input().split() for i in range(N)]\nSP = [[sp[0], sp[1], i] for i, sp in enumerate(SP)]\nSP.sort(key=lambda x: x[1], reverse=True)\nSP.sort(key=lambda x: x[0])\nSP = [[sp[0], sp[1], sp[2], i+1] for i, sp in enumerate(SP)]\nSP.sort(key=lambda x: x[2])\n\nfor sp in S... | ['Wrong Answer', 'Accepted'] | ['s678563360', 's112185187'] | [3064.0, 3060.0] | [17.0, 17.0] | [326, 243] |
p03030 | u132583371 | 2,000 | 1,048,576 | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score. You want to in... | ['n = int(input())\nr = []\nfor i in range(n):\n s,p = input().split()\n p = int(p)\n r.append([s,p,i])\na = sorted(r)\nfor i in range(n):\n print(a[i][2]+1)', 'n = int(input())\nr = []\nfor i in range(n):\n s,p = input().split()\n p = int(p)\n r.append([s,p,i])\na = sorted(r)\nfor i in range(n):\n... | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s096411778', 's185803379', 's571869136', 's846664053'] | [9072.0, 9012.0, 9028.0, 9020.0] | [25.0, 28.0, 23.0, 28.0] | [159, 159, 153, 161] |
p03030 | u134019875 | 2,000 | 1,048,576 | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score. You want to in... | ['n = int(input())\nd = {}\nfor _ in range(n):\n s, p = input().split()\n if s not in d.keys():\n d[s] = [p]\n else:\n d[s].append(p)\nc = 1\nfor i in sorted(d):\n for j in sorted(d[i], reverse=True):\n d[i][d[i].index(j)] = c\n c += 1\nfor k in d:\n for l in d[k]:\n pr... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s011057375', 's282953008', 's412967884', 's516351272'] | [3060.0, 3064.0, 3064.0, 3064.0] | [18.0, 23.0, 24.0, 26.0] | [310, 378, 419, 389] |
p03030 | u135847648 | 2,000 | 1,048,576 | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score. You want to in... | ['N = int(input())\nl = [list(input().split()) for _ in range(N)]\nfor i in range(N):\n l[i] += [i+1]\nl.sort(key=lambda x:x[0])\nl.sort(key=lambda x:int(x[1]))\nfor j in range(N):\n print(l[j][2])', 'N = int(input())\nl = [list(input().split()) for _ in range(N)]\nfor i in range(N):\n l[i] += [i+1]\nl.sort(key=lamb... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s143066106', 's206352925', 's838289132'] | [3060.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0] | [190, 191, 173] |
p03030 | u137416460 | 2,000 | 1,048,576 | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score. You want to in... | ['n = int(input())\narr = []\n\nfor i in range(n):\n\ts,p = input().split()\n\ta = {"i":i+1,"s":s,"p":int(p)}\n\tarr.append(a)\n\narr = sorted(arr, key=lambda x:x["p"], reverse=True)\nprint(arr)\narr = sorted(arr, key=lambda x:x["s"])\n\nfor a in arr:\n\tprint(a["i"])\n', 'n = int(input())\narr = []\n\nfor i in range(n... | ['Wrong Answer', 'Accepted'] | ['s856559611', 's620288306'] | [3060.0, 3060.0] | [17.0, 17.0] | [250, 251] |
p03030 | u140137089 | 2,000 | 1,048,576 | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score. You want to in... | ['\nread = input\nN = int(read())\nguidebook = []\nname = []\nfor i in range(N):\n line = read().split()\n# name.append(line[0])\n# score.append(line[1])\n a = (line[0],int(line[1]))\n guidebook.append(a)\n \nname = sorted(guidebook, key=lambda x:x[0])\n# print(name)\nfor item in guidebook:\n n =... | ['Wrong Answer', 'Accepted'] | ['s784397114', 's932064806'] | [3064.0, 3064.0] | [20.0, 18.0] | [739, 344] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.