The Unofficial Mirror Contest of 19th Thailand Olympiad in Informatics Day 1
3 problems from The Unofficial Mirror Contest of 19th Thailand Olympiad in Informatics Day 1 (contest 104390), difficulty -. 2/3 solutions verified against sample I/O.
The Unofficial Mirror Contest of 19th Thailand Olympiad in Informatics Day 1
Special | 3 problems | 2/3 verified | Difficulty - | 5m 37s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Merge | 2m 58s | ✓ | |||
| B | Explorer | 1m 12s | ✓ | |||
| C | Jewelry Necklace | 1m 27s |
CF 104390A - Merge
Two people report charging stations along a line. Each station has a position and a number of outlets. We effectively build a multiset of positions where each position appears multiple times according to how many outlets exist there. Mr.
CF 104390C - Jewelry Necklace
We are given a binary string representing a line of suppliers. Each position contributes either a real gemstone or a fake one. A necklace is formed by choosing any contiguous segment of this string.
CF 104390B - Explorer
We are given a tree with $N$ rooms. Alongside the tree structure, we also receive a long sequence of length $2N-1$, which comes from an older exploration process that behaves like a depth-first traversal but records visits differently: every time a room is entered, its label…