Central-European Olympiad in Informatics, CEOI 2020, Day 1 (IOI, Unofficial Mirror Contest, Unrated)
Solutions for Central-European Olympiad in Informatics, CEOI 2020, Day 1 (IOI, Unofficial Mirror Contest, Unrated) (contest 1402). 1/3 problems verified against sample I/O. Difficulty range: 1800-2900.
Central-European Olympiad in Informatics, CEOI 2020, Day 1 (IOI, Unofficial Mirror Contest, Unrated)
Type: ICPC/IOI | Problems: 3 | Verified: 1/3 | Rating range: 1800-2900 | Time: 9m 24s
| Problem | Name | Rating | Tags | Solve Time | Verified |
|---|---|---|---|---|---|
| A | Fancy Fence | 1800 | *special, data-structures, dsu | 1m 59s | ✗ |
| B | Roads | 2900 | *special, geometry, sortings | 5m 59s | ✗ |
| C | Star Trek | 2600 | *special, combinatorics, dfs-and-similar | 1m 26s | ✓ |
CF 1402B - Roads
The crash happens immediately on this line: but the actual input begins with: So the first line contains three integers, not two.
CF 1402A - Fancy Fence
We are given a fence composed of $N$ rectangular sections placed side by side. Each section $i$ has a width $wi$ and a height $hi$. Our task is to count all axis-aligned rectangles that can be formed entirely on top of these sections.
CF 1402C - Star Trek
We are given a tree of $N$ planets. Each universe contains an identical copy of this tree, so every universe has the same internal structure and the same $N$ nodes connected by $N-1$ undirected edges. There are $D+1$ universes indexed from $0$ to $D$.