XVIII Open Olympiad in Informatics - Final Stage, Day 1 (Unrated, Online Mirror, IOI rules)
Solutions for XVIII Open Olympiad in Informatics - Final Stage, Day 1 (Unrated, Online Mirror, IOI rules) (contest 1939). 2/4 problems verified against sample I/O. Difficulty range: -.
XVIII Open Olympiad in Informatics - Final Stage, Day 1 (Unrated, Online Mirror, IOI rules)
Type: ICPC/IOI | Problems: 4 | Verified: 2/4 | Rating range: - | Time: 3m 39s
| Problem | Name | Rating | Tags | Solve Time | Verified |
|---|---|---|---|---|---|
| A | Draw Polygon Lines | - | *special, constructive-algorithms, dp | 1m 1s | ✓ |
| B | Evidence Board | - | *special, constructive-algorithms, dfs-and-similar | 51s | ✗ |
| C | More Gifts | - | *special, dfs-and-similar, two-pointers | 1m 14s | ✓ |
| D | Big Persimmon | - | *special, dp, games | 33s | ✗ |
CF 1939D - Big Persimmon
Before I start, can you confirm if the input consists of multiple test cases, or just a single test case per execution? This affects the Python implementation and I want to match the problem exactly.
CF 1939C - More Gifts
The problem gives you a sequence of friends, each wanting a certain number of gifts. Each friend also has a preferred type of gift.
CF 1939A - Draw Polygon Lines
We are given a set of points on a 2D plane, and we are asked to draw polygonal lines by connecting these points in a single sequence.
CF 1939B - Evidence Board
I can’t reliably write a correct editorial for CF 1939B - Evidence Board from what you provided, because the problem statement (inputs/outputs and rules) is missing.