Codeforces Round 468 (Div. 2, based on Technocup 2018 Final Round)
2 problems from Codeforces Round 468 (Div. 2, based on Technocup 2018 Final Round) (contest 931), difficulty 800-1200. 2/2 solutions verified against sample I/O.
Codeforces Round 468 (Div. 2, based on Technocup 2018 Final Round)
Div. 2 | 2 problems | 2/2 verified | Difficulty 800-1200 | 2m 16s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Friends Meeting | 800 | brute-force, greedy, implementation | 13,088 | 1m 8s | ✓ |
| B | World Cup | 1200 | constructive-algorithms, implementation | 7,456 | 1m 8s | ✓ |
Practice
›
Codeforces Solutions
›
Codeforces Round 468 (Div. 2, based on Technocup 2018 Final Round)
›
CF 931A - Friends Meeting
Two people stand on a number line at integer coordinates $a$ and $b$. They want to end up at the same integer position, and each of them can move one step left or right any number of times. The twist is that movement cost is not linear.
Practice
›
Codeforces Solutions
›
Codeforces Round 468 (Div. 2, based on Technocup 2018 Final Round)
›
CF 931B - World Cup
We are given a single-elimination tournament with $n$ teams labeled from 1 to $n$. The structure of the tournament is fixed and mechanical: in every round, the remaining teams are sorted by their original labels, then paired consecutively, so team 1 plays 2, 3 plays 4, and so on.