Diferente pentru problema/patrol2 intre reviziile #25 si #24

Nu exista diferente intre titluri.

Diferente intre continut:

You need to write a single line with an integer: the minimum amount of minutes needed to get from manhole $0$ to manhole $N-1$, or $-1$ if it is impossible to do.
h2. Restricţii
 
* (1 ≤ $N$ ≤ 10^4^), (1 ≤ $M$ ≤ 5*10^4^), (1 ≤ $K$ ≤ 10^5^).
* (1 ≤ L ~i~ ≤ 7).
* For the first subtask, (N ≤ $100$, $M$ ≤ $100$, $K$ ≤ $500$).

Nu exista diferente intre securitate.

Topicul de forum nu a fost schimbat.