Технокубок 2017 - Финал (только для онсайт-финалистов)

Solutions are presented as using the least memory and the fastest execution time. It also takes the top 10 most recent solutions from each language. If you want to limit to a specific index, click the "Solved" button and go to that problem.

ContestId
Name
Phase
Frozen
Duration (Seconds)
Relative Time
Start Time
780 Технокубок 2017 - Финал (только для онсайт-финалистов) FINISHED False 10800 287700323 March 5, 2017, 9:15 a.m.

Problems

Solved
Index
Name
Type
Tags
Community Tag
Rating
( 2964 ) E Underground Lab PROGRAMMING constructive algorithms dfs and similar graphs 2200

The evil Bumbershoot corporation produces clones for gruesome experiments in a vast underground lab. On one occasion, the corp cloned a boy Andryusha who was smarter than his comrades. Immediately Andryusha understood that something fishy was going on there. He rallied fellow clones to go on a feud against the evil corp, and they set out to find an exit from the lab. The corp had to reduce to destroy the lab complex. The lab can be pictured as a connected graph with n vertices and m edges. k clones of Andryusha start looking for an exit in some of the vertices. Each clone can traverse any edge once per second. Any number of clones are allowed to be at any vertex simultaneously. Each clone is allowed to stop looking at any time moment, but he must look at his starting vertex at least. The exit can be located at any vertex of the lab, hence each vertex must be visited by at least one clone. Each clone can visit at most vertices before the lab explodes. Your task is to choose starting vertices and searching routes for the clones. Each route can have at most vertices. The first line contains three integers n , m , and k ( 1 ≤ n ≤ 2·10 5 , n - 1 ≤ m ≤ 2·10 5 , 1 ≤ k ≤ n ) — the number of vertices and edges in the lab, and the number of clones. Each of the next m lines contains two integers x i and y i ( 1 ≤ x i , y i ≤ n ) — indices of vertices connected by the respective edge. The graph is allowed to have self-loops and multiple edges. The graph is guaranteed to be connected. You should print k lines. i -th of these lines must start with an integer c i ( ) — the number of vertices visited by i -th clone, followed by c i integers — indices of vertices visited by this clone in the order of visiting. You have to print each vertex every time it is visited, regardless if it was visited earlier or not. It is guaranteed that a valid answer exists. In the first sample case there is only one clone who may visit vertices in order (2, 1, 3), which fits the constraint of

Tutorials

Technocup 2017 Finals and Codeforces Round #403 Editorial

Submissions

