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 | jiangly | 3640 |
2 | Benq | 3593 |
3 | tourist | 3572 |
4 | orzdevinwang | 3561 |
5 | cnnfls_csy | 3539 |
6 | ecnerwala | 3534 |
7 | Radewoosh | 3532 |
8 | gyh20 | 3447 |
9 | Rebelz | 3409 |
10 | Geothermal | 3408 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 173 |
2 | adamant | 164 |
3 | awoo | 161 |
4 | TheScrasse | 160 |
5 | nor | 159 |
6 | maroonrk | 156 |
7 | SecondThread | 152 |
8 | pajenegod | 146 |
9 | BledDest | 144 |
10 | Um_nik | 143 |
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.