Codeforces Round 541 (Div. 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
1131 Codeforces Round 541 (Div. 2) FINISHED False 7200 186521987 Feb. 23, 2019, 10:20 a.m.

Problems

Solved$
Index
Name
Type
Tags
Community Tag
Rating
( 456 ) G Most Dangerous Shark PROGRAMMING data structures dp two pointers 2900

B'Semyon participates in the most prestigious competition of the world ocean for the title of the most dangerous shark. During this competition sharks compete in different subjects: speed swimming, masking, map navigation and many others. Now Semyon is taking part in xc2 xabdestruction xc2 xbb contest. During it, m dominoes are placed in front of the shark. All dominoes are on the same line, but the height of the dominoes may vary. The distance between adjacent dominoes is 1 . Moreover, each Domino has its own cost value, expressed as an integer. The goal is to drop all the dominoes. To do this, the shark can push any domino to the left or to the right, and it will begin falling in this direction. If during the fall the domino touches other dominoes, they will also start falling in the same direction in which the original domino is falling, thus beginning a chain reaction, as a result of which many dominoes can fall. A falling domino touches another one, if and only if the distance between them was strictly less than the height of the falling domino, the dominoes do not necessarily have to be adjacent. Of course, any shark can easily drop all the dominoes in this way, so the goal is not to drop all the dominoes, but do it with a minimum cost. The cost of the destruction is the sum of the costs of dominoes that the shark needs to push to make all the dominoes fall. Simon has already won in the previous subjects, but is not smart enough to win in this one. Help Semyon and determine the minimum total cost of the dominoes he will have to push to make all the dominoes fall. In order to reduce input size, the heights and costs of the dominoes are described with blocks. The first line contains two integers n and m ( 1 <= q n <= q 250 ,000, 1 <= q m <= q 10^7 ) -- the number of the blocks and the total number of the dominoes Semyon must drop. Then descriptions of n blocks follow. Description of every block consists of three lines. The first l'...

Tutorials

Codeforces Round #541 Editorial

Submissions

Submission Id
Author(s)
Index
Submitted
Verdict
Language
Test Set
Tests Passed
Time taken (ms)
Memory Consumed (bytes)
Tags
Rating
50926479 luogu_bot3 G March 7, 2019, 12:06 p.m. OK GNU C++11 TESTS 99 280 374784000 2900
50926421 Apachesunset G March 7, 2019, 12:04 p.m. OK GNU C++11 TESTS 99 280 374784000 2900
50926217 Apachesunset G March 7, 2019, 11:58 a.m. OK GNU C++11 TESTS 99 295 374784000 2900
54514441 cppascalinux G May 23, 2019, 9:01 a.m. OK GNU C++11 TESTS 99 296 344780800 2900
50710947 luogu_bot5 G March 3, 2019, 6:49 a.m. OK GNU C++11 TESTS 99 311 415846400 2900
50710926 zqy1018 G March 3, 2019, 6:48 a.m. OK GNU C++11 TESTS 99 311 415846400 2900
50411705 little_waxberry G Feb. 24, 2019, 3:13 a.m. OK GNU C++11 TESTS 99 312 334643200 2900
50624205 SleepZzz G March 1, 2019, 4:42 a.m. OK GNU C++11 TESTS 99 312 454963200 2900
50391752 Ez3qwq G Feb. 23, 2019, 2:11 p.m. OK GNU C++11 TESTS 99 326 415846400 2900
51085815 danagi G March 9, 2019, 12:58 p.m. OK GNU C++11 TESTS 99 327 286617600 2900
50665047 HatsuneMikuo G March 2, 2019, 3:23 a.m. OK GNU C++14 TESTS 99 311 375910400 2900
50418989 liouzhou_101 G Feb. 24, 2019, 8:05 a.m. OK GNU C++14 TESTS 99 327 335872000 2900
50418920 liouzhou_101 G Feb. 24, 2019, 8:03 a.m. OK GNU C++14 TESTS 99 342 335872000 2900
50419073 liouzhou_101 G Feb. 24, 2019, 8:07 a.m. OK GNU C++14 TESTS 99 343 335872000 2900
50418574 liouzhou_101 G Feb. 24, 2019, 7:54 a.m. OK GNU C++14 TESTS 99 358 335872000 2900
50418857 liouzhou_101 G Feb. 24, 2019, 8:02 a.m. OK GNU C++14 TESTS 99 358 335974400 2900
50664949 interestingLSY G March 2, 2019, 3:18 a.m. OK GNU C++14 TESTS 99 358 375910400 2900
50418653 liouzhou_101 G Feb. 24, 2019, 7:56 a.m. OK GNU C++14 TESTS 99 358 416051200 2900
50483565 ZigZagK G Feb. 25, 2019, 10:23 a.m. OK GNU C++14 TESTS 99 374 323686400 2900
50483901 nickluo G Feb. 25, 2019, 10:35 a.m. OK GNU C++14 TESTS 99 374 445440000 2900
50787651 vjudge3 G March 4, 2019, 2:05 p.m. OK GNU C++17 TESTS 99 358 335872000 2900
50787634 Christopher_Liu G March 4, 2019, 2:04 p.m. OK GNU C++17 TESTS 99 373 335872000 2900
50431574 gchebanov G Feb. 24, 2019, 2:20 p.m. OK GNU C++17 TESTS 99 374 385740800 2900
50503364 markotee G Feb. 25, 2019, 6:20 p.m. OK GNU C++17 TESTS 99 390 294707200 2900
50431510 gchebanov G Feb. 24, 2019, 2:17 p.m. OK GNU C++17 TESTS 99 405 394137600 2900
54491092 albaniliu G May 22, 2019, 3:28 p.m. OK GNU C++17 TESTS 99 452 490291200 2900
50424666 lessmeaning G Feb. 24, 2019, 10:52 a.m. OK GNU C++17 TESTS 99 467 495206400 2900
51047204 akash_aich G March 8, 2019, 7:12 p.m. OK GNU C++17 TESTS 99 468 324608000 2900
55182060 alex_Harry G June 5, 2019, 11:45 p.m. OK GNU C++17 TESTS 99 468 367923200 2900
50779354 fregbe G March 4, 2019, 10:34 a.m. OK GNU C++17 TESTS 99 468 367923200 2900
50740824 2008061626 G March 3, 2019, 3:22 p.m. OK Go TESTS 99 1762 514048000 2900
50580980 sweiss G Feb. 27, 2019, 9:25 p.m. OK Java 8 TESTS 99 701 553574400 2900
52285424 uwi G April 3, 2019, 7:26 p.m. OK Java 8 TESTS 99 826 553164800 2900
52285158 uwi G April 3, 2019, 7:18 p.m. OK Java 8 TESTS 99 842 472883200 2900
52285348 uwi G April 3, 2019, 7:23 p.m. OK Java 8 TESTS 99 872 472883200 2900
50756635 just_soso G March 3, 2019, 5:30 p.m. OK Java 8 TESTS 99 1201 560332800 2900
50582832 NuM G Feb. 27, 2019, 11:32 p.m. OK MS C++ TESTS 99 1777 512512000 2900
50880933 shivawu G March 6, 2019, 8:50 a.m. OK Rust TESTS 99 717 489881600 2900
50880448 shivawu G March 6, 2019, 8:40 a.m. OK Rust TESTS 99 967 489881600 2900

remove filters

Back to search problems