Codeforces Round 522 (Div. 1, based on Technocup 2019 Elimination Round 3)
1 problems from Codeforces Round 522 (Div. 1, based on Technocup 2019 Elimination Round 3) (contest 1078), difficulty 3400-3400. 1/1 solutions verified against sample I/O.
Codeforces Round 522 (Div. 1, based on Technocup 2019 Elimination Round 3)
Div. 1 | 1 problems | 1/1 verified | Difficulty 3400-3400 | 3m 52s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| E | Negative Time Summation | 3400 | constructive-algorithms | 103 | 3m 52s | ✓ |
Practice
›
Codeforces Solutions
›
Codeforces Round 522 (Div. 1, based on Technocup 2019 Elimination Round 3)
›
CF 1078E - Negative Time Summation
We are given a very unusual computational model: a robot walks on an infinite grid while executing a program, and the grid itself can be rewritten and even “rewound in time”. Two binary integers are initially written on the grid.