Datasets:

TheFactoryX
/

edition_0555_deepmind-code_contests-readymade

name stringlengths 4 70	description stringlengths 31 8.62k	public_tests dict	private_tests dict	generated_tests dict	source int64 1 6	difficulty int64 0 21	solutions dict	incorrect_solutions dict	cf_contest_id int64 0 1.55k	cf_index stringclasses 23 values	cf_points float64 0 3.75k	cf_rating int64 0 3.5k	cf_tags listlengths 0 7	is_description_translated bool 2 classes	time_limit dict	memory_limit_bytes int64 0 1.07B
p01262 Adaptive Time Slicing Quantization	"Polycarp takes part in a math show. He is given n tasks, each consists of k subtasks, numbered 1 th(...TRUNCATED)	{"input":["3 4 3 10\n3\n3 1 4\n4 5 9\n3 10 10\n","1 1 2 10\n2\n1 1 3\n2 6 10\n","5 7 6 11\n3\n5 3 8\(...TRUNCATED)	{"input":["61\n17357774\n248290406\n171408490\n20054376\n118774144\n110228788\n8827234\n85304880\n15(...TRUNCATED)	{"input":["10 7\n3 4\n8 6\n7 8\n3 1\n9 10\n10 6\n9 4\n","10 16\n9 8\n1 2\n9 5\n5 4\n9 2\n3 2\n1 6\n5(...TRUNCATED)	6	11	{"language":[1,4,2,4,2,3,4,4,2,4,3,4,2,2,4,4,3,1,2,1,1,2,4,2,4,4,4,4,2,4,4,2,2,3,2,4,2,2,2,4,1,1,2,3(...TRUNCATED)	{ "language": [], "solution": [] }	980		0	1,200	[ "brute force", "dp", "strings", "two pointers" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
1277_E. Two Fairs	"Snuke has decided to play a game, where the player runs a railway company. There are M+1 stations o(...TRUNCATED)	{"input":["3 2\n0 0 0\n1 1 1\n","4 3\n0 0 2 1\n2 0 1 1\n","5 10\n0 0 0 1 2\n2 1 0 0 0\n"],"output":[(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["3\nDSAWWAW\nD\nAW\n","3\nWSAWDAW\nD\nAW\n","3\nDAAWWSW\nD\nAW\n","3\nWAWWASD\nD\nWA\n","3(...TRUNCATED)	6	7	{"language":[1],"solution":["for _ in xrange(input()):\n n= input()\n a=map(int,raw_input().sp(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2(...TRUNCATED)	1,490		0	1,000	[ "implementation" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
1140_B. Good String	"You want to perform the combo on your opponent in one popular fighting game. The combo is the strin(...TRUNCATED)	{ "input": [ "4\n47\n74\n477\n4747477" ], "output": [ "2\n2\n3\n23\n" ] }	{ "input": [], "output": [] }	{"input":["10803140200\n","14\n","11\n","174813966899\n","13753962\n","601828654335\n","114141413978(...TRUNCATED)	2	8	{"language":[2,2,2,2,2,4,2,2,2,2,1,4,4,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,4,4,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	494	D	0	0	[ "" ]	false	{ "nanos": 0, "seconds": 1 }	256,000,000
1060_A. Phone Numbers	Example Input 3 2 3 1 2 1 2 3 2 3 3 1 Output 1	{"input":["3\nTroll likes Dracul\nDracul likes Anka\nSnowy likes Hexadecimal\n210 200 180\n","2\nAnk(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["1 36 0\n-1 -1 -1","0 30 0\n-1 -1 -1","0 32 0\n-1 -1 -1","1 16 0\n-1 -1 -1","0 36 0\n-1 -1(...TRUNCATED)	2	9	{"language":[2,2,2,2,2,2,2,4,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	663	B	1,000	0	[ "" ]	false	{ "nanos": 0, "seconds": 1 }	256,000,000
656_E. Out of Controls	"Flatland is inhabited by pixels of three colors: red, green and blue. We know that if two pixels of(...TRUNCATED)	{"input":["4\n1 3\n2 4\n3 4\n2 3\n","4\n4 4\n1 3\n2 4\n3 4\n"],"output":["NO\n1 3 4 2\n1 2 4 3\n","Y(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["3 1\n2 100 1","12 5\n43 94 27 3 69 99 56 25 15 15 46 8","3 1000\n1 101 1","6 24\n25 171 7(...TRUNCATED)	2	0	{"language":[2,2,2,4,4,3,4,2,2,4,3,2,2,2,2,2,1,4,2,2,2,2,2,2,2,4,4,4,4,4,4,4,4,4,2,2,2,4,2,2,2,4,4,2(...TRUNCATED)	{"language":[3,2,2,2,3,2,3,3,2,2,2,4,2,2,2,2,2,3,2,2,2,4,2,2,4,2,4,2,4,2,2,3,2,2,4,2,3,2,2,2,4,4,2,2(...TRUNCATED)	0	D	0	0	[ "combinatorics", "dfs and similar", "dsu", "graphs" ]	false	{ "nanos": 0, "seconds": 1 }	0
roys-life-cycle	"Treeland consists of n cities and n-1 two-way roads connecting pairs of cities. From every city, yo(...TRUNCATED)	{ "input": [ "2\n\nSAMPLE" ], "output": [ "3\n" ] }	{ "input": [], "output": [] }	{"input":["777 20\n","110 4\n","12 4\n","500 2\n","11 4\n","1 8\n","26 11\n","91 4\n","20 4\n","123 (...TRUNCATED)	5	11	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	1,158	D	2,000	0	[ "data structures", "divide and conquer", "dp" ]	false	{ "nanos": 0, "seconds": 2 }	0
702_E. Analysis of Pathes in Functional Graph	"Valera came to Japan and bought many robots for his research. He's already at the airport, the plan(...TRUNCATED)	{ "input": [ "3\nDSAWWAW\nD\nWA\n" ], "output": [ "8\n2\n4\n" ] }	{ "input": [], "output": [] }	{"input":["2\n5\n4","3\n1\n0\n3","2\n3\n4","3\n1\n0\n2","2\n4\n4","3\n1\n0\n1","2\n4\n0","3\n1\n2\n1(...TRUNCATED)	3	8	{"language":[1,1],"solution":["#!/usr/bin/env python\n#-- coding:utf-8 --\n\n\ndef convert_pair(a,(...TRUNCATED)	{"language":[2,2,2,2,2,4,3,3,4,4,4,2,1,4,4,2,2,2,2,3,1,2,4,4,4,4,2,3,2,3,2,1,2,4,4,4,3,4,3,2,4,2,4,2(...TRUNCATED)	0		0	1,100	[ "graphs", "greedy", "shortest paths" ]	false	{ "nanos": 0, "seconds": 3 }	256,000,000
343_B. Alternating Current	"problem\n\nAOR Ika is studying to pass the test.\n\nAOR Ika-chan solved the $ N $ question. After t(...TRUNCATED)	{"input":["1\n3\n1 2\n2 3\n1\n1\n1\n2\n2\n1\n","2\n6\n1 2\n1 3\n1 4\n4 5\n4 6\n4\n1 3 4 5\n3\n3 5 2\(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["1 10\n8\n1\n2\n3\n4\n5\n6\n7\n13\n9\n16\n","1 10\n2\n1\n2\n3\n4\n5\n6\n7\n8\n3\n16\n","1 (...TRUNCATED)	5	12	{"language":[3,4,3,3,3,2,3,3,1,3,3,2,2,2,1,3,4,2,3,3,2,3,3,3,3,3,3,2,3,3,4,3,1,4,3,3,3,3,4,3,3,3,3,3(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,0,2,2,4,2,2,2,2,0,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,0(...TRUNCATED)	1,227		0	2,500	[ "" ]	false	{ "nanos": 0, "seconds": 1 }	0
963_B. Destruction of a Tree	"E --Disappear Drive\n\nStory\n\nThe person in D likes basketball, but he likes shooting, so other t(...TRUNCATED)	{ "input": [ "777-444---21-12-2013-12-2013-12-2013---444-777\n" ], "output": [ "13-12-2013\n" ] }	{ "input": [], "output": [] }	{ "input": [], "output": [] }	1	8	{"language":[3,4,3,2,2,3,3,1,3,4,2,4,1,3,3,1,1,3,3,2,1,3,2,4,2,3,3,1,3,2,2,2,3,3,1,2,3,4,4,4,3,4,3,3(...TRUNCATED)	{"language":[2,2,2,2,4,2,2,1,2,1,2,2,4,1,4,2,2,2,1,2,2,2,2,4,4,2,2,2,4,1,4,2,2,2,2,2,2,4,2,3,1,1,3,2(...TRUNCATED)	405	E	1,000	0	[ "" ]	true	{ "nanos": 0, "seconds": 2 }	512,000,000
290_D. Orange	"Your math teacher gave you the following problem:\n\nThere are n segments on the x-axis, [l_1; r_1](...TRUNCATED)	{"input":["6 10\nalloc 5\nalloc 3\nerase 1\nalloc 6\ndefragment\nalloc 6\n"],"output":["1\n2\nNULL\n(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["6\n773209925 62005863 473635171 329666981 510631133 207643327\n","1\n2\n","7\n481003311 5(...TRUNCATED)	2	0	{"language":[2,3,4,3,4,3,4,3,3,3,3,2,3,3,4,4,4,3,4,3,2,3,3,4,1,2,3,4,3,2,1,3,4,3,3,4,4,3,1,1,3,3,3,3(...TRUNCATED)	{ "language": [], "solution": [] }	615		0	1,900	[ "combinatorics", "divide and conquer" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000