Description
Graph Algorithms
Graph and Trees, Traversals, SSSP/MSSP, and MST
Problems:
- Easy (A-C)
- Medium (D-F)
- Hard (G-I)
CPSC 599.4: Get 7 points (1 point for each easy problem, 3 points for each medium promblem, and 5 for each hard problem)
Start & End Times
| Start Time | 2025-03-25 23:30 CET |
| End time | 2025-04-02 00:00 CEST |
Problems
The contest has not yet started. The problems will become available when the contest starts.
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