Description
Some introductory problems on graphs!
Problem A is a vertex property problem.
Problem B is a connectivity problem.
Problem C is a DFS problem.
Problem D is a BFS problem.
Start & End Times
| Flexible Start Time |
2025-12-03 14:00
- 2025-12-03 16:00 CET |
| End time | 2025-12-03 16:00 CET |
Problems
| Label | Problem |
|---|---|
| A | Weak Vertices |
| B | Where's My Internet?? |
| C | Build Dependencies |
| D | Fire! |
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 60 Algol 68 APL Bash BCPL BQN C C# C++ COBOL Common Lisp Crystal D Dart Elixir Erlang F# Forth Fortran Fortran 77 Gerbil Go Haskell Icon Java JavaScript (Node.js) JavaScript (SpiderMonkey) Julia Kotlin Lua Modula-2 Nim Objective-C OCaml Octave Odin Pascal Perl PHP PL/I Prolog Python 2 Python 3 Racket Ruby Rust Simula 67 Smalltalk SNOBOL Swift TypeScript Visual Basic Zig