Description
You need to solve two of these tasks. They are all solved by some reduction to Maximum Network Flow (or Minimum Cut).
You probably want to have a flow implementation you trust, either by writing it yourself or becoming familiar with somebody else’s implementation. (If so, acknowledge this in your source code.) Consider checking this implementation separately with the Minimum Cut or Maximum Flow tasks on Kattis (part of the Classics session) first; otherwise mistakes can be very hard to find.
Start & End Times
| Start Time | 2025-08-26 22:00 CEST |
| End time | 2025-10-22 07:59 CEST |
Problems
| Label | Problem |
|---|---|
| A | Waif Until Dark |
| B | Elementary Math |
| C | Maze Movement |
| D | Gopher II |
| E | Councilling |
| F | Risk |
| G | Escape Plan |
| H | Paintball |
| I | Water |
Scoring
Pass/Fail — Order by Last Score Increase
Explanation:
Each problem is pass/fail. Participants are ordered by the time of the last solved problem
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