id stringclasses 1
value | instruction stringclasses 206
values | trajectory listlengths 2 41 | length int64 2 41 | public_tests listlengths 1 6 | generated_tests listlengths 4 100 |
|---|---|---|---|---|---|
0/::0 | There are X+Y+Z people, conveniently numbered 1 through X+Y+Z. Person i has A_i gold coins, B_i silver coins and C_i bronze coins.
Snuke is thinking of getting gold coins from X of those people, silver coins from Y of the people and bronze coins from Z of the people. It is not possible to get two or more different col... | [
"\n",
"from heapq import heappushpop\nimport sys\nX, Y, Z = map(int, sys.stdin.readline().split())\nN = X+Y+Z\nABC = [list(map(int, sys.stdin.readline().split())) for _ in range(N)]\nABC.sort(key = lambda x: x[0] - x[1], reverse = True)\n\nGB = [None]*N\nQ = [a - c for a, _, c in ABC[:X]]\nQ.sort()\ngs = sum(a fo... | 2 | [
{
"input": "1 2 1\n2 4 4\n3 2 1\n7 6 7\n5 2 3",
"output": "18"
},
{
"input": "6 2 4\n33189 87907 277349742\n71616 46764 575306520\n8801 53151 327161251\n58589 4337 796697686\n66854 17565 289910583\n50598 35195 478112689\n13919 88414 103962455\n7953 69657 699253752\n44255 98144 468443709\n2332 42580 ... | [
{
"input": "1 2 1\n2 4 4\n0 2 1\n7 6 7\n5 2 3",
"output": "18\n"
},
{
"input": "6 2 4\n33189 87907 277349742\n71616 46764 575306520\n8801 53151 327161251\n58589 4337 796697686\n66854 17565 289910583\n50598 35195 478112689\n13919 88414 103962455\n7953 69657 699253752\n42489 98144 468443709\n2332 4258... |
0/::0 | There are X+Y+Z people, conveniently numbered 1 through X+Y+Z. Person i has A_i gold coins, B_i silver coins and C_i bronze coins.
Snuke is thinking of getting gold coins from X of those people, silver coins from Y of the people and bronze coins from Z of the people. It is not possible to get two or more different col... | [
"\n",
"from heapq import*;X,Y,Z=map(int,input().split());N=X+Y+Z;A=[];q1=[];q2=[];L=[0];R=[0]\nfor _ in[0]*N:A.append([int(e)for e in input().split()])\nA.sort(key=lambda a:a[0]-a[1])\nfor i in range(N):\n L+=[L[i]+A[i][1]];heappush(q1,A[i][1]-A[i][2]);R+=[R[i]+A[-1-i][0]];heappush(q2,A[~i][0]-A[~i][2])\n i... | 2 | [
{
"input": "1 2 1\n2 4 4\n3 2 1\n7 6 7\n5 2 3",
"output": "18"
},
{
"input": "6 2 4\n33189 87907 277349742\n71616 46764 575306520\n8801 53151 327161251\n58589 4337 796697686\n66854 17565 289910583\n50598 35195 478112689\n13919 88414 103962455\n7953 69657 699253752\n44255 98144 468443709\n2332 42580 ... | [
{
"input": "1 2 1\n2 4 4\n0 2 1\n7 6 7\n5 2 3",
"output": "18\n"
},
{
"input": "6 2 4\n33189 87907 277349742\n71616 46764 575306520\n8801 53151 327161251\n58589 4337 796697686\n66854 17565 289910583\n50598 35195 478112689\n13919 88414 103962455\n7953 69657 699253752\n42489 98144 468443709\n2332 4258... |
0/::0 | There are X+Y+Z people, conveniently numbered 1 through X+Y+Z. Person i has A_i gold coins, B_i silver coins and C_i bronze coins.
Snuke is thinking of getting gold coins from X of those people, silver coins from Y of the people and bronze coins from Z of the people. It is not possible to get two or more different col... | [
"\n",
"import sys\nfrom heapq import heappush, heappushpop\nX, Y, Z = map(int, input().split())\nxyz = sorted([list(map(int,l.split()))for l in sys.stdin],key=lambda x:x[0]-x[1])\n\nuq = []\ncy = 0\nfor x, y, z in xyz[:Y]:\n heappush(uq, y - z)\n cy += y\nLy = [cy]\nfor x, y, z in xyz[Y:Y+Z]:\n cy += y -... | 2 | [
{
"input": "1 2 1\n2 4 4\n3 2 1\n7 6 7\n5 2 3",
"output": "18"
},
{
"input": "6 2 4\n33189 87907 277349742\n71616 46764 575306520\n8801 53151 327161251\n58589 4337 796697686\n66854 17565 289910583\n50598 35195 478112689\n13919 88414 103962455\n7953 69657 699253752\n44255 98144 468443709\n2332 42580 ... | [
{
"input": "1 2 1\n2 4 4\n0 2 1\n7 6 7\n5 2 3",
"output": "18\n"
},
{
"input": "6 2 4\n33189 87907 277349742\n71616 46764 575306520\n8801 53151 327161251\n58589 4337 796697686\n66854 17565 289910583\n50598 35195 478112689\n13919 88414 103962455\n7953 69657 699253752\n42489 98144 468443709\n2332 4258... |
0/::0 | There are X+Y+Z people, conveniently numbered 1 through X+Y+Z. Person i has A_i gold coins, B_i silver coins and C_i bronze coins.
Snuke is thinking of getting gold coins from X of those people, silver coins from Y of the people and bronze coins from Z of the people. It is not possible to get two or more different col... | [
"\n",
"from heapq import*\nX,Y,Z=map(int,input().split());N=X+Y+Z;A=[];q1=[];q2=[];L=[0];\nfor _ in[0]*N:A.append([int(e)for e in input().split()])\n",
"from heapq import*\nX,Y,Z=map(int,input().split());N=X+Y+Z;A=[];q1=[];q2=[];L=[0];R=[0]\nfor _ in[0]*N:A.append([int(e)for e in input().split()])\n",
"from h... | 6 | [
{
"input": "1 2 1\n2 4 4\n3 2 1\n7 6 7\n5 2 3",
"output": "18"
},
{
"input": "6 2 4\n33189 87907 277349742\n71616 46764 575306520\n8801 53151 327161251\n58589 4337 796697686\n66854 17565 289910583\n50598 35195 478112689\n13919 88414 103962455\n7953 69657 699253752\n44255 98144 468443709\n2332 42580 ... | [
{
"input": "1 2 1\n2 4 4\n0 2 1\n7 6 7\n5 2 3",
"output": "18\n"
},
{
"input": "6 2 4\n33189 87907 277349742\n71616 46764 575306520\n8801 53151 327161251\n58589 4337 796697686\n66854 17565 289910583\n50598 35195 478112689\n13919 88414 103962455\n7953 69657 699253752\n42489 98144 468443709\n2332 4258... |
0/::0 | There are X+Y+Z people, conveniently numbered 1 through X+Y+Z. Person i has A_i gold coins, B_i silver coins and C_i bronze coins.
Snuke is thinking of getting gold coins from X of those people, silver coins from Y of the people and bronze coins from Z of the people. It is not possible to get two or more different col... | [
"\n",
"x,y,z=map(int,input().split())\n",
"import sys\n\n\nx,y,z=map(int,input().split())\n",
"import sys\n\nfrom heapq import heappush,heappushpop\nx,y,z=map(int,input().split())\nABC=[tuple(map(int,input().split())) for _ in range(x+y+z)]\nABC.sort(key=lambda x: x[0]-x[1])\ncy=0\nhq=[]\nfor a,b,c in ABC[:y]... | 5 | [
{
"input": "1 2 1\n2 4 4\n3 2 1\n7 6 7\n5 2 3",
"output": "18"
},
{
"input": "6 2 4\n33189 87907 277349742\n71616 46764 575306520\n8801 53151 327161251\n58589 4337 796697686\n66854 17565 289910583\n50598 35195 478112689\n13919 88414 103962455\n7953 69657 699253752\n44255 98144 468443709\n2332 42580 ... | [
{
"input": "1 2 1\n2 4 4\n0 2 1\n7 6 7\n5 2 3",
"output": "18\n"
},
{
"input": "6 2 4\n33189 87907 277349742\n71616 46764 575306520\n8801 53151 327161251\n58589 4337 796697686\n66854 17565 289910583\n50598 35195 478112689\n13919 88414 103962455\n7953 69657 699253752\n42489 98144 468443709\n2332 4258... |
0/::0 | There are X+Y+Z people, conveniently numbered 1 through X+Y+Z. Person i has A_i gold coins, B_i silver coins and C_i bronze coins.
Snuke is thinking of getting gold coins from X of those people, silver coins from Y of the people and bronze coins from Z of the people. It is not possible to get two or more different col... | [
"\n",
"import sys\n",
"import sys\nfrom heapq import heappush, heappushpop\n",
"import sys\nfrom heapq import heappush, heappushpop\nX, Y, Z = map(int, input().split())\nxyz = sorted([list(map(int,l.split()))for l in sys.stdin],key=lambda x:x[0]-x[1])\n\nuq = []\ncy = 0\nfor x, y, z in xyz[:Y]:\n heappush(... | 4 | [
{
"input": "1 2 1\n2 4 4\n3 2 1\n7 6 7\n5 2 3",
"output": "18"
},
{
"input": "6 2 4\n33189 87907 277349742\n71616 46764 575306520\n8801 53151 327161251\n58589 4337 796697686\n66854 17565 289910583\n50598 35195 478112689\n13919 88414 103962455\n7953 69657 699253752\n44255 98144 468443709\n2332 42580 ... | [
{
"input": "1 2 1\n2 4 4\n0 2 1\n7 6 7\n5 2 3",
"output": "18\n"
},
{
"input": "6 2 4\n33189 87907 277349742\n71616 46764 575306520\n8801 53151 327161251\n58589 4337 796697686\n66854 17565 289910583\n50598 35195 478112689\n13919 88414 103962455\n7953 69657 699253752\n42489 98144 468443709\n2332 4258... |
0/::0 | "There are X+Y+Z people, conveniently numbered 1 through X+Y+Z. Person i has A_i gold coins, B_i sil(...TRUNCATED) | ["\n","#金側\n\n\n#銀側\n\n\n#print (ABC)\n#print (ansX,ansY)\n","\"\"\"\n\nhttps://atcoder.jp/c(...TRUNCATED) | 4 | [{"input":"1 2 1\n2 4 4\n3 2 1\n7 6 7\n5 2 3","output":"18"},{"input":"6 2 4\n33189 87907 277349742\(...TRUNCATED) | [{"input":"1 2 1\n2 4 4\n0 2 1\n7 6 7\n5 2 3","output":"18\n"},{"input":"6 2 4\n33189 87907 27734974(...TRUNCATED) |
0/::0 | "There are X+Y+Z people, conveniently numbered 1 through X+Y+Z. Person i has A_i gold coins, B_i sil(...TRUNCATED) | ["\n","gsb = []\n","gsb = []\n\n\ngb_total_delta = 0\n","import heapq\nx, y, z = [int(item) for item(...TRUNCATED) | 5 | [{"input":"1 2 1\n2 4 4\n3 2 1\n7 6 7\n5 2 3","output":"18"},{"input":"6 2 4\n33189 87907 277349742\(...TRUNCATED) | [{"input":"1 2 1\n2 4 4\n0 2 1\n7 6 7\n5 2 3","output":"18\n"},{"input":"6 2 4\n33189 87907 27734974(...TRUNCATED) |
0/::0 | "There are X+Y+Z people, conveniently numbered 1 through X+Y+Z. Person i has A_i gold coins, B_i sil(...TRUNCATED) | ["\n","import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy(...TRUNCATED) | 8 | [{"input":"1 2 1\n2 4 4\n3 2 1\n7 6 7\n5 2 3","output":"18"},{"input":"6 2 4\n33189 87907 277349742\(...TRUNCATED) | [{"input":"1 2 1\n2 4 4\n0 2 1\n7 6 7\n5 2 3","output":"18\n"},{"input":"6 2 4\n33189 87907 27734974(...TRUNCATED) |
0/::0 | "There are X+Y+Z people, conveniently numbered 1 through X+Y+Z. Person i has A_i gold coins, B_i sil(...TRUNCATED) | ["\n","import heapq\n\n\ndef main():\n X, Y, Z = map(int, input().split())\n N = X+Y+Z\n P (...TRUNCATED) | 2 | [{"input":"1 2 1\n2 4 4\n3 2 1\n7 6 7\n5 2 3","output":"18"},{"input":"6 2 4\n33189 87907 277349742\(...TRUNCATED) | [{"input":"1 2 1\n2 4 4\n0 2 1\n7 6 7\n5 2 3","output":"18\n"},{"input":"6 2 4\n33189 87907 27734974(...TRUNCATED) |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 55