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 |
---|---|---|---|---|---|---|
1320 | Codeforces Round 625 (Div. 1, based on Technocup 2020 Final Round) | FINISHED | False | 7200 | 148754699 | March 1, 2020, 1:15 p.m. |
Solved$ |
Index |
Name |
Type |
Tags |
Community Tag |
Rating |
---|---|---|---|---|---|---|
( 161 ) | F | Blocks and Sensors | PROGRAMMING |
B"Polycarp plays a well-known computer game (we won't mention its name). Every object in this game consists of three-dimensional blocks -- axis-aligned cubes of size 1 x 1 x 1 . These blocks are unaffected by gravity, so they can float in the air without support. The blocks are placed in cells of size 1 x 1 x 1 ; each cell either contains exactly one block or is empty. Each cell is represented by its coordinates (x, y, z) (the cell with these coordinates is a cube with opposite corners in (x, y, z) and (x + 1, y + 1, z + 1) ) and its contents a_{x, y, z} ; if the cell is empty, then a_{x, y, z} = 0 , otherwise a_{x, y, z} is equal to the type of the block placed in it (the types are integers from 1 to 2 cdot 10^5 ). Polycarp has built a large structure consisting of blocks. This structure can be enclosed in an axis-aligned rectangular parallelepiped of size n x m x k , containing all cells (x, y, z) such that x in [1, n] , y in [1, m] , and z in [1, k] . After that, Polycarp has installed 2nm + 2nk + 2mk sensors around this parallelepiped. A sensor is a special block that sends a ray in some direction and shows the type of the first block that was hit by this ray (except for other sensors). The sensors installed by Polycarp are adjacent to the borders of the parallelepiped, and the rays sent by them are parallel to one of the coordinate axes and directed inside the parallelepiped. More formally, the sensors can be divided into 6 types: Polycarp has invited his friend Monocarp to play with him. Of course, as soon as Monocarp saw a large parallelepiped bounded by sensor blocks, he began to wonder what was inside of it. Polycarp didn't want to tell Monocarp the exact shape of the figure, so he provided Monocarp with the data from all sensors and told him to try guessing the contents of the parallelepiped by himself. After some hours of "... |
Codeforces Round #625 Editorial |
Submission Id |
Author(s) |
Index |
Submitted |
Verdict |
Language |
Test Set |
Tests Passed |
Time taken (ms) |
Memory Consumed (bytes) |
Tags |
Rating |
---|---|---|---|---|---|---|---|---|---|---|---|
72198337 | FizzyDavid | F | March 1, 2020, 2:58 p.m. | OK | GNU C++11 | TESTS | 79 | 124 | 8192000 | ||
72196293 | fateice | F | March 1, 2020, 2:49 p.m. | OK | GNU C++11 | TESTS | 79 | 187 | 5017600 | ||
72216255 | cookiedoth | F | March 1, 2020, 8:29 p.m. | OK | GNU C++11 | TESTS | 79 | 670 | 63795200 | ||
72198154 | Rafbill | F | March 1, 2020, 2:57 p.m. | OK | GNU C++17 | TESTS | 79 | 546 | 147968000 | ||
72202332 | ksun48 | F | March 1, 2020, 3:14 p.m. | OK | GNU C++17 | TESTS | 79 | 624 | 75468800 | ||
72205107 | Benq | F | March 1, 2020, 4:36 p.m. | OK | GNU C++17 | TESTS | 79 | 686 | 286924800 |
Back to search problems