Description
Graph Traversal, MST, SSSP, APSP, Special Graphs
Start & End Times
| Start Time | 2023-01-16 14:00 CET |
| End time | 2023-01-23 10:30 CET |
Problems
| Label | Problem |
|---|---|
| A | Brick Wall |
| B | Secret Santa Cycles |
| C | Svemir |
| D | Pedal Power |
| E | Battle of Hogwarts |
| F | Flygskam |
| G | Mountain Village |
| H | Listen To Your Boss |
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.
Results
- Results are shown without limitation.
Languages
Ada Algol 68 APL Bash C C# C++ COBOL Common Lisp Crystal C with GMP C++ with GMP C with Memory Check C++ with Memory Check D Dart Elixir Erlang F# Forth Fortran Go Haskell Java JavaScript (Node.js) JavaScript (SpiderMonkey) Java with Algs4 Julia Kotlin Lua Modula-2 Nim Objective-C OCaml Octave Odin Pascal Perl PHP Prolog Python 2 Python 3 Python 3 with NumPy Racket Ruby Rust Simula 67 Smalltalk SNOBOL Swift TypeScript Visual Basic Zig