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 |
---|---|---|---|---|---|---|
1280 | Codeforces Round 607 (Div. 1) | FINISHED | False | 7200 | 155436899 | Dec. 15, 2019, 5:05 a.m. |
Solved$ |
Index |
Name |
Type |
Tags |
Community Tag |
Rating |
---|---|---|---|---|---|---|
( 66 ) | F | Intergalactic Sliding Puzzle | PROGRAMMING | combinatorics constructive algorithms math | 3400 |
B"You are an intergalactic surgeon and you have an alien patient. For the purposes of this problem, we can and we will model this patient's body using a 2 x (2k + 1) rectangular grid. The alien has 4k + 1 distinct organs, numbered 1 to 4k + 1 . In healthy such aliens, the organs are arranged in a particular way. For example, here is how the organs of a healthy such alien would be positioned, when viewed from the top, for k = 4 : Here, the E represents empty space. In general, the first row contains organs 1 to 2k + 1 (in that order from left to right), and the second row contains organs 2k + 2 to 4k + 1 (in that order from left to right) and then empty space right after. Your patient's organs are complete, and inside their body, but they somehow got shuffled around! Your job, as an intergalactic surgeon, is to put everything back in its correct position. All organs of the alien must be in its body during the entire procedure. This means that at any point during the procedure, there is exactly one cell (in the grid) that is empty. In addition, you can only move organs around by doing one of the following things: Your job is to figure out a sequence of moves you must do during the surgical procedure in order to place back all 4k + 1 internal organs of your patient in the correct cells. If it is impossible to do so, you must say so. The first line of input contains a single integer t ( 1 <= t <= 4 ) denoting the number of test cases. The next lines contain descriptions of the test cases. Each test case consists of three lines. The first line contains a single integer k ( 1 <= k <= 15 ) which determines the size of the grid. Then two lines follow. Each of them contains 2k + 1 space-separated integers or the letter E. They describe the first and second rows of organs, respectively. It is guaranteed that all 4k + 1 organs are present and there is exactly one E. For"... |
Codeforces Round #607 Editorial |
Submission Id |
Author(s) |
Index |
Submitted |
Verdict |
Language |
Test Set |
Tests Passed |
Time taken (ms) |
Memory Consumed (bytes) |
Tags |
Rating |
---|---|---|---|---|---|---|---|---|---|---|---|
67325431 | frodakcin | F | Dec. 21, 2019, 9:35 a.m. | OK | GNU C++11 | TESTS | 84 | 31 | 0 | 3400 | |
67075413 | yyf0309 | F | Dec. 17, 2019, 2:17 p.m. | OK | GNU C++11 | TESTS | 84 | 31 | 0 | 3400 | |
66982729 | lavanyakeshwathkar | F | Dec. 15, 2019, 5 p.m. | OK | GNU C++11 | TESTS | 84 | 31 | 0 | 3400 | |
66975266 | NADIDADIT | F | Dec. 15, 2019, 2:28 p.m. | OK | GNU C++11 | TESTS | 84 | 31 | 0 | 3400 | |
67051777 | atoiz | F | Dec. 17, 2019, 4:34 a.m. | OK | GNU C++11 | TESTS | 84 | 77 | 0 | 3400 | |
68972486 | luogu_bot2 | F | Jan. 17, 2020, 7:32 a.m. | OK | GNU C++14 | TESTS | 84 | 31 | 0 | 3400 | |
68379492 | Motarack | F | Jan. 7, 2020, 10:48 p.m. | OK | GNU C++14 | TESTS | 84 | 31 | 0 | 3400 | |
67849760 | khanfar24 | F | Dec. 29, 2019, 1:46 a.m. | OK | GNU C++14 | TESTS | 84 | 31 | 0 | 3400 | |
67038517 | Benq | F | Dec. 16, 2019, 6:17 p.m. | OK | GNU C++14 | TESTS | 84 | 31 | 0 | 3400 | |
66997589 | Benq | F | Dec. 16, 2019, 3:20 a.m. | OK | GNU C++14 | TESTS | 84 | 46 | 0 | 3400 | |
67263378 | user202729_ | F | Dec. 20, 2019, 4:51 a.m. | OK | GNU C++17 | TESTS | 84 | 30 | 0 | 3400 | |
69183884 | gongsuidashen | F | Jan. 20, 2020, 11:15 a.m. | OK | GNU C++17 | TESTS | 84 | 31 | 0 | 3400 | |
68122848 | Xellos | F | Jan. 3, 2020, 2 p.m. | OK | GNU C++17 | TESTS | 84 | 31 | 0 | 3400 | |
67135040 | Intrincantation | F | Dec. 18, 2019, 3:34 a.m. | OK | GNU C++17 | TESTS | 84 | 31 | 0 | 3400 | |
67130791 | RNS_CUS | F | Dec. 17, 2019, 11:50 p.m. | OK | GNU C++17 | TESTS | 84 | 31 | 0 | 3400 | |
66936996 | ecnerwala | F | Dec. 15, 2019, 8:45 a.m. | OK | GNU C++17 | TESTS | 84 | 31 | 0 | 3400 | |
67311416 | aid | F | Dec. 21, 2019, 3:09 a.m. | OK | GNU C++17 | TESTS | 84 | 31 | 204800 | 3400 | |
67164329 | Nakagawa.Kanon | F | Dec. 18, 2019, 3 p.m. | OK | GNU C++17 | TESTS | 84 | 31 | 204800 | 3400 | |
67046309 | icecuber | F | Dec. 16, 2019, 10:43 p.m. | OK | GNU C++17 | TESTS | 84 | 31 | 204800 | 3400 | |
66930593 | scott_wu | F | Dec. 15, 2019, 7:25 a.m. | OK | GNU C++17 | TESTS | 84 | 31 | 204800 | 3400 | |
67494234 | Kartik_Chauhan | F | Dec. 23, 2019, 9:14 p.m. | OK | PyPy 3 | TESTS | 84 | 155 | 0 | 3400 | |
67516117 | manalijain002 | F | Dec. 24, 2019, 10:54 a.m. | OK | Python 3 | TESTS | 84 | 109 | 307200 | 3400 | |
67026155 | kevinsogo | F | Dec. 16, 2019, 2:23 p.m. | OK | Python 3 | TESTS | 84 | 109 | 307200 | 3400 | |
67016209 | kevinsogo | F | Dec. 16, 2019, 11:33 a.m. | OK | Python 3 | TESTS | 84 | 124 | 307200 | 3400 | |
67752442 | Isomorphism | F | Dec. 27, 2019, 6:15 p.m. | OK | Python 3 | TESTS | 84 | 139 | 819200 | 3400 |
Back to search problems