Description
Theme. Everything overlaps! This contest focuses on 1-D and 2-D problems where the key ideas are intervals, intersections, and line-sweep techniques. Expect two-pointer scans, greedy interval selection/covering, event sweeps with active sets, and a 2-D sweep with coordinate compression.
Start & End Times
| Start Time | 2025-09-06 16:00 CEST |
| End time | 2025-09-13 16:00 CEST |
Problems
| Label | Problem |
|---|---|
| A | Interval Scheduling |
| B | Sauna |
| C | Intersecting Rectangles |
| D | Interval Cover |
| E | Interval Scheduling |
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.
Languages
Ada Algol 68 APL Bash C C# C++ COBOL Common Lisp Crystal D Dart Elixir Erlang F# Forth Fortran Go Haskell Java JavaScript (Node.js) JavaScript (SpiderMonkey) Julia Kotlin Lua Modula-2 Nim Objective-C OCaml Octave Odin Pascal Perl PHP Prolog Python 2 Python 3 Racket Ruby Rust Simula 67 Smalltalk SNOBOL Swift TypeScript Visual Basic Zig