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 | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
# | User | Contrib. |
---|---|---|
1 | cry | 169 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 160 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | Dominater069 | 154 |
8 | awoo | 154 |
10 | luogu_official | 151 |
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 |
---|