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 |
|---|---|---|---|---|---|---|---|---|---|---|
p03078 | u366677622 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['x,y,z,K = map(int,input().split())\nabc = [sorted(list(map(int,input().split())), reverse=True) for i in range(3)]\n\nans=[]\nab=[]\n\nfor i in range(x):\n for j in range(y):\n if (i+1)*(j+1) <= K:\n ab.append(abc[0][i]+abc[1][j])\n\nab.sort(reverse=True)\n\nfor i in range(K):\n for j in range... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s088530927', 's117417214', 's319089480', 's466306106', 's928599152', 's488308907'] | [3064.0, 5364.0, 4084.0, 309080.0, 3312.0, 5364.0] | [17.0, 724.0, 213.0, 2128.0, 2104.0, 709.0] | [444, 443, 444, 276, 373, 458] |
p03078 | u367130284 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['X, Y, Z, K = map(int, input().split())\nA = list(map(int, input().split()))\nB = list(map(int, input().split()))\nC = list(map(int, input().split()))\nab=sorted(s+t for t in B for s in A)[-1:K-1:-1]\nprint(*sorted(i+x for i in ab for x in C)[::-1][:K],sep="\\n")', "X, Y, Z, K = map(int, input().split())\nA = list(map... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s328426697', 's336118878', 's391708491', 's680125966'] | [1224880.0, 1524952.0, 1203416.0, 161472.0] | [2177.0, 2199.0, 2179.0, 1859.0] | [256, 251, 257, 273] |
p03078 | u368700734 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['X, Y, Z, K = map(int, input().split())\nA = list(map(int, input().split()))\nB = list(map(int, input().split()))\nC = list(map(int, input().split()))\n\nab_total_list = []\ntotal_list = []\n\nA.sort()\nA.reverse()\nif len(A) > K:\n A = A[0:K+1]\n\nB.sort()\nB.reverse()\nif len(B) > K:\n B = B[0:K+1]\n\nC.sort()... | ['Runtime Error', 'Accepted'] | ['s478082158', 's711410945'] | [54456.0, 54452.0] | [498.0, 517.0] | [963, 869] |
p03078 | u371467115 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['x,y,z,k=map(int,input().split())\na=list(map(int,input().split()))\nb=list(map(int,input().split()))\nc=list(map(int,input().split()))\na.sort(reverse=True)\nb.sort(reverse=True)\nc.sort(reverse=True)\ntem=[]\nans=[]\n\nfor i in a:\n for j in b:\n tem.append(i+j)\n \ntem=tem[:min(3001,x*y*z+1)]\n\nfor k in c:\... | ['Runtime Error', 'Accepted'] | ['s528315923', 's686322248'] | [180216.0, 160340.0] | [2113.0, 1956.0] | [389, 486] |
p03078 | u375616706 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['import heapq\n# python template for atcoder1\nimport sys\nsys.setrecursionlimit(10**9)\ninput = sys.stdin.readline\n\nX, Y, Z, k = map(int, input().split())\nA = list(map(int, input().split()))\nB = list(map(int, input().split()))\nC = list(map(int, input().split()))\n\n\ndef calc(x, y, z):\n return [-A[x]-B[y]-C[... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s291631558', 's710295981', 's147106879'] | [5552.0, 3316.0, 5168.0] | [35.0, 20.0, 33.0] | [1094, 463, 1082] |
p03078 | u379692329 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['from itertools import product\nimport sys\ninput = sys.stdin.readline\n\nX, Y, Z, K = map(int, input().split())\nA = [int(_) for _ in input().split()]\nB = [int(_) for _ in input().split()]\nC = [int(_) for _ in input().split()]\nA = sorted(A)[::-1]\nB = sorted(B)[::-1]\nC = sorted(C)[::-1]\n\nList = [-1]*(X*Y)\nList... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s339648808', 's972640911', 's665337062'] | [187336.0, 209152.0, 9456.0] | [2112.0, 2114.0, 661.0] | [559, 473, 486] |
p03078 | u385644001 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['x,y,z,k=map(int,input().split())\nlistx = [int(i) for i in input().split()]\nlisty = [int(i) for i in input().split()]\nlistz = [int(i) for i in input().split()]\n\nimport numpy as np\nlistxy = np.zeros([x*y,],dtype=np.int)\nc = 0\nfor i in range(0,x):\n for j in range(0,y):\n listxy[c] = listx[i]+listy[j]\... | ['Runtime Error', 'Time Limit Exceeded', 'Time Limit Exceeded', 'Time Limit Exceeded', 'Accepted'] | ['s013052973', 's602629588', 's827444009', 's859983532', 's523408242'] | [20296.0, 30660.0, 31016.0, 64420.0, 163172.0] | [619.0, 2112.0, 2109.0, 2110.0, 1849.0] | [812, 794, 837, 836, 405] |
p03078 | u389910364 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ["from collections import Counter, deque\nfrom fractions import gcd\nfrom functools import lru_cache\nfrom functools import reduce\nimport functools\nimport heapq\nimport itertools\nimport math\nimport numpy as np\nimport sys\n\nsys.setrecursionlimit(10000)\nINF = float('inf')\n\nX, Y, Z, K = list(map(int, input().spli... | ['Time Limit Exceeded', 'Wrong Answer', 'Accepted'] | ['s524713231', 's962938757', 's203830128'] | [151004.0, 3956.0, 37256.0] | [2120.0, 30.0, 1855.0] | [976, 927, 1131] |
p03078 | u390694622 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['X,Y,Z,K = map(int,input().split())\nA = list(map(int,input().split()))\nB = list(map(int,input().split()))\nC = list(map(int,input().split()))\nA.sort(reverse=True)\nB.sort(reverse=True)\nC.sort(reverse=True)\ni = 0\nj = 0\nk = 0\nwhile i+j+k < min(3000,X*Y*Z):\n ans = A[i]+B[j]+C[k]\n deltaA = 10**16\n deltaB = 1... | ['Runtime Error', 'Accepted'] | ['s800899088', 's347906640'] | [3316.0, 5232.0] | [24.0, 41.0] | [881, 781] |
p03078 | u390883247 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['X,Y,Z,K = map(int,input().split())\nAList = list(map(int,input().split()))\nBList = list(map(int,input().split()))\nCList = list(map(int,input().split()))\nAList.sort(reverse=True)\nBList.sort(reverse=True)\nCList.sort(reverse=True)\nprint(AList)\nprint(BList)\nprint(CList)\nans = []\nfor x in range(X):\n for y in... | ['Wrong Answer', 'Accepted'] | ['s003647036', 's400078092'] | [8752.0, 8708.0] | [167.0, 162.0] | [587, 548] |
p03078 | u391277538 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['\n\nx, y, z, k = map(int, input().split())\n\nA = sorted(list(map(int, input().split())))\nB = sorted(list(map(int, input().split())))\nC = sorted(list(map(int, input().split())))\n\n\ntotal = [0]*k\ncount = 0\n\n\ndef sum_all(a, b, change):\n\tfor i in range(len(change)):\n\t\ttry:\n\t\t\ttotal[count] = change[i]\n\... | ['Runtime Error', 'Accepted'] | ['s460636479', 's118844997'] | [3192.0, 184468.0] | [20.0, 1973.0] | [726, 446] |
p03078 | u391875425 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['X, Y, Z, K = map(int,input().split())\nA = list(map(int,input().split()))\nB = list(map(int,input().split()))\nC = list(map(int,input().split()))\nAB = []\nans = []\nfor a in A:\n for b in B:\n AB.append(a + b)\nAB.sort(reverse=True)\nAB = AB[:min(3001,X*Y*Z+1)]\nfor c in C:\n for ab in AB:\n ans.... | ['Runtime Error', 'Accepted'] | ['s368083452', 's411232807'] | [167748.0, 162272.0] | [2113.0, 1903.0] | [380, 504] |
p03078 | u393481615 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['Anum, Bnum, Cnum, K = map(int, input().split())\nA = sorted(list(map(int, input().split())), reverse=True)\nB = sorted(list(map(int, input().split())), reverse=True)\nC = sorted(list(map(int, input().split())), reverse=True)\n\niA = 0\niB = 0\niC = 0\nwhile((iA + 1) * (iB + 1) * (iC + 1) < K):\n nextA = A[min(iA +... | ['Wrong Answer', 'Accepted'] | ['s980887848', 's937457388'] | [5520.0, 112344.0] | [86.0, 1858.0] | [1108, 548] |
p03078 | u403984573 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['X,Y,Z,K=map(int,input().split())\nA=[int(i) for i in input().split()]\nB=[int(i) for i in input().split()]\nC=[int(i) for i in input().split()]\nC.sort(reverse=True)\nA_B=[]\nSUM=[]\nfor i in range(X):\n for j in range(Y):\n A_B.append(A[i]+B[j])\nA_B.sort(reverse=True)\nfor i in range(K):\n for j in range(min(K... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s471119845', 's551169187', 's853563453', 's108933614'] | [205876.0, 102668.0, 208496.0, 8708.0] | [2117.0, 1142.0, 2120.0, 701.0] | [397, 462, 369, 423] |
p03078 | u413165887 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ["x, y, z, k = map(int, input().split(' '))\na = list(map(int, input().split(' ')))\nb = list(map(int, input().split(' ')))\nc = list(map(int, input().split(' ')))\nab = []\nfor i in range(len(a)):\n for j in range(len(b)):\n ab.append(a[i]+b[j])\nab.sort(reverse = True)\nabc = []\nk_1 = min([len(ab), k])\nfo... | ['Runtime Error', 'Accepted'] | ['s786502936', 's845187247'] | [198968.0, 5232.0] | [1716.0, 37.0] | [447, 763] |
p03078 | u422291726 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['X, Y, Z, K = map(int, input().split())\nA = list(map(int, input().split()))\nB = list(map(int, input().split()))\nC = list(map(int, input().split()))\n\nfor cakes in A, B, C:\n cakes.sort(reverse=True)\n\ncake_values = []\nfor i in range(len(A)):\n if i + 1 > K:\n break\n for j in range(len(B)):\n ... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s335466645', 's456900890', 's371228266'] | [8708.0, 1619392.0, 4340.0] | [118.0, 2202.0, 39.0] | [560, 418, 799] |
p03078 | u437638594 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['X, Y, Z, K = map(int, input().split())\nA_list = list(map(int, input().split()))\nB_list = list(map(int, input().split()))\nC_list = list(map(int, input().split()))\n\nA_list.sort(reverse=True)\nB_list.sort(reverse=True)\nC_list.sort(reverse=True)\n\nF_list = []\nfor i in range(1, X+1):\n if i > K:\n break\n for... | ['Runtime Error', 'Accepted'] | ['s091894407', 's805996174'] | [3188.0, 8708.0] | [19.0, 113.0] | [532, 538] |
p03078 | u440129511 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['x,y,z,k=map(int,input().split())\na=sorted(list(map(int,input().split())),reverse=True)\nb=sorted(list(map(int,input().split())),reverse=True)\nc=sorted(list(map(int,input().split())),reverse=True)\nl=[]\nfor i in range(x):\n if i+1>k:\n break\n for j in range(y):\n if (i+1)*(j+1)>k:\n break\n for k i... | ['Wrong Answer', 'Accepted'] | ['s081441321', 's738016013'] | [3188.0, 9548.0] | [19.0, 116.0] | [441, 445] |
p03078 | u451017206 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['package main\n\nimport (\n\t"bufio"\n\t"container/heap"\n\t"fmt"\n\t"os"\n\t"sort"\n\t"strconv"\n\t"strings"\n)\n\n// An Item is something we manage in a priority queue.\ntype Item struct {\n\tvalue []int\n\tpriority int\n\t// The index is needed by update and is maintained by the heap.Interface methods.\n\tindex ... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s507146004', 's946583655', 's057598169'] | [2940.0, 4460.0, 6000.0] | [17.0, 691.0, 45.0] | [3233, 841, 1057] |
p03078 | u451598761 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | [" \n\ndef main():\n if 'get_ipython' not in globals(): \n # For Subsession\n # N = int(input())\n X, Y, Z, K = input().split()\n A = [int(i) for i in input().split()] \n B = [int(i) for i in input().split()]\n C = [int(i) for i in input().split()] \n \n \n # x = [0] * N\n \n \n # ... | ['Runtime Error', 'Accepted'] | ['s482646208', 's986813691'] | [3188.0, 207160.0] | [18.0, 1884.0] | [1156, 768] |
p03078 | u460245024 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['x, y, z, k = map(int, input().split())\n\ncakes_x = list(map(int, input().split()))\ncakes_y = list(map(int, input().split()))\ncakes_z = list(map(int, input().split()))\n\ncakes_x.sort(reverse=True)\ncakes_y.sort(reverse=True)\ncakes_z.sort(reverse=True)\n\nprint(cakes_x)\nprint(cakes_y)\nprint(cakes_z)\n\nscores = ... | ['Wrong Answer', 'Accepted'] | ['s323372258', 's186496807'] | [607092.0, 4976.0] | [2141.0, 42.0] | [507, 884] |
p03078 | u463950771 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['X, Y, Z, K = map(int, input().split())\nA = list(map(int, input().split()))\nB = list(map(int, input().split()))\nC = list(map(int, input().split()))\n\nA.sort(reverse=True)\nB.sort(reverse=True)\nC.sort(reverse=True)\n\nresult = []\nfor i in range(X):\n for j in range(Y):\n for k in range(Z):\n ... | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s087219808', 's175515999', 's430313858', 's821960945', 's903039959', 's015361432'] | [9612.0, 8368.0, 8708.0, 160804.0, 8692.0, 8708.0] | [764.0, 650.0, 677.0, 1975.0, 682.0, 654.0] | [477, 494, 481, 523, 481, 493] |
p03078 | u465699806 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['/*\ng++ main.cpp --std=c++14; ./a.out < input.txt\n*/\n\n#include<map>\n\n#include<algorithm>\n#include<tuple>\n\nusing namespace std;\n\nconst auto mod = 1000000007L;\n\ntypedef long long ll;\n\ntemplate<typename T>\nusing V = vector<T>;\n\ntemplate<typename K, typename V>\nusing M = map<K,V>;\n\nll sum(tuple<ll,ll,... | ['Runtime Error', 'Accepted'] | ['s059634856', 's085125041'] | [3060.0, 3956.0] | [18.0, 576.0] | [1676, 739] |
p03078 | u474423089 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['N=list(map(int,(input().split(" "))))\nteast=[]\nK = N[3]\ntotal=[]\nfor i in range(3):\n teast.append(list(map(int,input().split(" "))))\nA=sorted(teast[0],reverse=True)\nB=sorted(teast[1],reverse=True)\nC=sorted(teast[2],reverse=True)\nfor i in range(len(A)):\n\n for j in range(len(B)):\n\n for k in ra... | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s353498112', 's369388549', 's517682307', 's584276639'] | [3188.0, 97888.0, 3064.0, 4864.0] | [18.0, 2104.0, 17.0, 36.0] | [504, 799, 504, 786] |
p03078 | u476604182 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ["from heapq import heappush, heappop\nX, Y, Z, K, *L = map(int, open('0').read().split())\nA = L[:X]\nB = L[X:X+Y]\nC = L[X+Y:]\nab = []\nfor i in range(X):\n for j in range(Y):\n ab += [A[i]+B[j]]\nab.sort(reverse=True)\nls = []\nfor i in range(Z):\n heappush(ls,(-ab[0]-C[i],j,0))\nfor i in range(K):\n m, j, cn... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s366367103', 's448234679', 's459853742', 's872656645', 's132557487'] | [3064.0, 14296.0, 55292.0, 14636.0, 55308.0] | [18.0, 157.0, 1112.0, 164.0, 1013.0] | [388, 443, 386, 441, 388] |
p03078 | u486302338 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['X, Y, Z, K = list(map(int, input().split()))\nA = list(map(int, input().split()))\nB = list(map(int, input().split()))\nC = list(map(int, input().split()))\nA.sort(reverse=True)\nB.sort(reverse=True)\nC.sort(reverse=True)\n\ncandidates = []\nfor i in range(len(A)-1):\n for j in range(len(B)-1):\n for k in r... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s185422364', 's856218310', 's065883465'] | [8708.0, 5996.0, 3828.0] | [759.0, 2104.0, 569.0] | [528, 491, 813] |
p03078 | u498136917 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['X, Y, Z, K = list(map(int, input().split()))\nA = sorted(list(map(int, input().split())))\nB = sorted(list(map(int, input().split())))\nC = sorted(list(map(int, input().split())))\n\nl = []\nfor a in A:\n for b in B:\n l.append(a+b)\nl = sorted(l, reverse = True)[:K]\n\nans = []\nfor c in C:\n for k in ... | ['Runtime Error', 'Accepted'] | ['s045910651', 's257456592'] | [221224.0, 221004.0] | [1690.0, 1992.0] | [402, 372] |
p03078 | u505830998 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['# -*- coding: utf-8 -*-\n\nfrom heapq import heappush, heappop\ndef io_generator():\n\treturn input()\n\n#+++++++++++++++++++\n\t\nclass Foo(object):\n\tdef __init__(self, value, state):\n\t\tself.state = state\n\t\tself.value = value\n\n\tdef __lt__(self, other):\n\t\treturn self.value > other.value\n\ndef get_c(aa,... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s442880338', 's758528916', 's656009347'] | [3316.0, 5692.0, 5580.0] | [20.0, 44.0, 92.0] | [1248, 490, 1276] |
p03078 | u512007680 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['import heapq\n\nx,y,z,k = map(int,input().split())\na = list(map(int,input().split()))\nb = list(map(int,input().split()))\nc = list(map(int,input().split()))\n\na.sort(reverse = True)\nb.sort(reverse = True)\nc.sort(reverse = True)\n\nl = []\n\nfor p in range(0,x):\n for q in range(0,y):\n for r in range(0... | ['Runtime Error', 'Accepted'] | ['s175813206', 's791860264'] | [3316.0, 3700.0] | [20.0, 886.0] | [567, 582] |
p03078 | u517152997 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['# -*- coding: utf-8 -*-\n#\nimport math\nimport sys\nimport itertools\nimport numpy as np\n\n\n\nx,y,z,k = map(int, input().split())\n\n\na = [int(i) for i in input().split()]\nb = [int(i) for i in input().split()]\nc = [int(i) for i in input().split()]\n\na.sort(reverse=True)\nb.sort(reverse=True)\nc.sort(reverse=Tr... | ['Wrong Answer', 'Accepted'] | ['s090752332', 's641394116'] | [323188.0, 14116.0] | [2124.0, 180.0] | [638, 1133] |
p03078 | u517447467 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['S = input()\ncorrect_case1 = "".join(["0" if i%2 == 0 else "1" for i in range(len(S))])\ncorrect_case2 = "".join(["0" if i%2 == 1 else "1" for i in range(len(S))])\nc1 = 0\nc2 = 0\nfor i in range(len(S)):\n if correct_case1[i] != S[i]:\n c1 += 1\n if correct_case2[i] != S[i]:\n c2 += 1\nprint(min([c1, c2]))',... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s158091958', 's940358226', 's257488643'] | [3064.0, 912176.0, 185544.0] | [17.0, 2160.0, 1722.0] | [306, 340, 413] |
p03078 | u522726434 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['X, Y, Z, K = list(map(int, input().split()))\nA_list = list(map(int, input().split()))\nB_list = list(map(int, input().split()))\nC_list = list(map(int, input().split()))\n\nA_list.sort(reverse=True)\nB_list.sort(reverse=True)\nC_list.sort(reverse=True)\n\nclass Value():\n def __init__(self, A_list, B_list, C_list, ... | ['Wrong Answer', 'Accepted'] | ['s284364464', 's269397669'] | [3444.0, 5236.0] | [54.0, 42.0] | [1432, 1334] |
p03078 | u525227429 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['X, Y, Z, K = map(int, input().split())\nA = list(map(int, input().split()))\nB = list(map(int, input().split()))\nC = list(map(int, input().split()))\nA.sort(reverse = True)\nB.sort(reverse = True)\nC.sort(reverse = True)\nans = []\n\nApB = []\n\nfor i in range(min(X, K)):\n for j in range(min(Y, K)):\n ApB.app... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s017101608', 's209208035', 's624144764'] | [3064.0, 54448.0, 8708.0] | [18.0, 567.0, 126.0] | [517, 514, 509] |
p03078 | u526603504 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['xyzk_, a_, b_, c_ = [input() for _ in range(4)]\n\nx, y, z, k = [int(w) for w in xyzk_.split()]\na_nums = [int(n) for n in a_.split()]\nb_nums = [int(n) for n in b_.split()]\nc_nums = [int(n) for n in c_.split()]\n\na_nums.sort(reverse=True)\nb_nums.sort(reverse=True)\nc_nums.sort(reverse=True)\n\np, q, r = 0, 0, 0\n... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s120622304', 's275213100', 's307033240', 's683724484', 's760862610', 's780562105', 's923107326'] | [3188.0, 3444.0, 3572.0, 3064.0, 4716.0, 4716.0, 4724.0] | [19.0, 22.0, 22.0, 18.0, 1858.0, 1831.0, 1824.0] | [757, 757, 866, 800, 762, 762, 799] |
p03078 | u533039576 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['x, y, z, k = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nc = list(map(int, input().split()))\n\nd = []\nfor i in range(x):\n for j in range(y):\n d.append(a[i] + b[j])\nd.sort(reverse=True)\n\ne = []\nfor i in range(k):\n for j in range(z):\n ... | ['Runtime Error', 'Accepted'] | ['s525558896', 's491672658'] | [208500.0, 4976.0] | [2117.0, 36.0] | [385, 751] |
p03078 | u536325690 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['from itertools import product\n\nX, Y, Z, K = map(int, input().split())\nA = [int(i) for i in input().split()]\nB = [int(i) for i in input().split()]\nC = [int(i) for i in input().split()]\n\nA.sort(reverse=True)\nB.sort(reverse=True)\nC.sort(reverse=True)\n\nif X * Y * Z > 3000:\n X = 3000\n Y = 3000\n Z = ... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s963429030', 's994555165', 's435969548'] | [206536.0, 105104.0, 8748.0] | [2117.0, 1028.0, 120.0] | [587, 554, 539] |
p03078 | u537782349 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['a, b, c, d = map(int, input().split())\nal = list(map(int, input().split()))\nbl = list(map(int, input().split()))\ncl = list(map(int, input().split()))\nal = sorted(al, reverse=True)\nbl = sorted(bl, reverse=True)\ncl = sorted(cl, reverse=True)\nq = [[al[0] + bl[0] + cl[0], 0, 0, 0]]\nans = [[al[0] + bl[0] + cl[0], ... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s009351841', 's022914520', 's279026286', 's361105150', 's402499533', 's620555401', 's739351620', 's862343571', 's116360798'] | [5324.0, 5336.0, 5324.0, 5072.0, 3188.0, 4984.0, 5224.0, 5236.0, 4980.0] | [2104.0, 2104.0, 2108.0, 2104.0, 17.0, 2107.0, 2104.0, 1568.0, 856.0] | [1334, 1792, 1320, 1329, 1791, 1374, 1322, 1821, 923] |
p03078 | u540136623 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['X, Y, Z, K = map(int, input().split())\n\nlist_cake_1 = []\nlist_cake_2 = []\nlist_cake_3 = []\n\nwhile len(list_cake_1) < X:\n\telement = list(map(int, input().split()))\n\tlist_cake_1.extend(element)\n\nwhile len(list_cake_2) < Y:\n\telement = list(map(int, input().split()))\n\tlist_cake_2.extend(element)\n\t\nwhil... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s246124935', 's332984619', 's339730977', 's755256838'] | [202132.0, 3064.0, 3064.0, 9564.0] | [2117.0, 18.0, 18.0, 569.0] | [764, 659, 565, 631] |
p03078 | u540761833 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['import heapq\nX,Y,Z,K = map(int,input().split())\nA = sorted(list(map(int,input().split())),reverse=1)\nB = sorted(list(map(int,input().split())),reverse=1)\nC = sorted(list(map(int,input().split())),reverse=1)\nQ = [(-A[0]-B[0]-C[0],0,0,0)]\nheapq.heapify(Q)\nfor i in range(K):\n n,a,b,c = heapq.heappop(Q)\n i... | ['Wrong Answer', 'Accepted'] | ['s248280326', 's503544613'] | [4212.0, 4592.0] | [32.0, 830.0] | [515, 696] |
p03078 | u545368057 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['\nimport heapq\nX,Y,Z,K = map(int,input().split())\nAs = sorted(list(map(int,input().split())),reverse=True)\nBs = sorted(list(map(int,input().split())),reverse=True)\nCs = sorted(list(map(int,input().split())),reverse=True)\nq = []\nheapq.heapify(q)\nheapq.heappush(q,(-(As[0]+Bs[0]+Cs[0]),0,0,0))\nfor i in range(K):... | ['Wrong Answer', 'Accepted'] | ['s146730307', 's877446777'] | [4184.0, 4572.0] | [34.0, 774.0] | [674, 890] |
p03078 | u547167033 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['x,y,z,k=map(int,input().split())\na=list(map(int,input().split()))\nb=list(map(int,input().split()))\nc=list(map(int,input().split()))\nab=[]\nfor i in range(x):\n for j in range(y):\n ab.append(a[i]+b[j])\nab.sort(reverse=True)\nab=ab[:k]\nabc=[]\nfor i in range(k):\n for j in range(z):\n abc.append(ab[i]+c[... | ['Runtime Error', 'Accepted'] | ['s119983625', 's410824121'] | [166252.0, 4084.0] | [2113.0, 789.0] | [366, 271] |
p03078 | u550419600 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ["from heapq import heappop, heappush\n\nX, Y, Z, K = [int(s) for s in input().split()]\nA = [int(s) for s in input().split()]\nB = [int(s) for s in input().split()]\nC = [int(s) for s in input().split()]\nA.sort(reverse=True)\nB.sort(reverse=True)\nC.sort(reverse=True)\na, b, c = 1, 1, 1\nwhile a * b < K or a * c < K... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s323551259', 's716662177', 's802700562'] | [124796.0, 124912.0, 4852.0] | [2104.0, 2103.0, 35.0] | [770, 750, 795] |
p03078 | u550943777 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['import heapq as hq\nx, y, z, k = map(int,input().split())\narr_a = sorted(list(map(int,input().split())) ,reverse = True)\narr_b = sorted(list(map(int,input().split())) ,reverse = True)\narr_c = sorted(list(map(int,input().split())) ,reverse = True)\n\ncnt = [[[0 for i in range(z)] for j in range(y)] for k in range(x... | ['Wrong Answer', 'Accepted'] | ['s750479045', 's766744672'] | [423796.0, 4976.0] | [2131.0, 39.0] | [933, 874] |
p03078 | u556225812 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['import heapq\nimport sys\nsys.setrecursionlimit(100000000)\nx, y, z, k = map(int, input().split())\nA = list(map(int, input().split()))\nB = list(map(int, input().split()))\nC = list(map(int, input().split()))\nA.sort(reverse=True)\nB.sort(reverse=True)\nC.sort(reverse=True)\n\nq = []\nans = []\nflag = []\nfirst = [A... | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s326421337', 's444316978', 's494745282', 's832870926', 's929946285', 's956640277', 's103545515'] | [4724.0, 4724.0, 72676.0, 3188.0, 4724.0, 4724.0, 4844.0] | [933.0, 932.0, 2104.0, 18.0, 939.0, 927.0, 936.0] | [1023, 1114, 1109, 1010, 1021, 979, 1096] |
p03078 | u560264606 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['X, Y, Z, K = map(int, input().split())\n\nA = map(int, input().split())\nB = map(int, input().split())\nC = map(int, input().split())\n\n\ndef get_good(a, v):\n if v is not None:\n return max(a[a < v])\n else:\n max(a)\n\n\nvalue = 0\na = b = c = None\nfor i in range(K):\n print(get_good(A, a) ... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s082341580', 's146003703', 's387708512', 's506842343', 's569568771', 's653559310', 's430820057'] | [3188.0, 12488.0, 3572.0, 4340.0, 3444.0, 4716.0, 4980.0] | [18.0, 149.0, 194.0, 1893.0, 193.0, 35.0, 36.0] | [395, 424, 804, 1028, 914, 958, 933] |
p03078 | u560889512 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['a,b,c,k=map(int,input().split())\ncake1=sort(map(int,input().split()),reverse=True)[:max(a,k)]\ncake2=sort(map(int,input().split()),reverse=True)[:max(b,k)]\ncake3=sort(map(int,input().split()),reverse=True)[:max(c,k)]\nres=[]\nfor i in range(min(a,k)):\n for j in range(min(b,k)):\n for l in range(min(c,k)):\n ... | ['Runtime Error', 'Accepted'] | ['s096704905', 's375676848'] | [3064.0, 5104.0] | [18.0, 38.0] | [442, 864] |
p03078 | u566935164 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['x, y, z, k = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nc = list(map(int, input().split()))\n\na.sort(key=lambda x: -x)\nb.sort(key=lambda x: -x)\nc.sort(key=lambda x: -x)\n\nxy = []\nxyz = []\nm = min(3000, x*y*z)\n\nfor ia in a:\n for ib in b:\n xy... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s859869442', 's884152406', 's979495705'] | [320260.0, 744644.0, 8708.0] | [2121.0, 2150.0, 764.0] | [467, 380, 492] |
p03078 | u595289165 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['x, y, z, k = map(int, input().split())\na = tuple(map(int, input().split()))\nb = tuple(map(int, input().split()))\nc = tuple(map(int, input().split()))\n\nab = [i + j for i in a for j in b]\nab.sort(reverse=True)\nab = ab[:k]\n\nabc = [i + j for i in ab for j in b]\n\nabc.sort(reverse=True)\nfor i in abc[:k]:\n p... | ['Wrong Answer', 'Accepted'] | ['s910696108', 's439667454'] | [165724.0, 4972.0] | [2114.0, 57.0] | [313, 755] |
p03078 | u598229387 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['import heapq\nx,y,z,k=map(int,input().split())\na=[int(i) for i in input().split()]\nb=[int(i) for i in input().split()]\nc=[int(i) for i in input().split()]\na.sort(reverse=True)\nb.sort(reverse=True)\nc.sort(reverse=True)\n\nli=[]\npush=heapq.heappush\npop=heapq.heappop\n\npush(li,(-a[0]-b[0]-c[0],0,0,0))\nans=[]\n... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s347944013', 's620446742', 's688578867'] | [4084.0, 3700.0, 5104.0] | [30.0, 25.0, 35.0] | [746, 746, 773] |
p03078 | u600402037 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['# coding: utf-8\nimport sys\nfrom bisect import bisect_left, bisect_right\nimport itertools\n\nsr = lambda: sys.stdin.readline().rstrip()\nir = lambda: int(sr())\nlr = lambda: list(map(int, sr().split()))\n\n\nX, Y, Z, K = lr()\nA = lr(); A.sort()\nB = lr(); B.sort()\nC = lr(); C.sort()\nD = []\nfor a, b in itertools... | ['Wrong Answer', 'Accepted'] | ['s194162806', 's520544649'] | [543476.0, 4840.0] | [2136.0, 37.0] | [886, 939] |
p03078 | u609061751 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['import sys\ninput = sys.stdin.readline\n\nx, y, z, k = [int(x) for x in input().split()]\na = [int(x) for x in input().split()]\nb = [int(x) for x in input().split()]\nc = [int(x) for x in input().split()]\na.sort()\nb.sort()\nc.sort()\n\nx_y_list = []\n\nfor i in a:\n for j in b:\n x_y_list.append(i + j)\n... | ['Wrong Answer', 'Accepted'] | ['s404833678', 's795280813'] | [77500.0, 74880.0] | [1017.0, 925.0] | [921, 935] |
p03078 | u611782980 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['# -*- coding: utf-8 -*-\n\nX, Y, Z, K = map(int, input().split())\nA = sorted(map(int, input().split()), reverse=True)\nB = sorted(map(int, input().split()), reverse=True)\nC = sorted(map(int, input().split()), reverse=True)\n\nABC = []\n\nfor x in X:\n for y in Y:\n if (x + 1) * (y + 1) > K:\n b... | ['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s156677794', 's272463693', 's688691357', 's564650599'] | [3188.0, 186140.0, 3316.0, 9544.0] | [19.0, 2114.0, 48.0, 115.0] | [547, 530, 457, 545] |
p03078 | u620806894 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['import math\n\nx,y,z,k = map(int,input().split())\nA = list(map(int,input().split()))\nB = list(map(int,input().split()))\nC = list(map(int,input().split()))\n\nAi= sorted(A, reverse=True)\nBi= sorted(B, reverse=True)\nCi= sorted(C, reverse=True)\n\ndef su(a,b,c):\n\treturn(Ai[a]+Bi[b]+Ci[c])\n\na=0\nb=0\nc=0\n\npq=[... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s008289790', 's278407625', 's330579158'] | [85400.0, 4340.0, 4724.0] | [2108.0, 851.0, 1767.0] | [585, 586, 731] |
p03078 | u621509943 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['x,y,z,k = map(int,input().split())\na = list(map(int,input().split()))\nb = list(map(int,input().split()))\nc = list(map(int,input().split()))\na.sort(reverse = True)\nb.sort(reverse = True)\nc.sort(reverse = True)\nh = []\nfor i in range(x):\n if(i + 1>k) : break\n for j in range(y):\n if((i + 1)*(j + 1... | ['Runtime Error', 'Accepted'] | ['s095410785', 's511265476'] | [3064.0, 8712.0] | [17.0, 115.0] | [493, 492] |
p03078 | u626881915 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['x, y, z, k = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nc = list(map(int, input().split()))\na = sorted(a, reverse=True)\nb = sorted(b, reverse=True)\nc = sorted(c, reverse=True)\n\nq = [(a[0]+b[0]+c[0], 0, 0, 0)]\nfor i in range(min(x*y*z, k)):\n m = q.pop(q... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s056319809', 's409251091', 's879855425', 's610228883'] | [3700.0, 3700.0, 3700.0, 4340.0] | [1276.0, 975.0, 983.0, 1652.0] | [726, 670, 658, 848] |
p03078 | u628581330 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['a,b,c,d = map(int, input().split())\n\ns1=list(map(int, input().split()))\ns2=list(map(int, input().split()))\ns3=list(map(int, input().split()))\n\nans1 = sorted(i+j for i in s1 for j in s2)\nans2 = sorted(i+j for i in ans1 for j in s3)\nres = sorted(ans2,reverse=True)\nprint(*res[:k+1], sep="\\n")', 'def cake(s1,s2... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s601384039', 's882913716', 's979873792', 's504691286'] | [1258440.0, 1268808.0, 3064.0, 162704.0] | [2182.0, 2186.0, 17.0, 1706.0] | [290, 431, 224, 408] |
p03078 | u634159866 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['X, Y, Z, K = map(int, input().split())\nA = sorted(list(map(int, input().split())), reverse=True)\nB = sorted(list(map(int, input().split())), reverse=True)\nC = sorted(list(map(int, input().split())), reverse=True)\n\nimport heapq\n\nheap = []\nheapq.heappush(heap, (-(A[0]+B[0]+C[0]), 0, 0, 0))\nadded = set([(0, 0, ... | ['Runtime Error', 'Accepted'] | ['s882086409', 's803837584'] | [3188.0, 4948.0] | [20.0, 35.0] | [786, 795] |
p03078 | u652057333 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['# D\nx, y, z, k = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nc = list(map(int, input().split()))\na.sort(reverse=True)\nb.sort(reverse=True)\nc.sort(reverse=True)\na_l = []\na_max = a[0]\nfor i in range(len(a)):\n a_l.append(a[i] - a_max)\nb_l = []\nb_max =... | ['Runtime Error', 'Accepted'] | ['s065881252', 's543164659'] | [3828.0, 8708.0] | [24.0, 623.0] | [1090, 524] |
p03078 | u661707952 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ["#!/usr/bin/env python3.4\n# -*- coding: utf-8 -*-\n\n# abc123_d\nimport itertools\nimport math\n\n# input\nX, Y, Z, K = map(int, input().split())\n# A = list(map(int, input().split()))\n# B = list(map(int, input().split()))\n# C = list(map(int, input().split()))\nA = range(1000)\nB = range(1000)\nC = range(1000)\n\nA... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s083505767', 's285747271', 's412331436'] | [160336.0, 160976.0, 8792.0] | [2113.0, 2112.0, 732.0] | [662, 663, 644] |
p03078 | u662121130 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['X, Y, Z, K = [int(i) for i in input().split()]\nA = [int(i) for i in input().split()]\nB = [int(i) for i in input().split()]\nC = [int(i) for i in input().split()]\nA = sorted([int(x) for x in A], reverse=True)\nB = sorted([int(x) for x in B], reverse=True)\nC = sorted([int(x) for x in C], reverse=True)\n\nres = []\n... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s001183457', 's006718628', 's122600844', 's140186603', 's234160743', 's274500053', 's277750924', 's329003206', 's383370517', 's501989482', 's544289226', 's553440157', 's691509166', 's693798884', 's782180243', 's876347706', 's549568233'] | [4084.0, 3064.0, 3064.0, 3064.0, 3188.0, 3064.0, 3700.0, 3956.0, 3064.0, 4084.0, 3572.0, 3064.0, 3316.0, 3064.0, 3572.0, 3064.0, 4852.0] | [142.0, 17.0, 17.0, 19.0, 19.0, 18.0, 24.0, 2103.0, 20.0, 33.0, 23.0, 17.0, 18.0, 18.0, 23.0, 19.0, 864.0] | [882, 878, 527, 530, 557, 505, 643, 888, 528, 882, 598, 878, 509, 529, 553, 509, 844] |
p03078 | u667024514 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['x,y,z,k = map(int,input().split())\nlisa = list(map(int,input().split()))\nlisb = list(map(int,input().split()))\nlisc = list(map(int,input().split()))\nlisc.sort(reverse=True)\nan,ans = [],[]\nfor num in lisb:for nu in lisa:an.append(num+nu)\nan.sort(reverse=True)\nan = an[:min(3001,x*y*z+1)]\nfor num in lisc:for nu... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s466962305', 's580156945', 's135667508'] | [2940.0, 160104.0, 160540.0] | [17.0, 2113.0, 1999.0] | [389, 514, 472] |
p03078 | u669240121 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['X, Y, Z, K = map(int, input().split())\ncandy = [[],[],[]]\nfor i in range(3):\n temp = list(map(int, input().split()))\n candy[i] = temp\n\nfor i in range(3):\n candy[i] = sorted(candy[i], reverse=True)\ni, j, k = 0, 0, 0\nheap = [(-(candy[0][i] + candy[1][j] + candy[2][k]), i, j, k)]\ncnt = 0\nvisit = {(i,... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s001466719', 's504897627', 's829353717'] | [3188.0, 3188.0, 4960.0] | [20.0, 20.0, 37.0] | [981, 997, 994] |
p03078 | u673361376 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['import heapq\n\nX,Y,Z,K = map(int,input().split())\nA, B, C = [sorted(list(map(int,input().split())),reverse=True) for _ in range(3)]\n\nQ = []\nia,ib,ic = 0,0,0\nplus_i = 1\nheapq.heappush(Q, [-(A[ia]+B[ib]+C[ic]),ia,ib,ic])\n\nfor _ in range(K):\n if ia+plus_i < X and [-(A[ia+plus_i]+B[ib]+C[ic]),ia+plus_i,ib,ic] ... | ['Runtime Error', 'Accepted'] | ['s157322968', 's768315736'] | [3956.0, 3956.0] | [225.0, 722.0] | [732, 558] |
p03078 | u673559119 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['#conding utf-8\nx,y,z,K=map(int,input().split())\na=list(map(int,input().split())) \nb=list(map(int,input().split())) \nc=list(map(int,input().split())) \n\na.sort()\nb.sort()\nc.sort()\na.reverse()\nb.reverse()\nc.reverse()\n\nans=[]\n\nfor i in range(len(a)):\n for j in range(len(b)):\n if (i+1)*(j+1)>K:\n ... | ['Wrong Answer', 'Accepted'] | ['s097809703', 's653415692'] | [8688.0, 8708.0] | [116.0, 119.0] | [477, 477] |
p03078 | u677267454 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['x, y, z, k = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nc = list(map(int, input().split()))\n\nab = []\nfor i in range(x):\n for j in range(y):\n ab.append(a[i] + b[j])\n\n\nab.sort(reversed=True)\nc.sort(reversed=True)\n\nabc = []\nfor i in range(k)... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s580767831', 's721520042', 's366493543'] | [50648.0, 50648.0, 4768.0] | [278.0, 307.0, 36.0] | [424, 424, 1054] |
p03078 | u677312543 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['x, y, z, k = map(int, input().split())\n\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nc = list(map(int, input().split()))\n\ne = [a_i + b_j for b_j in b for a_i in a]\ne.sort(reverse=True)\n\nans = [e_i + c_j for c_j in c[:k] for e_i in e[:k]]\nans.sort(reverse=True)\n\nprint(ans[:k])', ... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s393768115', 's419099076', 's477681446', 's734003454', 's800263837', 's801318844', 's811613475', 's404069845'] | [211112.0, 209500.0, 213304.0, 168720.0, 213084.0, 213828.0, 1513688.0, 209628.0] | [2117.0, 2115.0, 2064.0, 1957.0, 2116.0, 2116.0, 2198.0, 1999.0] | [303, 324, 310, 306, 310, 360, 302, 340] |
p03078 | u683134447 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['x,y,z,k = map(int,input().split())\t\n\nal = list(map(int,input().split()))\nbl = list(map(int,input().split()))\ncl = list(map(int,input().split()))\n\nal = sorted(al)\nbl = sorted(bl)\ncl = sorted(cl)\nrank = []\nfor xx in range(x-1,-1,-1):\n tmp = al[xx]+bl[-1]+cl[-1]\n if rank[-1] >= tmp:\n break\n ... | ['Runtime Error', 'Accepted'] | ['s692736208', 's349287283'] | [3188.0, 3572.0] | [19.0, 1746.0] | [919, 982] |
p03078 | u687599294 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ["x,y,z,k = list(map(int, input().split()))\na = list(map(int,input().split()))\nb = list(map(int,input().split()))\nc = list(map(int,input().split()))\nl = []\nfor i in a:\n for j in b:\n for kk in c:\n l.append(i + j + kk)\nl.sort(reverse = True)\nprint(k,'a')\nfor i in range(k):\n print(l[i])... | ['Wrong Answer', 'Accepted'] | ['s553915801', 's659636932'] | [573784.0, 8708.0] | [2139.0, 755.0] | [306, 501] |
p03078 | u690536347 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['from heapq import heappop, heappush\n\nX, Y, Z, K = map(int, input().split())\n*A, = map(int, input().split())\n*B, = map(int, input().split())\n*C, = map(int, input().split())\nA.sort(reverse=True)\nB.sort(reverse=True)\nC.sort(reverse=True)\n\nq = []\nvisited = set()\n\na = A[0]\nfor i,b in enumerate(B):\n for j... | ['Runtime Error', 'Accepted'] | ['s087769085', 's883215686'] | [604120.0, 177016.0] | [2130.0, 1783.0] | [799, 361] |
p03078 | u692746605 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['X,Y,Z,K = (int(_) for _ in input().split())\nA = [int(_) for _ in input().split()]\nB = [int(_) for _ in input().split()]\nC = [int(_) for _ in input().split()]\n\nL=[0]*X*Y*Z\nK = min(K, 3000, X*Y*Z)\n\nfor x in range(X):\n for y in range(Y):\n for z in range(Z):\n L.append(A[x]+B[y]+C[z])\n\n#L... | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s516523239', 's617030723', 's848900460', 's555309530'] | [10996.0, 10996.0, 3188.0, 112344.0] | [25.0, 24.0, 18.0, 1796.0] | [362, 368, 370, 445] |
p03078 | u716043626 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['X, Y, Z, K = map(int, input().split())\nA = list(map(int, input().split()))\nB = list(map(int, input().split()))\nC = list(map(int, input().split()))\n \nA = sorted(A, reverse=True)[:K+1]\nB = sorted(B, reverse=True)[:K+1]\nC = sorted(C, reverse=True)[:K+1]\n \nres = []\n \nfor i in A:\n for j in B:\n res.a... | ['Wrong Answer', 'Accepted'] | ['s657466535', 's987890832'] | [184484.0, 185928.0] | [1894.0, 1907.0] | [527, 529] |
p03078 | u729008627 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['# solution 3\nimport heapq\nX, Y, Z, K = map(int, input().split())\nA = list(map(int, input().split()))\nB = list(map(int, input().split()))\nC = list(map(int, input().split()))\nA.sort(reverse=True)\nB.sort(reverse=True)\nC.sort(reverse=True)\nQ = []\ns = set()\nheapq.heappush(Q, (-A[0]-B[0]-C[0], 0, 0, 0))\nfor n i... | ['Runtime Error', 'Accepted'] | ['s984238029', 's087264807'] | [3316.0, 4596.0] | [19.0, 772.0] | [788, 794] |
p03078 | u737715061 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['#!/usr/bin/env python\nimport numpy as np\nx, y, z, K = map(int, input().split())\nA = list(map(int, input().split()))\nB = list(map(int, input().split()))\nC = list(map(int, input().split()))\nD = []\nA.sort(reverse=True)\nB.sort(reverse=True)\nC.sort(reverse=True)\nfor i in range(min(K,X)):\n for j in range(min(... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s142372707', 's257838319', 's894990249', 's988230966'] | [14532.0, 3064.0, 54448.0, 17980.0] | [154.0, 18.0, 529.0, 224.0] | [474, 413, 428, 474] |
p03078 | u745561510 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['line = input().split(sep=" ")\nx = int(line[0])\ny = int(line[1])\nz = int(line[2])\nin_k = int(line[3])\n\n\nin_x = sorted(list(map(int,input().split(sep=" "))),reverse=True)\nin_y = sorted(list(map(int,input().split(sep=" "))),reverse=True)\nin_z = sorted(list(map(int,input().split(sep=" "))),reverse=True)\n\nans_a... | ['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s157518802', 's179638994', 's872320441', 's103543196'] | [3064.0, 363208.0, 10724.0, 21836.0] | [17.0, 2126.0, 132.0, 143.0] | [659, 584, 661, 592] |
p03078 | u746849814 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['import heapq\nfrom collections import defaultdict\n\n\nx, y, z, k = map(int, input().split())\nA = sorted(list(map(int, input().split())), reverse=True)\nB = sorted(list(map(int, input().split())), reverse=True)\nC = sorted(list(map(int, input().split())), reverse=True)\n\n\n\nque = []\nheapq.heapify(que)\n\nheapq.he... | ['Runtime Error', 'Accepted'] | ['s839176932', 's482374605'] | [5248.0, 5384.0] | [42.0, 44.0] | [959, 989] |
p03078 | u764600134 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['from itertools import product\n\ndef solve(X, Y, Z, K, A, B, C):\n res_AB = sorted([sum(p) for p in product(A, B)], reverse=True)[:K]\n return sorted([sum(p) for p in product(res_AB, C)], reverse=True)[:K]', '# -*- coding: utf-8 -*-\n"""\nD - Cake 123\nhttps://atcoder.jp/contests/abc123/tasks/abc123_d\nAC\n"""\... | ['Wrong Answer', 'Accepted'] | ['s911723672', 's201243148'] | [3060.0, 9564.0] | [18.0, 879.0] | [207, 848] |
p03078 | u807028974 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['X,Y,Z,K = map(int,input().split())\nA = map(int,input().split())\nB = map(int,input().split())\nC = map(int,input().split())\nAB = []\nfor a in A:\n for b in B:\n AB.append(a+b)\nAB.sort(reverse=True)\nABC = []\nfor i in range(min(K,len(AB))):\n for c in C:\n ABC.append(AB[i]+c)\nABC.sort(reverse=... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s446246444', 's465758212', 's388020726'] | [3316.0, 8412.0, 8708.0] | [20.0, 94.0, 121.0] | [361, 431, 517] |
p03078 | u813102292 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['x,y,z,k = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nc = list(map(int, input().split()))\na = sorted(a)\nb = sorted(b)\nc = sorted(c)\nmemory = []\nai = x-1\nbi = y-1\nci = z-1\np = 10**11\nwhile k>0:\n ps = []\n abc = []\n for dx in range(-100,100):\... | ['Time Limit Exceeded', 'Accepted'] | ['s926569495', 's158826835'] | [170032.0, 186332.0] | [2114.0, 1917.0] | [795, 570] |
p03078 | u816252887 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['x,y,z,k = [int(num) for num in input().split()]\n\na_cake,b_cake,c_cake = [sorted([int(num) for num in input().split()],reverse=True)[:k] for _ in range(3)]\n\n\ndiff_list = list()\nfor cake in [a_cake,b_cake,c_cake]:\n diff_list.extend(list(map(lambda x:cake[0]-x,cake)))\n\ndiff_list.sort()\ncake_max = a_cake... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s222244018', 's311434083', 's375410856', 's546811168', 's825652714', 's854839416'] | [3572.0, 3572.0, 3572.0, 1316676.0, 3188.0, 8692.0] | [23.0, 22.0, 22.0, 2193.0, 20.0, 96.0] | [508, 559, 563, 258, 397, 467] |
p03078 | u820351940 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['x, y, z, K = map(int, input().split())\nK = min(x * y * z, K)\na = sorted(list(map(int, input().split())), reverse=True)\nb = sorted(list(map(int, input().split())), reverse=True)\nc = sorted(list(map(int, input().split())), reverse=True)\n\n\ndef check(p, return_array=False):\n cnt = 0\n results = []\n for ... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s026389550', 's977670008', 's521737106'] | [3724.0, 4704.0, 4852.0] | [2104.0, 47.0, 54.0] | [862, 649, 805] |
p03078 | u845333844 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['x,y,z,k=map(int,input().split())\na=list(map(int,input().split()))\nb=list(map(int,input().split()))\nc=list(map(int,input().split()))\na.sort(reverse=True)\nb.sort(reverse=True)\nc.sort(reverse=True)\n\nl=[]\nfor s in range(a):\n for t in range(b):\n for u in range(c):\n if (s+1)*(t+1)*(u+1)<= k... | ['Runtime Error', 'Accepted'] | ['s616675356', 's375837213'] | [3188.0, 8708.0] | [18.0, 674.0] | [445, 445] |
p03078 | u859897687 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['X,Y,Z,K=map(int,input().split())\na=list(map(int,input().split()))\nb=list(map(int,input().split()))\nc=list(map(int,input().split()))\na.sort(reverse=1)\nb.sort(reverse=1)\nc.sort(reverse=1)\nm=[]\nfor i in range(x):\n for j in range(y):\n for k in range(z):\n if i*j*k>K:\n continue\n m.append(a... | ['Runtime Error', 'Accepted'] | ['s535214842', 's944612224'] | [3188.0, 8708.0] | [19.0, 666.0] | [364, 374] |
p03078 | u860649643 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['x, y, z, N = map(int, input().split())\nA = list(map(int, input().split()))\nB = list(map(int, input().split()))\nC = list(map(int, input().split()))\n\nA.sort(reverse=True)\nB.sort(reverse=True)\nC.sort(reverse=True)\n\nQ = [[0,0,0]]\ni,j,k = Q[0]\nP = [A[i]+B[j]+C[k]]\n\ndef next(P,Q, cnt):\n if len(P)<0 or cnt=... | ['Runtime Error', 'Accepted'] | ['s954094447', 's697811947'] | [46068.0, 8708.0] | [343.0, 103.0] | [796, 523] |
p03078 | u877220920 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['# coding: utf-8\n# Your code here!\n\nX,Y,Z,K = map(int, input().split())\ncakes = [list(map(int, input().split())) for _ in range(3)]\n\ncakes = list(map(lambda x : sorted(x, reverse=True), cakes))\nans = list()\nfor i in range(X):\n for j in range(Y):\n if i*j > K:\n break\n for k in ran... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s070570762', 's749590009', 's388809356'] | [301496.0, 216192.0, 8764.0] | [2120.0, 2117.0, 673.0] | [479, 441, 422] |
p03078 | u886633618 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['import heapq\nX, Y, Z, K = map(int, input().split())\nA_array = list(map(int, input().split()))\nB_array = list(map(int, input().split()))\nC_array = list(map(int, input().split()))\n\nA_array.sort()\nB_array.sort()\nC_array.sort()\n\nuse_array = []\nsum_array = []\n\ncandidate = []\nheapq.heapify(candidate)\n\nmax_s... | ['Runtime Error', 'Accepted'] | ['s802041515', 's287703741'] | [3316.0, 5128.0] | [19.0, 1959.0] | [1152, 1166] |
p03078 | u892487306 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ["from heapq import heappush, heappop\nfrom collections import defaultdict\n\n\ndef main():\n X, Y, Z, K = list(map(int, input().split(' ')))\n A = list(map(int, input().split(' ')))\n B = list(map(int, input().split(' ')))\n C = list(map(int, input().split(' ')))\n A.sort(reverse=True)\n B.sort(rever... | ['Wrong Answer', 'Accepted'] | ['s058168347', 's091600532'] | [4920.0, 5012.0] | [34.0, 35.0] | [1147, 1282] |
p03078 | u894258749 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['from collections import defaultdict\nimport heapq\ninpl = lambda: list(map(int,input().split()))\n\nX, Y, Z, K = inpl()\nA = [ sorted(inpl(), reverse=True) for _ in range(3) ]\nN = [X, Y, Z]\n\nmem = defaultdict(int)\nscore = sum([A[i][0] for i in range(3)])\nmem[(0,0,0)] = 1\ncandidates = []\nheapq._heappush_max(can... | ['Runtime Error', 'Accepted'] | ['s864738128', 's807611096'] | [3564.0, 5280.0] | [23.0, 63.0] | [718, 706] |
p03078 | u897536433 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['k = list(map(int,input().split()))\na = list(map(int,input().split()))\nb = list(map(int,input().split()))\nc = list(map(int,input().split()))\n\na.sort(reverse=True)\nb.sort(reverse=True)\nc.sort(reverse=True)\nA,B,C = a[:k[3]],b[:k[3]],c[:k[3]]\n\nab = sorted(list(ax+bx for ax in A for bx in B), reverse=True)[:k[3]... | ['Wrong Answer', 'Accepted'] | ['s698458141', 's845282740'] | [251412.0, 187700.0] | [2109.0, 1864.0] | [409, 414] |
p03078 | u902151549 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['import math\nxyzk = list(map(int,input().split()))\nabc = [list(map(int,input().split())) for a in range(3)]\nab=[]\nfor a in abc[0]:\n for b in abc[1]:\n ab.append(a+b)\nab.sort()\nab.reverse()\nabc[2].sort()\nabc[2].reverse()\nabc2=[]\nfor c in range(abc[2]):\n for a in range(min([xyzk[3]/(c+1),len(ab)... | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s144320538', 's469474887', 's715085311', 's923352604', 's813942400'] | [55252.0, 55372.0, 301656.0, 55344.0, 8708.0] | [941.0, 770.0, 2122.0, 764.0, 133.0] | [417, 417, 387, 422, 512] |
p03078 | u904804404 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['X,Y,Z,K = list(map(int,input().split()))\n\nA = sorted(list(map(int,input().split())))\nA.reverse()\nB = sorted(list(map(int,input().split())))\nB.reverse()\nC = sorted(list(map(int,input().split())))\nC.reverse()\n\nia,ib,ic = 0,0,0\n_min_ = 10000000000001\nfor ida,a in enumerate(A) :\n for idb,b in enumerate(B):... | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s032562996', 's158468071', 's556503475', 's738194559', 's757928615', 's759043477', 's783839395', 's919123193'] | [1317620.0, 3188.0, 3316.0, 154224.0, 4968.0, 5748.0, 3188.0, 4972.0] | [2189.0, 34.0, 21.0, 2113.0, 39.0, 35.0, 19.0, 39.0] | [697, 714, 712, 886, 974, 1462, 710, 968] |
p03078 | u915355756 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | [' # -*- coding: utf-8 -*-\n \n #input\n import numpy as np\n [X,Y,Z,K] = list(map(int,input().split()))\n A = list(map(int,input().split()))\n B = list(map(int,input().split()))\n C = list(map(int,input().split()))\n \n D = np.zeros(X*Y*Z+5)\n A.sort(reverse=True)\n B.sort(reverse... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s583436328', 's754125820', 's922552350'] | [2940.0, 12420.0, 18036.0] | [17.0, 156.0, 227.0] | [610, 695, 504] |
p03078 | u919734978 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['import heapq\nX,Y,Z,K = map(int,input().split())\nA = list(map(int,input().split()))\nB = list(map(int,input().split()))\nC = list(map(int,input().split()))\nA.sort(reverse=True)\nB.sort(reverse=True)\nC.sort(reverse=True)\nq = []\nheapq.heapify(q)\nheapq.heappush(q,(-(a[0] + b[0] + c[0]),0,0,0))\nfor _ in range(K):\... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s059854746', 's246377009', 's951273975', 's969644079', 's993247794', 's793556103'] | [3316.0, 2940.0, 3316.0, 3064.0, 3064.0, 3828.0] | [19.0, 17.0, 19.0, 18.0, 17.0, 577.0] | [985, 986, 984, 334, 333, 985] |
p03078 | u920963042 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['import itertools\n\nX, Y, Z, K = (int(i) for i in input().split())\nA = [int(i) for i in input().split()] \nB = [int(i) for i in input().split()] \nC = [int(i) for i in input().split()] \n\nA = sorted(A)[::-1]\nB = sorted(B)[::-1]\nC = sorted(C)[::-1]\n\nT = [A[:K], B[:K]]\nscore = []\nfor cand in itertools.product(*... | ['Wrong Answer', 'Accepted'] | ['s172678174', 's476881416'] | [340712.0, 207592.0] | [2124.0, 1948.0] | [484, 431] |
p03078 | u922449550 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['\n\nimport heapq\n\nX, Y, Z, K = map(int, input().split())\nA = list(map(int, input().split()))\nB = list(map(int, input().split()))\nC = list(map(int, input().split()))\n\nA.sort(reverse=True)\nB.sort(reverse=True)\nC.sort(reverse=True)\n\n\nQ =[]\nheapq.heappush(Q, [-(A[0]+B[0]+C[0]), 0, 0, 0])\nadded_idx = set((0,... | ['Wrong Answer', 'Accepted'] | ['s219092093', 's585462714'] | [4340.0, 4976.0] | [36.0, 37.0] | [712, 805] |
p03078 | u922901775 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ["X, Y, Z, K = map(int, input().split())\nA = list(map(int, input().split()))\nB = list(map(int, input().split()))\nC = list(map(int, input().split()))\nA.sort(reverse=True)\nB.sort(reverse=True)\nC.sort(reverse=True)\n\nkouho = set()\ndone = set()\n\n\ndef f(t):\n x, y, z = t\n return A[x] + B[y] + C[z]\n\n\ndef... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s118420475', 's149049624', 's807248534'] | [3188.0, 3952.0, 5444.0] | [19.0, 397.0, 792.0] | [777, 886, 806] |
p03078 | u922952729 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['X,Y,Z,K=[int(i) for i in input().split(" ")]\nA=[int(i) for i in input().split(" ")]\nB=[int(i) for i in input().split(" ")]\nC=[int(i) for i in input().split(" ")]\n\ndelicious=[]\n\nA=sorted(A,reverse=True)\nB=sorted(B,reverse=True)\nC=sorted(C,reverse=True)\nk=int(K**(0.34))+10\nprint(k)\nfor i in range(min(k,len(... | ['Wrong Answer', 'Accepted'] | ['s470694493', 's829220276'] | [4636.0, 160848.0] | [32.0, 1119.0] | [536, 372] |
p03078 | u927022078 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['import heapq\nx,y,z,k = list(map(int, input().split())) \na = sorted(list(map(int, input().split())),reverse=True)\nb = sorted(list(map(int, input().split())),reverse=True)\nc = sorted(list(map(int, input().split())),reverse=True)\n\ndel a[min(k,x):]\ndel b[min(k,y):]\ndel c[min(k,z):]\n\nans = []\nlog = set()\n\ntot... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s614021910', 's656547645', 's858646226', 's797832402'] | [4840.0, 4840.0, 4840.0, 4976.0] | [35.0, 35.0, 36.0, 36.0] | [1007, 955, 1007, 952] |
p03078 | u945418216 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['import bisect\n\nx,y,z,k = map(int, input().split())\naa = sorted(list(map(int, input().split())))[::-1]\nbb = sorted(list(map(int, input().split())))[::-1]\ncc = sorted(list(map(int, input().split())))[::-1]\n\nia,ib,ic = 0,0,0\naa_ = [aa[ia]]\nbb_ = [bb[ib]]\ncc_ = [cc[ic]]\nwhile len(aa_)*len(bb_)*len(cc_) <=k:\n ... | ['Runtime Error', 'Accepted'] | ['s112472724', 's486609271'] | [3444.0, 161768.0] | [25.0, 1756.0] | [688, 325] |
p03078 | u952708174 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ["def d_cake_123_priority_queue(X, Y, Z, K, A, B, C):\n \n import heapq\n \n a, b, c = sorted(A, reverse=True), sorted(B, reverse=True), sorted(C, reverse=True)\n\n def evaluation(x, y, z):\n \n return (-(a[x] + b[y] + c[z]), x, y, z)\n\n \n q = []\n heapq.heappush(q, evaluation(0,... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s317409924', 's932904503', 's949579237'] | [3188.0, 763260.0, 537456.0] | [21.0, 2151.0, 1641.0] | [1281, 1088, 1096] |
p03078 | u957872856 | 2,000 | 1,048,576 | The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called _deliciousness_ , as follows: * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X. * The del... | ['x, y, z, k = map(int,input().split())\nA = list(map(int,input().split()))\nB = list(map(int,input().split()))\nC = list(map(int,input().split()))\nD = []\nE = []\nfor i in range(x):\n for j in range(y):\n D.append(A[i]+B[j])\nD.sort()\nfor i in range(z):\n for j in range(1, k+1):\n E.append(C[i]+D[-j])\nprint... | ['Runtime Error', 'Accepted'] | ['s415550602', 's072442275'] | [245356.0, 186136.0] | [2117.0, 1864.0] | [347, 418] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.