BFS

Правка en1, от naevis, 2019-08-27 12:38:01

can we solve this problem https://mirror.codeforces.com/contest/96/problem/D using a single bfs with state (money, remaining distance)?

Теги #graph, #bfs, shortest-path

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский naevis 2019-08-27 12:38:01 131 Initial revision (published)