Codeforces Round 623 (Div. 2, based on VK Cup 2019-2020 - Elimination Round, Engine)
2 problems from Codeforces Round 623 (Div. 2, based on VK Cup 2019-2020 - Elimination Round, Engine) (contest 1315), difficulty 1200-1300. 0/2 solutions verified against sample I/O.
Codeforces Round 623 (Div. 2, based on VK Cup 2019-2020 - Elimination Round, Engine)
Div. 2 | 2 problems | 0/2 verified | Difficulty 1200-1300 | 5m 42s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| B | Homecoming | 1300 | binary-search, dp, greedy | 9,608 | 2m 35s | |
| C | Restoring Permutation | 1200 | greedy | 10,654 | 3m 7s |
CF 1315C - Restoring Permutation
We are given a sequence of values that are meant to represent the smaller element in each of several disjoint pairs. In the final construction, we must build an array of length 2n using every number from 1 to 2n exactly once, and then split it into n consecutive pairs.
CF 1315B - Homecoming
We are given a one-dimensional town represented as a line of crossroads indexed from 1 to n. Each position has exactly one type of transport station: either type A (bus-compatible segment marker) or type B (tram-compatible segment marker). The string s encodes this layout.