https://cses.fi/problemset/task/1193
in this problem i m able to find out the minimum number of moves to get to the destination,but how to trace the path ,how to find string with shortest path. pls help!!
spookywooky -Baba_Yaga
# | User | Rating |
---|---|---|
1 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | orzdevinwang | 3570 |
4 | Geothermal | 3569 |
4 | cnnfls_csy | 3569 |
6 | tourist | 3565 |
7 | maroonrk | 3531 |
8 | Radewoosh | 3521 |
9 | Um_nik | 3482 |
10 | jiangly | 3468 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 162 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 151 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
https://cses.fi/problemset/task/1193
in this problem i m able to find out the minimum number of moves to get to the destination,but how to trace the path ,how to find string with shortest path. pls help!!
spookywooky -Baba_Yaga
Name |
---|
While creating the distance matrix you can also create an array p[] where you store for each vertex the parent of it whenever you update the distance matrix.
You can ask such questions in private message,no need to write a blog for it.