https://www.hackerearth.com/challenges/competitive/september-clash-15/algorithm/dangerous-dungeon/description/ i have got the solution for small p by calculating dist[u][p] for every p how can we do it such that solution is independent of the value of p
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3757 |
| 2 | jiangly | 3647 |
| 3 | Benq | 3581 |
| 4 | orzdevinwang | 3570 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | Radewoosh | 3509 |
| 8 | ecnerwala | 3486 |
| 9 | jqdai0815 | 3474 |
| 10 | gyh20 | 3447 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | maomao90 | 171 |
| 2 | awoo | 164 |
| 3 | adamant | 163 |
| 4 | TheScrasse | 159 |
| 5 | maroonrk | 155 |
| 6 | nor | 154 |
| 7 | -is-this-fft- | 152 |
| 8 | Petr | 147 |
| 9 | orz | 145 |
| 10 | pajenegod | 144 |
→ 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-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Jun/06/2024 21:46:34 (k1).
Desktop version, switch to mobile version.
Supported by
