Kattis

BAPC training week 12: SSSP en Dijkstra

Welcome to BAPC training week 12: SSSP en Dijkstra

This is the contest system for BAPC training week 12: SSSP en Dijkstra. The contest has now finished. You can view the final results.

8
Problems

14 / 23
Contestants / Teams

40
Languages

15
Submissions

Start & End Times

Start Time	2022-05-11 17:00 CEST
End time	2022-05-18 17:00 CEST

Problems

Label	Problem
A	Get Shorty
B	Single source shortest path, non-negative weights
C	Millionaire Madness
D	Flip Five
E	A Walk Through The Forest
F	Block Crusher
G	Detour
H	Intercept

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

Algol 68 APL Bash C C# C++ COBOL Common Lisp Crystal Dart F# Fortran Gerbil Go Haskell Java JavaScript (Node.js) JavaScript (SpiderMonkey) Julia Kotlin Lua Nim Objective-C OCaml Octave Odin Pascal Perl PHP Prolog Python 2 Python 3 Ruby Rust Simula 67 SNOBOL Swift TypeScript Visual Basic Zig