Hi, i'm trying to solve a cool problem but can't figure out how we can do it.
What is the minimum number of $$$moves$$$ to get from $$$x$$$ to $$$z$$$.
Input :
N
X, Y
pairs...
Eg :
5
1 3
1 2
2 4
2 5
5 6
6 3
ANS = 5 : 1,2 — 2,4 — 2,5 — 5,6 — 6,3
# | User | Rating |
---|---|---|
1 | tourist | 3880 |
2 | jiangly | 3669 |
3 | ecnerwala | 3654 |
4 | Benq | 3627 |
5 | orzdevinwang | 3612 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | jqdai0815 | 3532 |
9 | Radewoosh | 3522 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 161 |
1 | maomao90 | 161 |
3 | adamant | 156 |
4 | maroonrk | 153 |
5 | -is-this-fft- | 148 |
5 | atcoder_official | 148 |
5 | SecondThread | 148 |
8 | Petr | 147 |
9 | nor | 144 |
10 | TheScrasse | 142 |
A problem with dfs....
Hi, i'm trying to solve a cool problem but can't figure out how we can do it.
What is the minimum number of $$$moves$$$ to get from $$$x$$$ to $$$z$$$.
Input :
N
X, Y
pairs...
Eg :
5
1 3
1 2
2 4
2 5
5 6
6 3
ANS = 5 : 1,2 — 2,4 — 2,5 — 5,6 — 6,3
Name |
---|