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 |
|---|---|---|---|---|---|---|---|---|---|---|
p03076 | u945761460 | 2,000 | 1,048,576 | The restaurant AtCoder serves the following five dishes: * ABC Don (rice bowl): takes A minutes to serve. * ARC Curry: takes B minutes to serve. * AGC Pasta: takes C minutes to serve. * APC Ramen: takes D minutes to serve. * ATC Hanbagu (hamburger patty): takes E minutes to serve. Here, the time to serve a ... | ['a=[]\nb=[]\nori=[]\nans=0\nfor i in range(5):\n c=int(input())\n ori.append(c)\n a.append((c//10+1)*10)\n \n if c%10==0:\n b.append(100)\n else:\n b.append(c%10)\na.pop(b.index(min(b)))\nprint(ori[b.index(min(b))]+a.sum())', 'a=[]\nb=[]\nori=[]\nans=0\nfor i in range(5):\n c=int(input())\n ori.append(c)... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s309142854', 's976200397', 's416138741'] | [9088.0, 9132.0, 9148.0] | [21.0, 29.0, 28.0] | [220, 219, 259] |
p03076 | u947327691 | 2,000 | 1,048,576 | The restaurant AtCoder serves the following five dishes: * ABC Don (rice bowl): takes A minutes to serve. * ARC Curry: takes B minutes to serve. * AGC Pasta: takes C minutes to serve. * APC Ramen: takes D minutes to serve. * ATC Hanbagu (hamburger patty): takes E minutes to serve. Here, the time to serve a ... | ['d=[]\n\nfor i in range(5):\n s=int(input())\n d.append((s,s+(10-s%10),10-s%10))\n\nd.sort(key=lambda d:d[2])\nresult=0\nresult=sum(d[i][1] for i in range(len(d)-1)) + d[-1][0]\n\nprint(result)\n\n', 'd=[]\n\nfor i in range(5):\n s=int(input())\n if s%10 == 0:\n d.append((s,s,s%10))\n else:\n ... | ['Wrong Answer', 'Accepted'] | ['s071850537', 's842857874'] | [3060.0, 3060.0] | [17.0, 18.0] | [190, 251] |
p03076 | u952467214 | 2,000 | 1,048,576 | The restaurant AtCoder serves the following five dishes: * ABC Don (rice bowl): takes A minutes to serve. * ARC Curry: takes B minutes to serve. * AGC Pasta: takes C minutes to serve. * APC Ramen: takes D minutes to serve. * ATC Hanbagu (hamburger patty): takes E minutes to serve. Here, the time to serve a ... | ['lst = [int(input()) for i in range(5)]\n\nlst = sorted(lst, key =lambda x: 10 if x%10==0 else x%10, reverse = 1)\n\nprint(lst)\nans = 0\nfor l in lst[:4]:\n if l%10 == 0:\n ans += l\n else:\n ans += l//10*10 + 10\nans += lst[4]\nprint(ans)', 'lst = [int(input()) for i in range(5)]\n\nlst = sorted(... | ['Wrong Answer', 'Accepted'] | ['s919400390', 's634696980'] | [3060.0, 3060.0] | [17.0, 17.0] | [247, 235] |
p03076 | u952656646 | 2,000 | 1,048,576 | The restaurant AtCoder serves the following five dishes: * ABC Don (rice bowl): takes A minutes to serve. * ARC Curry: takes B minutes to serve. * AGC Pasta: takes C minutes to serve. * APC Ramen: takes D minutes to serve. * ATC Hanbagu (hamburger patty): takes E minutes to serve. Here, the time to serve a ... | ["A= [int(input()) for _ in range(5)]\nrA = list(map(lambda x:x%10, A))\nres = float('inf')\nfor i, r in enumerate(rA):\n if res>r>0:\n idx = i\n res = r\nans = A.pop(idx)\nrA.pop(idx)\ntA = [A[i]+10-rA[i] for i in range(len(A))]\nprint(sum(tA)+ans)", "from math import ceil\nA= [int(input()) for _ in r... | ['Runtime Error', 'Accepted'] | ['s576650145', 's009272557'] | [3064.0, 3064.0] | [17.0, 17.0] | [254, 275] |
p03076 | u957722693 | 2,000 | 1,048,576 | The restaurant AtCoder serves the following five dishes: * ABC Don (rice bowl): takes A minutes to serve. * ARC Curry: takes B minutes to serve. * AGC Pasta: takes C minutes to serve. * APC Ramen: takes D minutes to serve. * ATC Hanbagu (hamburger patty): takes E minutes to serve. Here, the time to serve a ... | ['a=int(input())\nb=int(input())\nc=int(input())\nd=int(input())\ne=int(input())\nl=[a,b,c,d,e]\nlastindex=0\ntenmod=[a%10,b%10,c%10,d%10,e%10]\nlastamari=min(tenmod)\nlastban=tenmod.index(lastamari)\nalltime=0\nfor i in range(5):\n if i==lastban:\n alltime+=l[i]\n elif i!=lastban:\n alltime+=int(l[i]/10)*10+10... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s175915882', 's187652017', 's886455157', 's818332592'] | [3064.0, 3064.0, 3064.0, 3064.0] | [17.0, 17.0, 18.0, 17.0] | [318, 359, 416, 462] |
p03076 | u957872856 | 2,000 | 1,048,576 | The restaurant AtCoder serves the following five dishes: * ABC Don (rice bowl): takes A minutes to serve. * ARC Curry: takes B minutes to serve. * AGC Pasta: takes C minutes to serve. * APC Ramen: takes D minutes to serve. * ATC Hanbagu (hamburger patty): takes E minutes to serve. Here, the time to serve a ... | ['a = []\nfor i in range(5):\n num = input()\n a.append(num)\nif int(a[0][2]) <= int(a[1][2]) and int(a[0][2]) <= int(a[2][2]) and int(a[0][2]) <= int(a[3][2]) and int(a[0][2]) <= int(a[4][2]):\n b = int(a[1]) + 10-int(a[1][2]) + int(a[2]) + 10-int(a[2][2]) + int(a[3]) + 10-int(a[3][2]) + int(a[4]) + 10-int(a[4][2])... | ['Runtime Error', 'Accepted'] | ['s375494908', 's979533535'] | [3320.0, 3060.0] | [18.0, 18.0] | [1460, 154] |
p03076 | u958506960 | 2,000 | 1,048,576 | The restaurant AtCoder serves the following five dishes: * ABC Don (rice bowl): takes A minutes to serve. * ARC Curry: takes B minutes to serve. * AGC Pasta: takes C minutes to serve. * APC Ramen: takes D minutes to serve. * ATC Hanbagu (hamburger patty): takes E minutes to serve. Here, the time to serve a ... | ['l = [int(input()) for _ in range(5)]\nm = [(x+9)//10*10 for x in l]\nd = max([x - y for (x, y) in zip(l, m)])\nprint(sum(m)-d)', 'l = [int(input()) for _ in range(5)]\nm = [(x+9)//10*10 for x in l]\nd = [x - y for (x, y) in zip(m, l)]\nprint(sum(m)-max(d))'] | ['Wrong Answer', 'Accepted'] | ['s562748656', 's029445510'] | [9092.0, 9072.0] | [30.0, 29.0] | [123, 123] |
p03076 | u959421160 | 2,000 | 1,048,576 | The restaurant AtCoder serves the following five dishes: * ABC Don (rice bowl): takes A minutes to serve. * ARC Curry: takes B minutes to serve. * AGC Pasta: takes C minutes to serve. * APC Ramen: takes D minutes to serve. * ATC Hanbagu (hamburger patty): takes E minutes to serve. Here, the time to serve a ... | ['time = 0\nfor i in range(5):\n time += (int(int(input()) / 10) + 1) * 10\nprint(time)', 'time = 0\nm = 10\nfor i in range(5):\n i2 = input()\n if m > int(i2[-1]) and int(i2[-1]) != 0:\n m = int(i2[-1])\n time += ((int(int(i2) / 10) + 1) * 10) if int(i2) % 10 != 0 else int(i2) \ntime = time - 10 + m... | ['Wrong Answer', 'Accepted'] | ['s313592029', 's381767914'] | [2940.0, 3060.0] | [17.0, 17.0] | [85, 231] |
p03076 | u965075144 | 2,000 | 1,048,576 | The restaurant AtCoder serves the following five dishes: * ABC Don (rice bowl): takes A minutes to serve. * ARC Curry: takes B minutes to serve. * AGC Pasta: takes C minutes to serve. * APC Ramen: takes D minutes to serve. * ATC Hanbagu (hamburger patty): takes E minutes to serve. Here, the time to serve a ... | ['a = [int(input()) for i in range(5)]\n\nsum = 0\nrest = 10\n\nfor i in a:\n\tif i % 10 < rest:\n\t\tsum = ((sum - 1) // 10 + 1) * 10 if sum != 0 else 0\n\t\tsum += i\n\telse:\n\t\tsum += ((i - 1) // 10 + 1) * 10\n\t\t\nprint(sum)', 'a = [int(input()) for i in range(5)]\n\nb = [i % 10 if i % 10 != 0 else 10 for i in a... | ['Wrong Answer', 'Accepted'] | ['s328328832', 's985784884'] | [3060.0, 3060.0] | [18.0, 17.0] | [207, 180] |
p03076 | u969708690 | 2,000 | 1,048,576 | The restaurant AtCoder serves the following five dishes: * ABC Don (rice bowl): takes A minutes to serve. * ARC Curry: takes B minutes to serve. * AGC Pasta: takes C minutes to serve. * APC Ramen: takes D minutes to serve. * ATC Hanbagu (hamburger patty): takes E minutes to serve. Here, the time to serve a ... | ['def t(n):\n if n%10==0:\n return n\n else:\n return ((n//10)+1)*10\ndef k(n):\n if n%10==0:\n return 10\n else:\n return 10-(n%10)\na=int(input())\nb=int(input())\nc=int(input())\nd=int(input())\ne=int(input())\nL=[k(a),k(b),k(c),k(d),k(e)]\nprint(t(a)+t(b)+t(c)+t(d)+t(e)-max(L))', 'def t(n):\n if n%... | ['Wrong Answer', 'Accepted'] | ['s191473692', 's884045333'] | [9104.0, 9148.0] | [28.0, 30.0] | [280, 279] |
p03076 | u969850098 | 2,000 | 1,048,576 | The restaurant AtCoder serves the following five dishes: * ABC Don (rice bowl): takes A minutes to serve. * ARC Curry: takes B minutes to serve. * AGC Pasta: takes C minutes to serve. * APC Ramen: takes D minutes to serve. * ATC Hanbagu (hamburger patty): takes E minutes to serve. Here, the time to serve a ... | ['inp = [int(input()) for _ in range(5)]\nrem = [p % 10 if p % 10 != 0 else 10 for p in inp]\nidx = rem.index(min(rem))\nmin_rem = inp[idx]\nres = 0\ninp.remove(min_rem)\nfor a in inp:\n print(res)\n if a % 10 == 0:\n res += a\n else:\n res += a + (10 - a % 10)\n\nprint(res + min_rem)', 'inp = [i... | ['Wrong Answer', 'Accepted'] | ['s295084359', 's875087513'] | [3064.0, 3064.0] | [18.0, 18.0] | [293, 278] |
p03076 | u970107703 | 2,000 | 1,048,576 | The restaurant AtCoder serves the following five dishes: * ABC Don (rice bowl): takes A minutes to serve. * ARC Curry: takes B minutes to serve. * AGC Pasta: takes C minutes to serve. * APC Ramen: takes D minutes to serve. * ATC Hanbagu (hamburger patty): takes E minutes to serve. Here, the time to serve a ... | ['AE = []\nfor i in range(5):\n AE.append(int(input()))\n\nans = 0\nmini = []\nfor i in AE:\n ans += (i//10 + 1)*10\n mini.append(i%10)\nprint(ans + min(mini) - 10)\n ', 'AE = []\nfor i in range(5):\n AE.append(int(input()))\n\nans = 0\nmini = []\nfor i in AE:\n if(i%10 == 0):\n ans += i\n e... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s194313388', 's251242153', 's214333488'] | [2940.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0] | [167, 259, 257] |
p03076 | u970449052 | 2,000 | 1,048,576 | The restaurant AtCoder serves the following five dishes: * ABC Don (rice bowl): takes A minutes to serve. * ARC Curry: takes B minutes to serve. * AGC Pasta: takes C minutes to serve. * APC Ramen: takes D minutes to serve. * ATC Hanbagu (hamburger patty): takes E minutes to serve. Here, the time to serve a ... | ['a = int(input())\nb = int(input())\nc = int(input())\nd = int(input())\ne = int(input())\nl = []\nl = l + [a % 10]\nl = l + [b % 10]\nl = l + [c % 10]\nl = l + [d % 10]\nl = l + [e % 10]\nm = min(l)\nma = 10 - m\nls =[]\nls = ls + [-(-a // 10) * 10]\nls = ls + [-(-b // 10) * 10]\nls = ls + [-(-c // 10) * 10]\nls = ls... | ['Wrong Answer', 'Accepted'] | ['s901980142', 's108500020'] | [3064.0, 3064.0] | [17.0, 17.0] | [376, 473] |
p03076 | u970738863 | 2,000 | 1,048,576 | The restaurant AtCoder serves the following five dishes: * ABC Don (rice bowl): takes A minutes to serve. * ARC Curry: takes B minutes to serve. * AGC Pasta: takes C minutes to serve. * APC Ramen: takes D minutes to serve. * ATC Hanbagu (hamburger patty): takes E minutes to serve. Here, the time to serve a ... | ['A = int(input())\nB = int(input())\nC = int(input())\nD = int(input())\nE = int(input())\n\nl = [A,B,C,D,E]\nsub = 10 - min([i%10 for i in l if i%10!==0])\nM = []\nfor i in l:\n if i%10 == 0:\n M.append(i)\n else:\n M.append(((i//10)+1)*10)\nprint(sum(M)-sub)', 'A = int(input())\nB = int(input())\nC = int(inp... | ['Runtime Error', 'Accepted'] | ['s918140198', 's813038494'] | [2940.0, 3064.0] | [18.0, 18.0] | [253, 295] |
p03076 | u971811058 | 2,000 | 1,048,576 | The restaurant AtCoder serves the following five dishes: * ABC Don (rice bowl): takes A minutes to serve. * ARC Curry: takes B minutes to serve. * AGC Pasta: takes C minutes to serve. * APC Ramen: takes D minutes to serve. * ATC Hanbagu (hamburger patty): takes E minutes to serve. Here, the time to serve a ... | ['#include<bits/stdc++.h>\n// Begin Header {{{\nusing namespace std;\nusing ll = long long;\nusing P = pair<ll, ll>;\nusing Graph = vector<vector<ll>>;\n#define rep(i,n) for(ll i=0; i<n; i++)\n#define loop(i, j, n) for(ll i=j; i<n; i++)\n#define all(x) (x).begin(), (x).end()\nconstexpr int INF = 0x3f3f3f3f;\nconst lon... | ['Runtime Error', 'Accepted'] | ['s305980805', 's648308765'] | [2940.0, 3064.0] | [17.0, 18.0] | [767, 375] |
p03076 | u979362546 | 2,000 | 1,048,576 | The restaurant AtCoder serves the following five dishes: * ABC Don (rice bowl): takes A minutes to serve. * ARC Curry: takes B minutes to serve. * AGC Pasta: takes C minutes to serve. * APC Ramen: takes D minutes to serve. * ATC Hanbagu (hamburger patty): takes E minutes to serve. Here, the time to serve a ... | ['s = [int(input()) for i in range(5)]\nlast = min((k-1)%10 for k in s)\nm = sum(s)//10\nans = 10*(m+1)-10+last', 's = [int(input()) for i in range(5)]\nlast = min((k-1)%10 for k in s)\nm =(sum(s)-last)//10\nans = 10*(m+1)+last', 's = [int(input()) for i in range(5)]\nlast = min((k-1)%10 for k in s)\nm = sum(s)//10\nan... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s244864938', 's416107590', 's422995317', 's098823280'] | [2940.0, 2940.0, 2940.0, 3060.0] | [19.0, 17.0, 17.0, 18.0] | [106, 109, 108, 231] |
p03076 | u981767024 | 2,000 | 1,048,576 | The restaurant AtCoder serves the following five dishes: * ABC Don (rice bowl): takes A minutes to serve. * ARC Curry: takes B minutes to serve. * AGC Pasta: takes C minutes to serve. * APC Ramen: takes D minutes to serve. * ATC Hanbagu (hamburger patty): takes E minutes to serve. Here, the time to serve a ... | ['# 2019/04/06\n\n\n# Input\nsum = 0\ncl = list()\nhmin = 99\nminidx = -1\n\nfor i in range(5):\n wt = int(input())\n t = int((wt + 9) / 10) * 10\n sum += t\n cl.append(wt)\n wh = wt % 10\n if wh > 0 and wh < hmin:\n hmin = wt % 10\n minidx = i\n\nprint(hmin)\nif hmin < 99:\n sum = su... | ['Wrong Answer', 'Accepted'] | ['s892614152', 's426153333'] | [3064.0, 3060.0] | [17.0, 17.0] | [368, 356] |
p03076 | u987637902 | 2,000 | 1,048,576 | The restaurant AtCoder serves the following five dishes: * ABC Don (rice bowl): takes A minutes to serve. * ARC Curry: takes B minutes to serve. * AGC Pasta: takes C minutes to serve. * APC Ramen: takes D minutes to serve. * ATC Hanbagu (hamburger patty): takes E minutes to serve. Here, the time to serve a ... | ['# ABC123\n# Five Dishes\n#B=A R=B G=C P=D T=E\nRyori = [input() for _ in range(5)]\nO = []\nt = 0\nfor i in Ryori:\n print(i)\n if int(i[-1]) == 0:\n x = Ryori.pop(Ryori.index(i))\n O.append(x)\nRyori = sorted(Ryori,key=lambda x: x[-1], reverse=True)\n\nfor i in range(len(Ryori)-1):\n for j in ... | ['Wrong Answer', 'Accepted'] | ['s588001894', 's045558834'] | [9068.0, 9104.0] | [30.0, 28.0] | [450, 437] |
p03076 | u989348352 | 2,000 | 1,048,576 | The restaurant AtCoder serves the following five dishes: * ABC Don (rice bowl): takes A minutes to serve. * ARC Curry: takes B minutes to serve. * AGC Pasta: takes C minutes to serve. * APC Ramen: takes D minutes to serve. * ATC Hanbagu (hamburger patty): takes E minutes to serve. Here, the time to serve a ... | ['import math\n\na = int(input())\nb = int(input())\nc = int(input())\nd = int(input())\ne = int(input())\nx = []\nif a % 10 != 0:\n x.append(a % 10)\n\nif b % 10 != 0:\n x.append(b % 10)\n\nif c % 10 != 0:\n x.append(c % 10)\n\nif d % 10 != 0:\n x.append(d % 10)\n\nif e % 10 != 0:\n x.append(e % 10)\n\nprint... | ['Runtime Error', 'Accepted'] | ['s764048792', 's465223350'] | [3064.0, 12520.0] | [17.0, 149.0] | [414, 537] |
p03076 | u993435350 | 2,000 | 1,048,576 | The restaurant AtCoder serves the following five dishes: * ABC Don (rice bowl): takes A minutes to serve. * ARC Curry: takes B minutes to serve. * AGC Pasta: takes C minutes to serve. * APC Ramen: takes D minutes to serve. * ATC Hanbagu (hamburger patty): takes E minutes to serve. Here, the time to serve a ... | ['L = [int(input()) for i in range(5)]\nprint(L)\n\nLL = {}\n\nfor i in range(len(L)):\n\tI = str((L[i]-1))[-1]\n\tI = int(I)\n\tLL[i] = I\n\nkey = [k for k,v in LL.items() if v == min(LL.values())][0]\n\nmin = L[key]\nL[key] = 0\n\nfor i in range(0,5):\n\tdigit_one = str(L[i])[-1]\n\tif digit_one != "0":\n\t\tL[i] += ... | ['Wrong Answer', 'Accepted'] | ['s238686911', 's719499736'] | [3064.0, 3064.0] | [17.0, 18.0] | [334, 325] |
p03076 | u994521204 | 2,000 | 1,048,576 | The restaurant AtCoder serves the following five dishes: * ABC Don (rice bowl): takes A minutes to serve. * ARC Curry: takes B minutes to serve. * AGC Pasta: takes C minutes to serve. * APC Ramen: takes D minutes to serve. * ATC Hanbagu (hamburger patty): takes E minutes to serve. Here, the time to serve a ... | ['A=int(input())\na=A%10\nB=int(input())\nb=B%10\nC=int(input())\nc=C%10\nD=int(input())\nd=D%10\nE=int(input())\ne=E%10\nif a=b=c=d=e=0:\n print(A-a+B-b+C-c+D-d+E-e+4*10-10*[a,b,c,d,e].count(0))\nelse:\n print(A-a+B-b+C-c+D-d+E-e+4*10+min(set([a,b,c,d,e])-set([0]))-10*[a,b,c,d,e].count(0))', 'a=int(input())\np=a%10\... | ['Runtime Error', 'Accepted'] | ['s870316916', 's449020036'] | [2940.0, 3064.0] | [17.0, 17.0] | [278, 378] |
p03076 | u996434204 | 2,000 | 1,048,576 | The restaurant AtCoder serves the following five dishes: * ABC Don (rice bowl): takes A minutes to serve. * ARC Curry: takes B minutes to serve. * AGC Pasta: takes C minutes to serve. * APC Ramen: takes D minutes to serve. * ATC Hanbagu (hamburger patty): takes E minutes to serve. Here, the time to serve a ... | ['a=int(input())\nb=int(input())\nc=int(input())\nd=int(input())\ne=int(input())\n\ndish = [a,b,c,d,e]\nresult=0\n\nmx=-1\n\nfor dd in dish:\n for i in range(1,10):\n if (dd+i) % 10 == 0:\n tmp=i\n break\n if tmp >= mx:\n mx = tmp\n buf=dd\n\ndish.remove(buf)\n\nfor i in... | ['Runtime Error', 'Accepted'] | ['s371551234', 's688412896'] | [3064.0, 3064.0] | [17.0, 17.0] | [435, 436] |
p03076 | u997641430 | 2,000 | 1,048,576 | The restaurant AtCoder serves the following five dishes: * ABC Don (rice bowl): takes A minutes to serve. * ARC Curry: takes B minutes to serve. * AGC Pasta: takes C minutes to serve. * APC Ramen: takes D minutes to serve. * ATC Hanbagu (hamburger patty): takes E minutes to serve. Here, the time to serve a ... | ['A = [int(input()) for i in range(5)]\nB = [10 - a % 10 for a in A]\nprint(sum(A) + sum(B) - max(B))\n', 'A = [int(input()) for i in range(5)]\n# A = [101, 86, 119, 108, 57]\n# A = [29, 20, 7, 35, 120]\n# A = [123, 123, 123, 123, 123]\nB = [(10-a % 10) % 10 for a in A]\nC = [-(-a//10)*10 for a in A]\nprint(sum(C)-max(... | ['Wrong Answer', 'Accepted'] | ['s574600167', 's248425029'] | [2940.0, 3064.0] | [17.0, 17.0] | [98, 211] |
p03078 | u016128476 | 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... | ['# input\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\nimport heapq\n\n\na.sort(reverse=True)\nb.sort(reverse=True)\nc.sort(reverse=True)\n\nindex_hstr = []\ndeliciouses = []\n# priority queue\npq ... | ['Runtime Error', 'Accepted'] | ['s598254577', 's237013555'] | [4212.0, 4724.0] | [672.0, 827.0] | [902, 973] |
p03078 | u021548497 | 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(int(x) for x in input().split())\nb = list(int(x) for x in input().split())\nc = list(int(x) for x in input().split())\n\na.sort(reverse=True)\nb.sort(reverse=True)\nc.sort(reverse=True)\n\nab_1 = []\nfor i in range(x):\n for j in range(y):\n ab.append(a[i]*... | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s480972116', 's672441361', 's783388466', 's979782919'] | [3188.0, 194080.0, 223924.0, 194072.0] | [19.0, 1284.0, 2119.0, 1221.0] | [503, 570, 489, 594] |
p03078 | u023958502 | 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()))\nsam = []\na.sort(reverse=True)\nb.sort(reverse=True)\nc.sort(reverse=True)\nab = a[0] + b[0]\nac = a[0] + c[0]\nbc = b[0] + c[0]\nsam.append(a[0] + b[0] + c[0])\nif len(a) > ... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s170932309', 's583436199', 's874542440'] | [3188.0, 3064.0, 4976.0] | [19.0, 18.0, 726.0] | [614, 776, 815] |
p03078 | u025235255 | 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\nimport heapq\n\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()))\nA.sort(reverse=True)\nB.sort(reverse=True)\nC.sort(reverse=True)\n\nq = [[(A[0]+B[0]+C[0])*(-1),0,0,0]]\nheapq.he... | ['Runtime Error', 'Accepted'] | ['s261414275', 's406435810'] | [4724.0, 4724.0] | [882.0, 861.0] | [906, 888] |
p03078 | u026102659 | 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())\nLA = list(map(int, input().split()))\nLB = list(map(int, input().split()))\nLC = list(map(int, input().split()))\nLAB = []\nL = []\n\nfor i in range(x):\n for j in range(y):\n LAB.append(LA[i]+LB[j])\nLAB.sort(reverse=True)\nLAB = LAB[:k]\n\nfor i in range(k):\n fo... | ['Runtime Error', 'Accepted'] | ['s418942327', 's268235108'] | [165480.0, 4956.0] | [2113.0, 468.0] | [408, 783] |
p03078 | u038450469 | 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 = [A[i]+B[j]+C[k] for k in range(Z) for j in range(Y) for i in range(X) if (i+1)*(j+1)*(k+1) <... | ['Wrong Answer', 'Accepted'] | ['s984469143', 's882650620'] | [6252.0, 60092.0] | [2104.0, 1621.0] | [391, 444] |
p03078 | u056277698 | 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 -*-\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\nabc = []\n\nfor i, _a in enumerate(a):\n for j, _b in enumerate(b):\n... | ['Runtime Error', 'Accepted'] | ['s821633543', 's213757381'] | [8712.0, 4976.0] | [104.0, 36.0] | [539, 809] |
p03078 | u059436995 | 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\nfrom collections import defaultdict\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)\nq =[]\nans = []\nsc = defaultdic... | ['Runtime Error', 'Accepted'] | ['s675917797', 's860625955'] | [3564.0, 5168.0] | [27.0, 41.0] | [898, 874] |
p03078 | u060938295 | 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"""\nCreated on Wed Apr 10 22:30:07 2019\n\n@author: Yamazaki Kenichi\n"""\nimport heapq\nimport random\n\nX,Y,Z,K = 1000,1000,1000,3000\nA = random.sample(range(10**9),1000)\nB = random.sample(range(10**9),1000)\nC = random.sample(range(10**9),1000)\n\n#X,Y,Z,K = map(int,input().split())\n#A... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s881641207', 's915821756', 's530810721'] | [13168.0, 12780.0, 12784.0] | [91.0, 84.0, 84.0] | [1096, 1096, 1093] |
p03078 | u062459048 | 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)\nB = sorted(B, reverse = True)\nC = sorted(C, reverse = True)\n\nans = []\n\nfor i in range(min(K,X)):\n for j in range(min(K//i,Y)):\n ... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s025667920', 's284053771', 's324928661', 's140421273'] | [3316.0, 3064.0, 50664.0, 9564.0] | [20.0, 17.0, 289.0, 93.0] | [451, 440, 473, 455] |
p03078 | u065446124 | 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+=[a[i]+b[j]]\nab.sort(key=lambda x: -x)\nc.sort(key=lambda x: -x)\nans=[]\nct=[0]\nansc=[ab[0]+c[0]]\nwhile (len(ans... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s186544909', 's211502496', 's752745796'] | [99796.0, 100160.0, 99780.0] | [1386.0, 1361.0, 1033.0] | [585, 605, 543] |
p03078 | u067729694 | 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 = list(map(int, input().split()))\nB_list = list(map(int, input().split()))\nC_list = list(map(int, input().split()))\n\nimport itertools\nval_list = []\n\na_max = min(len(A_list), K)\nb_max = min(len(B_list), K)\nc_max = min(len(C_list), K)\n\nA_list = sorted(A_list, ... | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s468538677', 's809883858', 's890577854', 's875741992'] | [5996.0, 3188.0, 5996.0, 9568.0] | [2108.0, 2104.0, 2104.0, 129.0] | [683, 680, 575, 863] |
p03078 | u068112689 | 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 operator\n\ndi = {}\n\nfor i, (a, b, c) in enumerate(zip(a_, b_, c_)):\n di['a{}'.format(i)] = a\n di['b{}'.format(i)] = b\n di['c{}'.format(i)] = c\n\nif len(di) > 3000:\n di = sorted(di.items(), reverse=True, key=operator.itemgetter(1))\n di = di[:3000]\n\n\na_li = []\nb_li = []\nc_li = []\n\n... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s081273317', 's637067518', 's214676877'] | [3064.0, 8736.0, 4596.0] | [18.0, 103.0, 840.0] | [767, 603, 796] |
p03078 | u073711480 | 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 = [int(i) for i in input().split()]\nb = [int(i) for i in input().split()]\nc = [int(i) for i in input().split()]\n\nyam = []\nfor l in range(x):\n for m in range(y):\n for n in range(z):\n yam.append(a[l]+b[m]+c[n])\nyam.sort(re... | ['Wrong Answer', 'Accepted'] | ['s139486650', 's216297268'] | [357848.0, 3700.0] | [2127.0, 809.0] | [476, 645] |
p03078 | u075595666 | 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\nread = sys.stdin.buffer.read\nreadline = sys.stdin.buffer.readline\nx,y,z,k = map(int,readline().split())\na = [int(i) for i in readline().split()]\nb = [int(i) for i in readline().split()]\nc = [int(i) for i in readline().split()]\nfrom bisect import bisect_left,insort\na.sort(reverse=True)\nb.sort(rever... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s403271170', 's605625891', 's233745951'] | [3936.0, 4340.0, 5044.0] | [2104.0, 34.0, 35.0] | [721, 780, 826] |
p03078 | u090436701 | 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\na.sort()\na.reverse()\nb.sort()\nb.reverse()\nc.sort()\nc.reverse()\n\n\nmemo = {}\n\ndef next_step(i,j,k):\n cand = []\n for dx, dy, dz in ((1,0,0),\n ... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s471907092', 's879848138', 's213422942'] | [3956.0, 2940.0, 5032.0] | [101.0, 17.0, 41.0] | [1578, 1361, 660] |
p03078 | u091051505 | 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()]\nmax_num = a[-1] + b[-1] + c[-1]\na_m = [aa - a[-1] for aa in a[:-1]]\nb_m = [bb - b[-1] for bb in b[:-1]]\nc_m = [cc - c[-1] for cc in c[:-1]]\nd = a_m + b_m + c... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s039365482', 's952357535', 's492359560'] | [3572.0, 54452.0, 156460.0] | [22.0, 605.0, 1985.0] | [408, 464, 577] |
p03078 | u093041722 | 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\nfrom heapq import *\n\nX,Y,Z,K,*f = map(int, open(0).read().split())\nA = f[:X]\nB = f[X:X+Y]\nC = f[X+Y:]\nA.sort(reverse=True)\nB.sort(reverse=True)\nC.sort(reverse=True)\nAB = [sum(x) * (-1) for x in product(A,B)]\nheapify(AB)\nAB_picked = []\nfor i in range(K):\n AB_picked.append... | ['Runtime Error', 'Accepted'] | ['s350292330', 's364666948'] | [231100.0, 231268.0] | [1053.0, 1017.0] | [435, 474] |
p03078 | u095426154 | 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 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()))\n\nA.sort(reverse=True)\nB.sort(reverse=True)\nC.sort(reverse=True)\n\nun_used=[[[True for i in range(Z)] for j in range(Y)] for k in range(X)]\n\nhea... | ['Runtime Error', 'Accepted'] | ['s791881763', 's093873410'] | [436212.0, 4468.0] | [2136.0, 791.0] | [959, 985] |
p03078 | u098679988 | 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 = map(int,input().split())\na = list(map(int,input().split()))\nb = list(map(int,input().split()))\nc = list(map(int,input().split()))\n\nab = sorted(a+b for a in a for b in b)[:-k-1:-1]\nabc = sorted(ab+c for ab in ab[:k] for c in c)[:-k-1:-1]\n\nprint(*abc, sep="\\n... | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s160560150', 's307223137', 's596060113', 's797768370'] | [3188.0, 189848.0, 56504.0, 160456.0] | [18.0, 2118.0, 724.0, 1838.0] | [308, 353, 311, 336] |
p03078 | u102278909 | 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 sys\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\nbimi = []\nfor a in range(X):\n for b in range(Y):\n bimi.append(A[a] + B[b])\n\nb... | ['Wrong Answer', 'Accepted'] | ['s410212447', 's178852725'] | [350524.0, 8712.0] | [2115.0, 119.0] | [492, 667] |
p03078 | u102461423 | 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())\n\n\nAB = [x+y for x,y in itertools.product(A,B)]\nAB.sort(reverse = True)\nAB = AB[:3000]\n\nABC = [x+y for x,y in itertools.product(AB,C)]\nABC.sort(reverse=True)\n\nfor i in range(K):\n ... | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s071345796', 's203713715', 's392346865', 's519610571', 's550036364', 's693314355', 's851752125', 's889233451', 's339657232'] | [3188.0, 4340.0, 3064.0, 3064.0, 3064.0, 3064.0, 3064.0, 5104.0, 5104.0] | [18.0, 33.0, 17.0, 18.0, 17.0, 17.0, 17.0, 36.0, 36.0] | [320, 662, 786, 651, 619, 624, 591, 804, 811] |
p03078 | u109487406 | 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\nimport heapq\nimport copy\n\ndef inv(l):\n return list(map(lambda x: x*-1, l))\n\ndef solve(A,B,C, K):\n A,B,C = inv(A), inv(B), inv(C)\n A = sorted(A)\n B = sorted(B)\n C = sorted(C)\n ind = set([(0,0,0)])\n\n h = [(A[0]+ B[0]+ C[0], (0,0,0))]\n res = []\n\n for _ in rang... | ['Wrong Answer', 'Accepted'] | ['s544362364', 's313438121'] | [71976.0, 5680.0] | [2104.0, 92.0] | [1079, 1060] |
p03078 | u112318601 | 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 = list(map(int, input().split()))\nA = list(map(int, input().split()))\nB = list(map(int, input().split()))\nC = list(map(int, input().split()))\nA = reversed(sorted(A))\nB = reversed(sorted(B))\nC = reversed(sorted(C))\nabc_list=[]\n\nfor i in A:\n for j in B:\n for k in C:\n if i * ... | ['Runtime Error', 'Accepted'] | ['s548008498', 's935289155'] | [3188.0, 10000.0] | [20.0, 676.0] | [476, 544] |
p03078 | u120691615 | 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\nx = []\nfor i in range(100):\n for j in range(100):\n for k in range(100):\n x.appe... | ['Runtime Error', 'Accepted'] | ['s633684911', 's431845116'] | [54628.0, 8708.0] | [951.0, 119.0] | [389, 519] |
p03078 | u129836004 | 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)\nab =[]\nabc = []\nfor i in a:\n for j in b:\n ab.append(i+j)\nab.sort(reverse = True)\n... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s203094677', 's444394543', 's607017230', 's686653550', 's274760992'] | [54448.0, 54432.0, 54448.0, 54448.0, 3828.0] | [477.0, 481.0, 493.0, 515.0, 565.0] | [448, 448, 448, 440, 705] |
p03078 | u141786930 | 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 - Cake 123\n\nimport heapq\nimport itertools\nfrom collections import defaultdict\n\nx, y, z, k = map(int, input().split())\n\nA = list(int(a) for a in input().split())\nB = list(int(b) for b in input().split())\nC = list(int(c) for c in input().split())\n\nA.sort(reverse=True)\nB.sort(reverse=True)\nC.sort(rever... | ['Wrong Answer', 'Accepted'] | ['s554486657', 's740206280'] | [5504.0, 5268.0] | [45.0, 42.0] | [1821, 1611] |
p03078 | u149752754 | 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)\nLIS = []\nS = 0\nT = 0\nfor s in range(X):\n for t in range(Y):\n for u in range(min((3000//(s+... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s015919945', 's234855963', 's359954209', 's695702653', 's734836835', 's761523816', 's990326914', 's661021305'] | [3064.0, 3064.0, 3064.0, 3188.0, 3064.0, 591340.0, 3188.0, 9784.0] | [17.0, 17.0, 17.0, 18.0, 17.0, 2140.0, 19.0, 108.0] | [446, 443, 489, 435, 446, 694, 499, 490] |
p03078 | u163320134 | 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\na,b,c,k=map(int,input())\narr1=list(map(int,input().split()))\narr1=sorted(arr1,reverse=True)\narr2=list(map(int,input().split()))\narr2=sorted(arr2,reverse=True)\narr3=list(map(int,input().split()))\narr3=sorted(arr3,reverse=True)\nheap=[]\nheapq.heappush(heap,(-(arr1[0]+arr2[0]+arr3[0]),0,0,0))\ns={... | ['Runtime Error', 'Accepted'] | ['s761285000', 's984569015'] | [3188.0, 4852.0] | [18.0, 35.0] | [736, 744] |
p03078 | u166306121 | 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()\nB.sort()\nsublist = []\nfor i in range(max(X-K-1, 0), X):\n for j in range(max(Y - K - 1, 0), Y):\n if (X-i)*(Y-j) <= K:\n sublist.app... | ['Wrong Answer', 'Accepted'] | ['s825357235', 's746234035'] | [5760.0, 5364.0] | [737.0, 773.0] | [640, 643] |
p03078 | u177411511 | 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\n\nstdin = sys.stdin\n\nni = lambda: int(ns())\nna = lambda: list(map(int, stdin.readline().split()))\nns = lambda: stdin.readline().rstrip() # ignore trailing spaces\n\nres = []\nx, y, z, K = na()\na_li = na()\nb_li = na()\nc_li = na()\nlist.sort(a_li, reverse=True)\nlist.sort(b_li, reverse=True)\nlist.s... | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s694657836', 's804245858', 's819469005', 's902757454', 's018947184'] | [8688.0, 3188.0, 676104.0, 3188.0, 8692.0] | [635.0, 585.0, 2146.0, 571.0, 653.0] | [606, 604, 482, 620, 606] |
p03078 | u179169725 | 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\n\n\n\nimport sys\nread = sys.stdin.readline\n\n\ndef read_ints():\n return list(map(int, read().split()))\n\n\nX, Y, Z, K = read_ints()\nA = read_ints()\nB = read_ints()\nC = read_ints()\n\nA.sort(reverse=True)\nB.sort(reverse=True)\nC.sort(reverse=True)\n\nheap = [] \n\nfrom heapq import heapify, heappop, he... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s381204792', 's590062947', 's075022983'] | [95420.0, 95404.0, 5232.0] | [2104.0, 2104.0, 41.0] | [1320, 1786, 1771] |
p03078 | u185354171 | 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_list = []\nfor a_i in range(x):\n for b_i in range(y):\n ab_list.append(a[a_i]+b[b_i])\nab_list.sort(reverse=True)\nsum_list = []\nfor ab_i in range(k):\n f... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s140642855', 's182010126', 's186468717', 's282804281', 's510932162', 's918034407'] | [209264.0, 55356.0, 377816.0, 3064.0, 3064.0, 114380.0] | [2121.0, 875.0, 2128.0, 18.0, 19.0, 1788.0] | [441, 598, 335, 599, 463, 507] |
p03078 | u187233527 | 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 = sorted([int(i) for i in input().split()], reverse=True)\nB = sorted([int(i) for i in input().split()], reverse=True)\nC = sorted([int(i) for i in input().split()], reverse=True)\n\nheap = []\nheapq.heappush(heap, (-(A[0] + B[0] + C[0]), 0, 0, 0))\nfor _ in r... | ['Runtime Error', 'Accepted'] | ['s229480545', 's639220361'] | [4212.0, 4852.0] | [32.0, 36.0] | [569, 852] |
p03078 | u189513668 | 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... | ['\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\n\nAB = []\nfor i in range(X):\n for j in range(Y):\n AB.append(A[i] + B[j])\n\n#AB.sort(reverse=True)\n\nAB = AB[:K]\n\nABC = []\nfor i in range(len(AB... | ['Wrong Answer', 'Accepted'] | ['s802380108', 's352507055'] | [160720.0, 8732.0] | [1107.0, 655.0] | [444, 473] |
p03078 | u198440493 | 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,q=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\nclass bisect:\n def bisect(self,l,r):\n cnt=(l+r)//2\n if cnt==l:\n return l-1+self.judge(l)\n if self.judge(cn... | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s145342372', 's321519633', 's630601502', 's649336486', 's733290896', 's686149798'] | [3188.0, 112348.0, 3064.0, 41880.0, 3696.0, 112348.0] | [20.0, 1988.0, 17.0, 2106.0, 241.0, 1974.0] | [876, 373, 1034, 1056, 404, 376] |
p03078 | u198624562 | 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 \n_x, _y, _z, k = map(int, input().split())\naa = list(reversed(sorted(map(int, input().split()))))\nbb = list(reversed(sorted(map(int, input().split()))))\ncc = list(reversed(sorted(map(int, input().split()))))\n\nab=[]\nfor i in range(_x):\n for j in range(_y):\n ab.append(aa[i]+bb[j])\n\nab.sort... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s068191361', 's375750030', 's464576347', 's032199622'] | [54612.0, 54612.0, 54612.0, 4852.0] | [598.0, 584.0, 576.0, 37.0] | [514, 516, 512, 739] |
p03078 | u201856486 | 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\n\n# import math\n# import itertools\n# import numpy as np\n# import collections\n\n"""Template"""\n\n\nclass IP:\n \n\n def __init__(self):\n self.input = sys.stdin.readline\n\n def I(self):\n \n return int(self.input())\n\n def S(self):\n \n return self.inpu... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s145470711', 's167608027', 's159927697'] | [129024.0, 3316.0, 112500.0] | [1919.0, 20.0, 1523.0] | [5115, 5121, 5158] |
p03078 | u204616996 | 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()))\nif X>Y and X>Z:\n X,Z=Z,X\n A,C=C,A\nelif Y>X and Y>Z:\n Y,Z=Z,Y\n B,C=C,Y\nC=sorted(C,,reverse=True)\nk=min(K,X*Y)\nAB=sorted([a+b for a in A for b in B],reverse=True)[:k]\nABC=... | ['Runtime Error', 'Accepted'] | ['s503666425', 's415324706'] | [3060.0, 9548.0] | [18.0, 117.0] | [389, 455] |
p03078 | u210440747 | 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/python3\n# -*- coding:utf-8 -*-\n\nimport heapq\nimport numpy\n\ndef main():\n na, nb, nc, K = map(int, input().split())\n As = sorted(list(map(int, input().split())), reverse=True)\n Bs = sorted(list(map(int, input().split())), reverse=True)\n Cs = sorted(list(map(int, input().split())), reverse=True)... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s196107445', 's469602162', 's967306485', 's018864443'] | [12508.0, 20380.0, 14452.0, 4724.0] | [150.0, 366.0, 152.0, 782.0] | [968, 966, 1005, 815] |
p03078 | u213497190 | 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... | ['#input\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\n#sort\na=sorted(a,reverse=True)\nb=sorted(b,reverse=True)\nc=sorted(c,reverse=True)\n\nq=[]\nheappush(q,(-(a[0]+b[0]+c[0]),0,0,0))\ns={(0,0,0)}\n\nfor n i... | ['Runtime Error', 'Accepted'] | ['s400460341', 's694948459'] | [3064.0, 4952.0] | [17.0, 36.0] | [848, 779] |
p03078 | u225388820 | 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 sys\nfrom heapq import heappush,heapify,heappop\ninput = sys.stdin.readline\n\ndef make_kth(A, B, k):\n n, m = len(A), len(B)\n q = [(-A[0] - B[0], 0, 0)]\n r=[]\n for _ in range(min(k, n * m)):\n v, s, t = heappop(q)\n r.append(-v)\n if t + 1 < m:\n heappush(q, (-... | ['Wrong Answer', 'Accepted'] | ['s348963548', 's791411159'] | [9016.0, 9440.0] | [26.0, 37.0] | [780, 788] |
p03078 | u225642513 | 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 = [int(i) for i in input().split()]\nb_list = [int(i) for i in input().split()]\nc_list = [int(i) for i in input().split()]\na_list.sort(reverse = True)\nb_list.sort(reverse = True)\nc_list.sort(reverse = True)\ntotal_list = [0 for _ in range(min(106307,X*Y*Z))]\nfor i in r... | ['Runtime Error', 'Accepted'] | ['s598776852', 's541988251'] | [4588.0, 4768.0] | [36.0, 35.0] | [638, 940] |
p03078 | u228223940 | 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\n\nkouho = []\n\nfor i in range(x):\n for j in range(y):\n for k in range(z):\n if (... | ['Wrong Answer', 'Accepted'] | ['s381131539', 's931157966'] | [3316.0, 8740.0] | [607.0, 669.0] | [454, 453] |
p03078 | u231095456 | 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 = 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)\nabc = [(-(A[0]+B[0]+C[0]), 0,0,0)]\nused = set((0,0,0))\nwhile K > 0:\n K -= 1\n p,i,j,k = hq.heappop(abc)\n print(-p)\n for a,b,c i... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s232880653', 's307169837', 's030467572'] | [9300.0, 9324.0, 10332.0] | [29.0, 27.0, 44.0] | [492, 339, 546] |
p03078 | u234985935 | 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 = sorted(list(map(int,input().split())), reverse=True)\nB_list = sorted(list(map(int,input().split())), reverse=True)\nC_list = sorted(list(map(int,input().split())), reverse=True)\n\nE_list = sorted([ai+bi for ai in A_list for bi in B_list], reverse=True)[:K]\nsum_list =... | ['Runtime Error', 'Accepted'] | ['s686224752', 's521899288'] | [62324.0, 184800.0] | [424.0, 1813.0] | [424, 424] |
p03078 | u237656255 | 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\n\nX, Y, Z, K = [int(a) for a in input().split()]\nA = [int(a) for a in input().split()]\nB = [int(a) for a in input().split()]\nC = [int(a) for a in input().split()]\n\nA.sort(reverse=True)\nB.sort(reverse=True)\nC.sort(reverse=True)\n\ndef total(x, y, z):\n return A[x] + B[y] ... | ['Wrong Answer', 'Accepted'] | ['s956197123', 's667551204'] | [3956.0, 4084.0] | [34.0, 43.0] | [819, 834] |
p03078 | u239204773 | 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... | ['\nX,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\nA = sorted(A)\nB = sorted(B)\nC = sorted(C)\n\nA.reverse()\nB.reverse()\nC.reverse()\n\nABC = []\nfor i in range(len(A)):\n for j in range(len(B)):\n... | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s090210038', 's375644442', 's925691117', 's208588332'] | [8692.0, 184556.0, 3316.0, 8688.0] | [119.0, 2159.0, 20.0, 123.0] | [763, 839, 850, 767] |
p03078 | u250583425 | 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\ndef input(): return sys.stdin.readline().rstrip()\n\ndef main():\n X, Y, Z, K = map(int, input().split())\n A, B, C = [sorted(map(int, input().split())) for _ in range(3)]\n\n AB = []\n for i, a in enumerate(A):\n for j, b in enumerate(B):\n AB.append(a + b)\n AB = sorted(... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s197096037', 's405398929', 's576112412'] | [184620.0, 4332.0, 4976.0] | [2112.0, 31.0, 32.0] | [569, 787, 901] |
p03078 | u254871849 | 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\nimport numpy as np\n\n\ndef is_ok(a, b, c, X, Y, Z, K, border):\n cnt = 0\n for i in range(X):\n for j in range(Y):\n for k in range(Z):\n if a[i] + b[j] + c[k] < border:\n break\n cnt += 1\n if cnt == K:\n ... | ['Wrong Answer', 'Accepted'] | ['s461423953', 's355827371'] | [14536.0, 9548.0] | [2108.0, 84.0] | [1400, 487] |
p03078 | u255067135 | 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 conKey(i, j, k):\n return str(i)+'-'+str(j)+'-'+str(k)\n\n\ndef getKey(s):\n return map(int, s.split('-'))\n\n\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(re... | ['Runtime Error', 'Accepted'] | ['s536544634', 's887483934'] | [4580.0, 4700.0] | [59.0, 60.0] | [879, 945] |
p03078 | u255499778 | 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\nli = []\n\nfor i in a:\n for j in rangeb:\n li.append(i + j)\n \nli.sort(... | ['Runtime Error', 'Accepted'] | ['s302465413', 's487363678'] | [3188.0, 160444.0] | [19.0, 1984.0] | [471, 472] |
p03078 | u255943004 | 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 = sorted([int(i) for i in input().split()],reverse=True)\nB = sorted([int(i) for i in input().split()],reverse=True)\nC = sorted([int(i) for i in input().split()],reverse=True)\ndef set_tuple(A,B,C,x,y,z):\n return (-(A[x]+B[y]+C[z]),x,y,z)\nQ = []\nheapq.heappush(... | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s027188579', 's193080547', 's445487064', 's481079731', 's648471292', 's733811173', 's277126511'] | [3188.0, 211548.0, 3188.0, 211800.0, 3316.0, 3316.0, 4972.0] | [19.0, 2116.0, 19.0, 2116.0, 2104.0, 2104.0, 36.0] | [834, 359, 834, 346, 437, 409, 847] |
p03078 | u259064510 | 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()))\n\na.sort()\nb.sort()\nc.sort()\na.reverse()\nb.reverse()\nc.reverse()\n\na_idx = 0\nb_idx = 0\nc_idx = 0\noutput = []\noutput.append((a_idx, b_idx, c_idx))\nwhil... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s037789714', 's987917908', 's486871364'] | [3188.0, 3700.0, 4084.0] | [2107.0, 29.0, 762.0] | [1284, 913, 1208] |
p03078 | u265065462 | 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()\nA.reverse()\nB.sort()\nB.reverse()\nC.sort()\nC.reverse()\n\nm = max(X,Y,Z)\n\n\nansl = [0] * 3000\ntmp = (5,5,5)\ninda = 0\nindb = 0\nindc = 0\n\nhoge = 10**12\n... | ['Runtime Error', 'Accepted'] | ['s445230691', 's816394018'] | [208060.0, 8708.0] | [2116.0, 660.0] | [570, 445] |
p03078 | u271430213 | 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=[0]*(x*y)\ni=0\nfor a in A:\n for b in B:\n AB[i]=a+b\n i+=1\n\nAB=AB.sort(reverse=True)[:min(k,x*y)]\nABC=[0]*(min(k,x*y)*z)\ni=0\nfor ab in AB:\n for c in ... | ['Runtime Error', 'Accepted'] | ['s874810454', 's353552315'] | [55272.0, 4468.0] | [885.0, 768.0] | [401, 691] |
p03078 | u273201018 | 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 = sorted(list(map(int, input().split())), reverse=True)[:K]\nB = sorted(list(map(int, input().split())), reverse=True)[:K]\nC = sorted(list(map(int, input().split())), reverse=True)[:K]\n\nR = [sum([A[0], B[0], C[0]])]\nQ = {(0, 0, 1), (0, 1, 0), (1, 0, 0)}\nD = {(0, 0,... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s200109276', 's700548010', 's645946292'] | [5352.0, 3956.0, 5180.0] | [990.0, 33.0, 1514.0] | [1454, 1150, 1950] |
p03078 | u278356323 | 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())).sort(reverse=True)\nb=list(map(int,input().split())).sort(reverse=True)\nc=list(map(int,input().split())).sort(reverse=True)\n\nab=[]\n\nfor i in a[:k]:\n for j in b[:k]:\n ab.append(i+j)\nab.sort(reverse=True)\n\nabc=[]\nfor i in ab[:... | ['Runtime Error', 'Accepted'] | ['s911177748', 's694006258'] | [3064.0, 162892.0] | [18.0, 1781.0] | [407, 404] |
p03078 | u282228874 | 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,itertools,fractions,heapq,collections,re,bisect,sys,functools\n\nsys.setrecursionlimit(10**7)\ninf = float('inf')\nmod = 10**9+7\ndy = [-1,0,1,0]\ndx = [0,1,0,-1]\nddy = [-1,-1,0,1,1,1,0,-1]\nddx = [0,1,1,1,0,-1,-1,-1]\n\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\ndef LI_(): return [... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s626234521', 's799336538', 's057725232'] | [207872.0, 3188.0, 4980.0] | [2117.0, 18.0, 35.0] | [1013, 263, 647] |
p03078 | u285443936 | 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()))\nC.sort()\nC.reverse()\n\n\narray = []\ntmp = []\n\nfor a in A:\n for b in B:\n tmp.append(a+b)\ntmp.sort()\ntmp.reverse()\n\nfor i in range(K):\n for c in C:\n array... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s263707088', 's387276188', 's832672276'] | [209072.0, 208952.0, 4468.0] | [2117.0, 2116.0, 775.0] | [384, 426, 737] |
p03078 | u286955577 | 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 = sorted([int(i) for i in input().split()])\nB = sorted([int(i) for i in input().split()])\nC = sorted([int(i) for i in input().split()])\n\ndef solve():\n AB = []\n for a in A:\n for b in B:\n AB.append(a + b)\n\n AB.sort(reversed=... | ['Runtime Error', 'Accepted'] | ['s714923970', 's993583812'] | [50668.0, 4976.0] | [138.0, 36.0] | [477, 808] |
p03078 | u298297089 | 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\nfrom heapq import heappop, heappush\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\n\nidx = [0,0,0]\nheap = []\nxxx = [x,y,z]\n\naaa = ... | ['Wrong Answer', 'Accepted'] | ['s305958533', 's501884494'] | [5152.0, 5164.0] | [64.0, 64.0] | [1168, 1297] |
p03078 | u303037478 | 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\nif x>50:\n a.sort()\n a.reverse()\n a=a[0:50]\n\nif y>50:\n b.sort()\n b.reverse()\n b=b[0:50]\n\nif z>50:\n c.sort()\n c.reverse()\n c=c[0:50]\n\nansList=[]\nfor... | ['Runtime Error', 'Accepted'] | ['s957641309', 's001639993'] | [9676.0, 161112.0] | [102.0, 1981.0] | [471, 511] |
p03078 | u310233294 | 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(' ')))\ntaste = []\nfor i in range(x - 8 if x - 8 < 0 else 0, x):\n for j in range(y - 8 if x - 8 < 0 else 0, y):\n for l in range(z - 8 if x - 8 < 0 els... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s040820367', 's557108572', 's991821033', 's322110237'] | [357080.0, 3064.0, 7512.0, 8864.0] | [2126.0, 17.0, 2104.0, 419.0] | [419, 466, 490, 504] |
p03078 | u310678820 | 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\ns=set()\nq=[]\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)\nheapq.heappush(q, (-(a[0]+b[0]+c[0]), 0, 0, 0))\ndef pu... | ['Runtime Error', 'Accepted'] | ['s723216591', 's297576361'] | [3316.0, 4852.0] | [19.0, 36.0] | [598, 580] |
p03078 | u316386814 | 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()))\nimport heapq\nq = []\nA.sort(reverse=True)\nB.sort(reverse=True)\nC.sort(reverse=True)\ndef val(i, j, k):\n return -(A[i] + B[j] + C[k])\nheapq.heappush(q, (val... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s328966358', 's988199305', 's136060002'] | [4212.0, 4212.0, 4956.0] | [33.0, 32.0, 36.0] | [627, 555, 848] |
p03078 | u324314500 | 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 ii2ss(n):\n ss = []\n for i in range(n):\n ss.append(input())\n return ss\n\ndef sp2nn(sp, sep=' '):\n return [int(s) for s in sp.split(sep)]\n\ndef ss2nn(ss):\n return [int(s) for s in list(ss)]\n\ndef tk(i, j, k):\n return '%d %d %d' % (i, j, k)\n\ndef tkr(key):\n return sp2nn(key)\n... | ['Runtime Error', 'Accepted'] | ['s552643800', 's885783284'] | [3192.0, 4640.0] | [19.0, 990.0] | [1293, 1195] |
p03078 | u329232967 | 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... | ['\ndef solver2(a, b, c, k):\n d = deque()\n n = len(a)\n for p in range(n):\n for q in range(n):\n for r in range(n):\n if (p + 1) * (q + 1) * (r + 1) > k:\n continue\n d.append(a[-p - 1] + b[-q - 1] + c[-r - 1])\n it = reversed(sorted(d))\... | ['Runtime Error', 'Accepted'] | ['s381396832', 's491644899'] | [3188.0, 9888.0] | [19.0, 553.0] | [613, 1007] |
p03078 | u333404917 | 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([int(x) for x in input().split()], reverse=True)[:K]\nB = sorted([int(x) for x in input().split()], reverse=True)[:K]\nC = sorted([int(x) for x in input().split()], reverse=True)[:K]\n\nbi_comb = []\nfor i in range(min(X, K)):\n for j in range(min(Y, K)):\n ... | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s189113656', 's218587280', 's296424913', 's431050226', 's574530445', 's995556830', 's011752098'] | [156752.0, 5364.0, 5960.0, 162224.0, 156880.0, 5364.0, 5364.0] | [2040.0, 46.0, 95.0, 2116.0, 2025.0, 46.0, 45.0] | [579, 613, 681, 504, 578, 613, 632] |
p03078 | u334712262 | 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 bisect\nimport heapq\nimport math\nimport random\nimport sys\nfrom collections import Counter, defaultdict, deque\nfrom decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal\nfrom functools import lru_cache, reduce\nfrom itertools import combinations, combinations_with_replacement, prod... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s561526425', 's863013797', 's714537721'] | [7240.0, 5832.0, 7236.0] | [67.0, 44.0, 68.0] | [2369, 2361, 2367] |
p03078 | u335538114 | 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())\nm = []\nfor _ in range(3):\n m.append(sorted(list(map(int, input().split())), reverse=True))\n\ndef sorted_sum(list_a, list_b, limit):\n s = []\n for x in list_a:\n for y in list_b:\n s.append(x + y)\n return sorted(s[0:limit], reverse=True)\n\n\nd... | ['Runtime Error', 'Accepted'] | ['s339672870', 's330857475'] | [3188.0, 185336.0] | [19.0, 1977.0] | [641, 385] |
p03078 | u338824669 | 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\ndef main():\n X,Y,Z,K=map(int,input().split())\n A=list(reversed(sorted(map(int,input().split()))))\n B=list(reversed(sorted(map(int,input().split()))))\n C=list(reversed(sorted(map(int,input().split()))))\n q=[(-A[0]-B[0]-C[0],0,0,0)]\n queued={(0,0,0)}\n for i in range(K):\n v,s,t,u=heapq.... | ['Wrong Answer', 'Accepted'] | ['s058857663', 's462122841'] | [5108.0, 4980.0] | [36.0, 34.0] | [593, 592] |
p03078 | u346812984 | 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\nfrom collections import deque\n\nsys.setrecursionlimit(10 ** 6)\nINF = float("inf")\nMOD = 10 ** 9 + 7\n\n\ndef input():\n return sys.stdin.readline().strip()\n\n\ndef main():\n X, Y, Z, K = map(int, input().split())\n A = list(map(int, input().split()))\n B = list(map(int, input().split()))\n... | ['Wrong Answer', 'Accepted'] | ['s772795290', 's035290452'] | [10184.0, 10748.0] | [42.0, 42.0] | [1264, 1291] |
p03078 | u347640436 | 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\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\nexists = set()\nq = [(-(A[0] + B[0] + C[0]), (0, 0, 0))]\n... | ['Wrong Answer', 'Accepted'] | ['s386324372', 's872678489'] | [4972.0, 4968.0] | [39.0, 52.0] | [949, 642] |
p03078 | u350049649 | 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\nhq=[]\nX, Y, Z, K= map(int,input().split())\nA=list(map(int,input().split()))\nA.sort(reverse=True)\nB=list(map(int,input().split()))\nB.sort(reverse=True)\nC=list(map(int,input().split()))\nC.sort(reverse=True)\nsearched={(0,0,0)}\nheapq.heappush(hq,(-(A[0]+B[0]+C[0]),0,0,0))\nD=[[1,0,0],[0,1,0],[0,0,1... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s663869507', 's698826658', 's823088031'] | [3316.0, 3064.0, 6108.0] | [20.0, 18.0, 81.0] | [605, 466, 612] |
p03078 | u353797797 | 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 as it\n\nan, bn, cn, 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 = [ak + bk for ak, bk in it.product(a, b)]\nab.sort(reverse=True)\nif len(ab) > k: ab = ab[:k]\nabc = [abk + ck for abk, ck in it.pro... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s512041416', 's703913837', 's872561131', 's754246269'] | [166108.0, 5232.0, 165996.0, 5232.0] | [2114.0, 36.0, 2114.0, 35.0] | [380, 930, 485, 912] |
p03078 | u365838886 | 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())), reverse=True)\nB = sorted(list(map(int, input().split())), reverse=True)\nC = sorted(list(map(int, input().split())), reverse=True)\ns = []\n\nfor i in A:\n\tfor j in B:\n\t\tfor k in C:\n\t\t\ts.append(i+j+k)\n\ns = sorted(s, r... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s321325532', 's535100470', 's170181866'] | [8944.0, 9004.0, 212212.0] | [26.0, 22.0, 2000.0] | [345, 366, 456] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.