VK Cup 2016 - Round 2

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
641 VK Cup 2016 - Round 2 FINISHED False 7200 270307499 April 24, 2016, 4:35 p.m.

Problems

Solved$
Index
Name
Type
Tags
Community Tag
Rating
( 91 ) G Little Artem and Graph PROGRAMMING 3300

B'Little Artem is given a graph, constructed as follows: start with some k-clique, then add new vertices one by one, connecting them to k already existing vertices that form a k-clique. Artem wants to count the number of spanning trees in this graph modulo 109 xe2 x80 x89+ xe2 x80 x897. First line of the input contains two integers n and k (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n xe2 x80 x89 xe2 x89 xa4 xe2 x80 x8910 xe2 x80 x89000, 1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89k xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89min(n, xe2 x80 x895)) -- the total size of the graph and the size of the initial clique, respectively. Next n xe2 x80 x89- xe2 x80 x89k lines describe k xe2 x80 x89+ xe2 x80 x891-th, k xe2 x80 x89+ xe2 x80 x892-th, ..., i-th, ..., n-th vertices by listing k distinct vertex indices 1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89aij xe2 x80 x89< xe2 x80 x89i it is connected to. It is guaranteed that those vertices form a k-clique. Output a single integer -- the number of spanning trees in the given graph modulo 109 xe2 x80 x89+ xe2 x80 x897. '...

Tutorials

VK Cup 2016 — Раунд 2 (editorial)

Submissions

Submission Id
Author(s)
Index
Submitted
Verdict
Language
Test Set
Tests Passed
Time taken (ms)
Memory Consumed (bytes)
Tags
Rating
35887028 ______M______ G March 3, 2018, 1:57 p.m. OK GNU C++ TESTS 40 77 6041600 3300
28407743 progg_admin G July 10, 2017, 1 p.m. OK GNU C++ TESTS 40 78 7475200 3300
26351138 tlzmybm G April 14, 2017, 6:14 a.m. OK GNU C++ TESTS 40 93 14540800 3300
21057311 jiyutian G Oct. 1, 2016, 5:34 a.m. OK GNU C++ TESTS 40 124 3993600 3300
26350447 Manchery G April 14, 2017, 4:55 a.m. OK GNU C++ TESTS 40 264 6041600 3300
26354106 _LowestJN G April 14, 2017, 10:25 a.m. OK GNU C++ TESTS 40 280 6041600 3300
24703289 Seter G Feb. 15, 2017, 6:48 p.m. OK GNU C++ TESTS 40 10561 3584000 3300
57881678 lopare G July 28, 2019, 8:04 a.m. OK GNU C++11 TESTS 40 93 4096000 3300
57815754 py_ultron G July 26, 2019, 7:36 p.m. OK GNU C++11 TESTS 40 93 4096000 3300
20317613 ntu_vjudge_2 G Sept. 1, 2016, 9:10 a.m. OK GNU C++11 TESTS 40 93 4300800 3300
54502782 WOSHIGEPACHONG2 G May 23, 2019, 12:17 a.m. OK GNU C++11 TESTS 40 93 5632000 3300
25355775 Light_Kiss G March 9, 2017, 8:32 a.m. OK GNU C++11 TESTS 40 93 7372800 3300
37237341 zhouyuyang G April 12, 2018, 1:53 a.m. OK GNU C++11 TESTS 40 93 7577600 3300
18035022 AmZ G May 22, 2016, 6:38 p.m. OK GNU C++11 TESTS 40 93 7680000 3300
17531872 C3Z G April 27, 2016, 7:19 a.m. OK GNU C++11 TESTS 40 93 7782400 3300
20293061 ntu_vjudge_1 G Aug. 31, 2016, 3:07 a.m. OK GNU C++11 TESTS 40 109 4300800 3300
20293055 eddy1021 G Aug. 31, 2016, 3:06 a.m. OK GNU C++11 TESTS 40 109 4300800 3300
23458724 Ali.Pi G Dec. 30, 2016, 9:55 p.m. OK GNU C++14 TESTS 40 93 7372800 3300
49548812 black_horse2014 G Feb. 7, 2019, 3:17 a.m. OK GNU C++14 TESTS 40 124 4403200 3300
32283347 NiroBC G Nov. 13, 2017, 12:07 p.m. OK GNU C++14 TESTS 40 514 2662400 3300
51155384 yasugongshang G March 11, 2019, 10:24 a.m. OK GNU C++14 TESTS 40 11325 3072000 3300
51148485 yasugongshang G March 11, 2019, 5:56 a.m. OK GNU C++14 TESTS 40 11356 4096000 3300
69720360 gongsuidashen G Jan. 29, 2020, 10:25 a.m. OK GNU C++17 TESTS 40 109 5734400 3300
19213289 Los_Angelos_Laycurse G July 18, 2016, 1:23 p.m. OK MS C++ TESTS 40 405 14438400 3300

remove filters

Back to search problems