Hello, guys! Can anyone help me with an appropiate approach on this problem: https://cses.fi/problemset/task/1203/? I have already wasted all my efficient ideas on this topic. Any eligible answer would be appreciated! Thanks a lot!
# | User | Rating |
---|---|---|
1 | tourist | 3947 |
2 | jiangly | 3734 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | ecnerwala | 3581 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | ksun48 | 3479 |
# | User | Contrib. |
---|---|---|
1 | awoo | 162 |
2 | maomao90 | 160 |
3 | nor | 156 |
4 | cry | 155 |
4 | adamant | 155 |
4 | atcoder_official | 155 |
4 | -is-this-fft- | 155 |
8 | maroonrk | 153 |
9 | SecondThread | 147 |
10 | Petr | 146 |
I want to ask a question about shortest paths!
Hello, guys! Can anyone help me with an appropiate approach on this problem: https://cses.fi/problemset/task/1203/? I have already wasted all my efficient ideas on this topic. Any eligible answer would be appreciated! Thanks a lot!
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en3 |
![]() |
Warriors_Cats | 2020-07-26 14:36:17 | 61 | ||
en2 |
![]() |
Warriors_Cats | 2020-07-26 14:30:31 | 2 | Tiny change: 'task/1203/.\nI have a' -> 'task/1203/?\nI have a' | |
en1 |
![]() |
Warriors_Cats | 2020-07-26 14:28:15 | 278 | Initial revision (published) |
Name |
---|