Codeforces Round 707 (Div. 2, based on Moscow Open Olympiad in Informatics)
Solutions for Codeforces Round 707 (Div. 2, based on Moscow Open Olympiad in Informatics) (contest 1501). 0/2 problems verified against sample I/O. Difficulty range: 800-900.
Codeforces Round 707 (Div. 2, based on Moscow Open Olympiad in Informatics)
Type: Div. 2 | Problems: 2 | Verified: 0/2 | Rating range: 800-900 | Time: 4m 43s
| Problem | Name | Rating | Tags | Solve Time | Verified |
|---|---|---|---|---|---|
| A | Alexey and Train | 800 | implementation | 2m 28s | ✗ |
| B | Napoleon Cake | 900 | dp, implementation, sortings | 2m 15s | ✗ |
CF 1501A - Alexey and Train
We are given the planned schedule of a train. For each station i, the schedule says the train is supposed to arrive at time a[i] and depart at time b[i]. Bad weather causes delays while travelling between stations. For each segment, we know an extra delay tm[i].
CF 1501B - Napoleon Cake
We build the cake layer by layer. After placing the i-th layer, we pour a[i] units of cream onto the top. That cream spreads downward and covers the top a[i] layers currently present. If there are fewer than a[i] layers, every existing layer becomes covered.