Start & End Times
| Start Time | 2026-03-20 14:30 CET |
| Length | 2:00:00 |
| End time | 2026-03-20 16:30 CET |
Problems
| Label | Problem |
|---|---|
| A | Useful Algorithm |
| B | Triangulation |
| C | Path Planning 2 |
| D | Minimum Spanning Tree |
| E | Colorful Segments 2 |
| F | Matrix |
Scoring
Pass/Fail — Ranked
Explanation:
Each problem is pass/fail. Participants are ranked by the number of solved problems, breaking ties by penalty (sum of time + 20 minutes per wrong submission, for all solved problems). Time is rounded to minutes.
Standings
- Standings are shown without limitation.