Hacker Cup T-shirt giveaway

Revision en11, by wery0, 2024-12-06 09:17:34

Hello codeforces community!

Since I already have top-2000 and top-200 t-shirts from previous participations and because I don't wanna spent another ~40$ to get it delivered to Russia (especially with current ruble situation :/) I decided to give it to the first person who will hack my solution to the Shortest Routes I problem from CSES.

The solution is based on SPFA algorithm which in theory could run in $$$O(nm)$$$ as Ford-Bellman does, but in practice it is quite fast, sometimes even faster then Dijkstra.

Give it a try!

UPD: Faisal-Saqib was the the first to hack, congratulations! Sent you the code in DMs.

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en11 English wery0 2024-12-06 09:17:34 0 (published)
en10 English wery0 2024-12-06 09:17:15 113 (saved to drafts)
en9 English wery0 2024-12-05 16:51:27 0 (published)
en8 English wery0 2024-12-05 16:50:35 0 Tiny change: 'kstra.\n\nGive it a ' -> 'kstra.\n\nYou can tGive it a '
en7 English wery0 2024-12-05 16:45:12 18 Tiny change: ' Dijkstra.' -> ' Dijkstra.\n\nGive it a try!'
en6 English wery0 2024-12-05 16:44:25 43
en5 English wery0 2024-12-05 16:43:44 92
en4 English wery0 2024-12-05 16:41:31 45
en3 English wery0 2024-12-05 16:37:05 4 Tiny change: 'f821/) to [Shortest' -> 'f821/) to the [Shortest'
en2 English wery0 2024-12-05 16:36:25 370 Tiny change: 'community! Since I al' -> 'community!\n\nSince I al'
en1 English wery0 2024-11-27 22:19:29 277 Initial revision (saved to drafts)