USC ICPC Programming Practice 2: Shortest Paths and Applications

Time elapsed

167:59:00

Time Remaining

0:00:00

Starts in

-13 days 17:07:45

Ends in

-6 days 17:08:45

Start

2025-10-20 03:00 CEST

End

2025-10-27 01:59 CET

Visit Scoreboard

USC ICPC Programming Practice 2: Shortest Paths and Applications

Welcome to USC ICPC Programming Practice 2: Shortest Paths and Applications

This is the contest system for USC ICPC Programming Practice 2: Shortest Paths and Applications. The contest has now finished. You can view the final results.

13
Problems

15 / 18
Contestants / Teams

54
Languages

137
Submissions

Start & End Times

Start Time	2025-10-20 03:00 CEST
End time	2025-10-27 01:59 CET

Problems

Label	Problem
A	Horror List
B	Flip Five
C	Where's My Internet??
D	Getting Gold
E	Cracking The Safe
F	Counting Stars
G	Single source shortest path, safe path
H	Vin Diagrams
I	10 Kinds of People
J	Terraces
K	Full Tank?
L	Texas Summers
M	Canyon Crossing

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