Submission Id
Author(s)
Index
Submitted
Verdict
Language
Test Set
Tests Passed
Time taken (ms)
Memory Consumed (bytes)
Tags
Rating
25430154 StarScreamOwl E March 12, 2017, 9:52 a.m. OK Delphi TESTS 67 140 17408000 2200
29154005 MrMorning E Aug. 3, 2017, 11:30 a.m. OK GNU C++ TESTS 67 140 15667200 2200
25648775 limuyang01 E March 19, 2017, 2:45 p.m. OK GNU C++ TESTS 67 187 12185600 2200
29195259 CSHwang E Aug. 4, 2017, 1:37 p.m. OK GNU C++ TESTS 67 187 13209600 2200
25497228 CommonAnts E March 15, 2017, 12:04 p.m. OK GNU C++ TESTS 67 187 18944000 2200
25971338 SpoonsAN E March 31, 2017, 8:26 a.m. OK GNU C++ TESTS 67 202 15667200 2200
25789912 vjudge2 E March 25, 2017, 6:43 a.m. OK GNU C++ TESTS 67 202 16691200 2200
25890233 honey_l E March 29, 2017, 7:55 a.m. OK GNU C++ TESTS 67 217 14950400 2200
25980435 CJQ_PP E March 31, 2017, 1:52 p.m. OK GNU C++ TESTS 67 218 18124800 2200
25242449 programmer228 E March 5, 2017, 11:15 a.m. OK GNU C++ TESTS 66 218 18534400 2200
27553817 vjudge5 E June 4, 2017, 1:53 a.m. OK GNU C++ TESTS 67 233 12902400 2200
40982098 ReaLNero1 E July 30, 2018, 6:16 p.m. OK GNU C++11 TESTS 67 77 11366400 2200
47604462 luogu_bot1 E Dec. 28, 2018, 3:26 a.m. OK GNU C++11 TESTS 67 156 11878400 2200
39234649 luogu_bot5 E June 14, 2018, 7:41 a.m. OK GNU C++11 TESTS 67 187 11878400 2200
47604431 luogu_bot1 E Dec. 28, 2018, 3:24 a.m. OK GNU C++11 TESTS 67 187 19558400 2200
25438378 zedyz E March 12, 2017, 3:43 p.m. OK GNU C++11 TESTS 67 202 15564800 2200
47108265 Daniel_Yeh E Dec. 16, 2018, 2:08 p.m. OK GNU C++11 TESTS 67 202 18227200 2200
51062646 jxf378440404 E March 9, 2019, 4:07 a.m. OK GNU C++11 TESTS 67 217 16179200 2200
39234717 luogu_bot3 E June 14, 2018, 7:44 a.m. OK GNU C++11 TESTS 67 218 11980800 2200
30036377 Jayzhang E Sept. 3, 2017, 1:46 p.m. OK GNU C++11 TESTS 67 218 15667200 2200
27527695 gaabs E June 2, 2017, 4:07 p.m. OK GNU C++11 TESTS 67 218 18534400 2200
30019536 _AjReme_ E Sept. 2, 2017, 7:32 p.m. OK GNU C++14 TESTS 67 139 15667200 2200
30019306 _AjReme_ E Sept. 2, 2017, 7:12 p.m. OK GNU C++14 TESTS 67 140 18534400 2200
26966857 NiroBC E May 9, 2017, 3:15 a.m. OK GNU C++14 TESTS 67 187 8806400 2200
25545999 YOULLNEVERWA E March 16, 2017, 11:10 a.m. OK GNU C++14 TESTS 67 187 16281600 2200
25823844 LordVoldebug E March 26, 2017, 4:39 p.m. OK GNU C++14 TESTS 67 187 16486400 2200
25242751 mik E March 5, 2017, 11:24 a.m. OK GNU C++14 TESTS 66 187 16486400 2200
27699088 vjudge5 E June 10, 2017, 2:56 a.m. OK GNU C++14 TESTS 67 187 186470400 2200
27699075 winter2121 E June 10, 2017, 2:55 a.m. OK GNU C++14 TESTS 67 187 186470400 2200
65455514 Tanmoy_Datta E Nov. 20, 2019, 8:18 p.m. OK GNU C++14 TESTS 67 202 13312000 2200
50101419 nyamaga E Feb. 18, 2019, 3:06 p.m. OK GNU C++14 TESTS 67 202 15155200 2200
47508873 Ajax E Dec. 26, 2018, 4:41 a.m. OK GNU C++17 TESTS 67 187 15155200 2200
46951435 ignifi E Dec. 12, 2018, 8:50 p.m. OK GNU C++17 TESTS 67 202 13107200 2200
49550062 0442A403 E Feb. 7, 2019, 4:57 a.m. OK GNU C++17 TESTS 67 217 14950400 2200
59669962 Phortox E Aug. 29, 2019, 3:38 p.m. OK GNU C++17 TESTS 67 217 15257600 2200
50273304 MazyCrazy E Feb. 21, 2019, 8:31 a.m. OK GNU C++17 TESTS 67 217 15769600 2200
61344558 qcwlmqy E Sept. 27, 2019, 3:32 a.m. OK GNU C++17 TESTS 67 218 29491200 2200
68059094 kobortor E Jan. 2, 2020, 1:26 a.m. OK GNU C++17 TESTS 67 233 16076800 2200
58519410 Mai-sanBestWaifu E Aug. 10, 2019, 3:19 a.m. OK GNU C++17 TESTS 67 233 16588800 2200
49521723 eg322 E Feb. 6, 2019, 8:27 a.m. OK GNU C++17 TESTS 67 233 25907200 2200
50812476 vjudge2 E March 5, 2019, 9:36 a.m. OK GNU C++17 TESTS 67 248 16384000 2200
43348335 AQT E Sept. 23, 2018, 10:44 p.m. OK Java 8 TESTS 67 577 79974400 2200
25570563 alibaba E March 17, 2017, 11:37 a.m. OK Java 8 TESTS 67 639 77721600 2200
25497125 esbybb E March 15, 2017, noon OK Java 8 TESTS 67 701 98611200 2200
27060456 Slamur E May 12, 2017, 6:32 p.m. OK Java 8 TESTS 67 733 66355200 2200
27060012 IDzekh E May 12, 2017, 5:59 p.m. OK Java 8 TESTS 67 764 82022400 2200
25517864 esbybb E March 15, 2017, 4:09 p.m. OK Java 8 TESTS 67 826 193843200 2200
25553489 sintax_eror E March 16, 2017, 3:25 p.m. OK Java 8 TESTS 67 997 146227200 2200
25692751 Alexey E March 21, 2017, 2:31 p.m. OK MS C++ TESTS 67 265 42905600 2200
28251486 ze177482 E July 3, 2017, 9:56 a.m. OK MS C++ TESTS 67 639 16588800 2200

remove filters

Back to search problems