| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 4 | atcoder_official | 161 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
Shortest path problem.
Given a weighted undirected graph with N nodes and M edges (u, v, w) meaning node u and v is connected with weight v. Additionally, each node has a value a[i], and you can go from node i to node j with the cost of (a[i] + a[j]) % k, where k is a given constant. Find the shortest path from s to t
Constraints: N, M <= 2e5
a[i] < k <= 1e9
1 <= u, v, s, t <= n
w <= 1e9
Thanks
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en2 |
|
Loserinlife | 2023-09-20 15:50:43 | 3 | Tiny change: 'th weight v. Addition' -> 'th weight w. Addition' | |
| en1 |
|
Loserinlife | 2023-09-20 14:54:07 | 413 | Initial revision (published) |
