Description
Union Find
Objectively the best data structure. I don't want to hear otherwise
Problems:
- Easy (A-B)
- Medium (C-E)
- Hard (F)
599.4 Get 7 points:
- Easy = 1 point
- Medium = 3 points
- Hard = 5 points
Start & End Times
| Start Time | 2025-03-05 00:30 CET |
| End time | 2025-03-11 23:00 CET |
Problems
| Label | Problem |
|---|---|
| A | Graduation |
| B | Tildes |
| C | Forests |
| D | Number Sets |
| E | Swap to Sort |
| F | A Feast For Cats |
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