XVIII Open Olympiad in Informatics - Final Stage, Day 2 (Unrated, Online Mirror, IOI rules)
Solutions for XVIII Open Olympiad in Informatics - Final Stage, Day 2 (Unrated, Online Mirror, IOI rules) (contest 1940). 3/4 problems verified against sample I/O. Difficulty range: -.
XVIII Open Olympiad in Informatics - Final Stage, Day 2 (Unrated, Online Mirror, IOI rules)
Type: ICPC/IOI | Problems: 4 | Verified: 3/4 | Rating range: - | Time: 4m 17s
| Problem | Name | Rating | Tags | Solve Time | Verified |
|---|---|---|---|---|---|
| A | Parallel Universes | - | *special, constructive-algorithms, dfs-and-similar | 54s | ✗ |
| B | Three Arrays | - | *special, constructive-algorithms, implementation | 1m 23s | ✓ |
| C | Burenka and Pether | - | *special, data-structures, dfs-and-similar | 1m 11s | ✓ |
| D | Almost Certainly | - | *special, constructive-algorithms, data-structures | 49s | ✓ |
CF 1940D - Almost Certainly
We are given several independent test cases. In each test case, there is a collection of elements that behave like values placed on a line or in a multiset, and we are allowed to perform a specific kind of operation that changes how these values are grouped or ordered.
CF 1940B - Three Arrays
We are given three arrays of integers. The task is to find the number of triplets (i, j, k) such that the first array's element a[i] is less than or equal to the second array's element b[j], and the second array's element b[j] is less than or equal to the third array's element…
CF 1940C - Burenka and Pether
We are given a directed structure over positions 1 to n, where each position carries a value. The key restriction is that movement from one position to another is not arbitrary: you are only allowed to move forward in index order, and only along positions whose values satisfy…
CF 1940A - Parallel Universes
This prompt is missing the actual problem statement of CF 1940A - Parallel Universes, so a correct editorial cannot be written yet without guessing the task.