Codeforces Round 483 (Div. 1) [Thanks, Botan Investments and Victor Shaburov!]
3 problems from Codeforces Round 483 (Div. 1) [Thanks, Botan Investments and Victor Shaburov!] (contest 983), difficulty 1800-2800. 1/3 solutions verified against sample I/O.
Codeforces Round 483 (Div. 1) [Thanks, Botan Investments and Victor Shaburov!]
Div. 1 | 3 problems | 1/3 verified | Difficulty 1800-2800 | 5m 20s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| B | XOR-pyramid | 1800 | dp | 6,306 | 1m 20s | ✓ |
| C | Elevator | 2400 | dp, graphs, shortest-paths | 932 | 2m 11s | |
| E | NN country | 2800 | binary-search, data-structures, trees | 1,199 | 1m 49s |
CF 983E - NN country
The road network forms a tree of cities, so between any two cities there is exactly one simple path. On top of this fixed tree structure, there are additional “bus routes” between pairs of cities.
CF 983C - Elevator
We are controlling a single elevator in a small building with nine floors, and we must serve a sequence of people in a fixed arrival order. Each person starts on some floor and wants to reach another floor.
CF 983B - XOR-pyramid
We are given an array and many queries over its segments. Each query asks us to look at a contiguous part of the array, consider every possible subsegment inside it, and compute a special function on each subsegment.