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 | 3690 |
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 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 172 |
2 | adamant | 164 |
3 | awoo | 163 |
4 | TheScrasse | 160 |
5 | nor | 157 |
6 | maroonrk | 155 |
7 | -is-this-fft- | 152 |
8 | Petr | 146 |
9 | orz | 145 |
9 | pajenegod | 145 |
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 |
---|