Codeforces Raif Round 1 (Div. 1 + 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
1428 Codeforces Raif Round 1 (Div. 1 + Div. 2) FINISHED False 9000 134326463 Oct. 17, 2020, 1:05 p.m.

Problems

Solved$
Index
Name
Type
Tags
Community Tag
Rating
( 109 ) H Rotary Laser Lock PROGRAMMING binary search interactive

B'This is an interactive problem. To prevent the mischievous rabbits from freely roaming around the zoo, Zookeeper has set up a special lock for the rabbit enclosure. This lock is called the Rotary Laser Lock. The lock consists of n concentric rings numbered from 0 to n-1 . The innermost ring is ring 0 and the outermost ring is ring n-1 . All rings are split equally into nm sections each. Each of those rings contains a single metal arc that covers exactly m contiguous sections. At the center of the ring is a core and surrounding the entire lock are nm receivers aligned to the nm sections. The core has nm lasers that shine outward from the center, one for each section. The lasers can be blocked by any of the arcs. A display on the outside of the lock shows how many lasers hit the outer receivers. In the example above, there are n=3 rings, each covering m=4 sections. The arcs are colored in green (ring 0 ), purple (ring 1 ), and blue (ring 2 ) while the lasers beams are shown in red. There are nm=12 sections and 3 of the lasers are not blocked by any arc, thus the display will show 3 in this case. Wabbit is trying to open the lock to free the rabbits, but the lock is completely opaque, and he cannot see where any of the arcs are. Given the relative positions of the arcs, Wabbit can open the lock on his own. To be precise, Wabbit needs n-1 integers p_1,p_2, ldots,p_{n-1} satisfying 0 <= q p_i < nm such that for each i (1 <= q i < n) , Wabbit can rotate ring 0 clockwise exactly p_i times such that the sections that ring 0 covers perfectly aligns with the sections that ring i covers. In the example above, the relative positions are p_1 = 1 and p_2 = 7 . To operate the lock, he can pick any of the n rings and rotate them by 1 section either clockwise or anti-clockwise. You will s'...

Tutorials

Codeforces Raif Round 1 Editorial

Submissions

Submission Id
Author(s)
Index
Submitted
Verdict
Language
Test Set
Tests Passed
Time taken (ms)
Memory Consumed (bytes)
Tags
Rating
95818498 gongsuidashen H Oct. 17, 2020, 6:05 p.m. OK GNU C++11 TESTS 138 140 102400
95813358 sh1194 H Oct. 17, 2020, 4:51 p.m. OK GNU C++17 TESTS 138 140 307200
95812329 sh1194 H Oct. 17, 2020, 4:40 p.m. OK GNU C++17 TESTS 138 171 307200
95812859 sh1194 H Oct. 17, 2020, 4:45 p.m. OK GNU C++17 TESTS 138 186 307200
95813073 sh1194 H Oct. 17, 2020, 4:48 p.m. OK GNU C++17 TESTS 138 187 307200
95817597 _rs_ H Oct. 17, 2020, 5:50 p.m. OK GNU C++17 TESTS 138 202 204800
95812566 sh1194 H Oct. 17, 2020, 4:42 p.m. OK GNU C++17 TESTS 138 218 307200
95819273 yosupo H Oct. 17, 2020, 6:16 p.m. OK GNU C++17 (64) TESTS 138 186 204800
95822989 Benq H Oct. 17, 2020, 7:19 p.m. OK GNU C++17 (64) TESTS 138 187 0
95813309 kotrex96 H Oct. 17, 2020, 4:51 p.m. OK MS C++ 2017 TESTS 138 202 0
95832565 FlakeLCR H Oct. 18, 2020, 12:34 a.m. OK PyPy 3 TESTS 138 764 9216000
95836664 FlakeLCR H Oct. 18, 2020, 3:13 a.m. OK PyPy 3 TESTS 138 998 13824000

remove filters

Back to search problems