I have got the solution for small p by calculating Dist [u] [i] for i=0 to p-1 using Dijkstra.. how to solve it such that the solution is independent of the value of p.
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3382 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 155 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 145 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 134 |
| 9 | maroonrk | 132 |
| 10 | cry | 130 |
→ Find user
→ Recent actions
History
Revisions
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en6 |
|
Rehmaan_2001 | 2023-08-06 20:03:55 | 333 | ||
| en5 |
|
Rehmaan_2001 | 2023-07-28 13:03:17 | 30 | ||
| en4 |
|
Rehmaan_2001 | 2023-07-28 13:02:09 | 81 | ||
| en3 |
|
Rehmaan_2001 | 2021-12-18 16:57:01 | 59 | ||
| en2 |
|
Rehmaan_2001 | 2021-12-18 14:41:38 | 11 | ||
| en1 |
|
Rehmaan_2001 | 2021-12-18 12:32:11 | 272 | Initial revision (published) |
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Nov/06/2026 13:22:41 (g2).
Desktop version, switch to mobile version.
Supported by
