Pagini recente » Diferente pentru blog/three-beautiful-quicksorts intre reviziile 13 si 12 | Diferente pentru problema/sudest intre reviziile 18 si 19 | Diferente pentru problema/serviciu intre reviziile 8 si 9 | Profil nitica_isabela | Diferente pentru problema/marathon intre reviziile 3 si 2
Nu exista diferente intre titluri.
Diferente intre continut:
The marathon takes place in the beautiful city of Pordenone, which is formed by $N$ intersections and $M$ bidirectional roads. Each road is exactly $w_i$ meters long.
The marathon starts at intersection $0$ and ends at intersection $N-1$. Marathoners must go through $K$ checkpoints S[0], S[1] ... S[K-1], however, they can run through any route between two consecutive checkpoints.
The marathon starts at intersection $0$ and ends at intersection $N-1$. Marathoners must go through $K$ checkpoints $S[0], S[1] ... S[K-1]$, however, they can run through any route between two consecutive checkpoints.
William's plan is the following:
* $1 ≤ N ≤ 500$
* $1 ≤ M ≤ N * (N-1) / 2$
* $0 ≤ K ≤ N-2$, $K$ even.
* $0 ≤ u, v ≤ N-1$
* $0 &le u, v ≤ N-1$
* $0 ≤ w ≤ 10^9$
* For tests worth $25$ points, $K$ = $0$.
* For tests worth $35$ more points, $0 ≤ K ≤ 18$
Nu exista diferente intre securitate.
Topicul de forum nu a fost schimbat.
