Hey guys !
So I was trying to hack a solution using this test case in Distinct routes.
Problem link .
3 5
1 2
1 2
1 2
2 3
2 3
The answer should be
2
3
1 2 3
3
1 2 3
But I got INVALID INPUT .
I think this input should be valid as per constraints .
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 166 |
2 | maomao90 | 163 |
2 | Um_nik | 163 |
4 | atcoder_official | 161 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | nor | 153 |
9 | Dominater069 | 153 |
Hey guys !
So I was trying to hack a solution using this test case in Distinct routes.
Problem link .
3 5
1 2
1 2
1 2
2 3
2 3
The answer should be
2
3
1 2 3
3
1 2 3
But I got INVALID INPUT .
I think this input should be valid as per constraints .
Name |
---|
You can't have multiple instances of
1 2
in your input.Okay understood . I was thinking 1 1 is not valid .
"There are no two teleporters whose starting and ending room are the same." This means multi-edges are not allowed.
Okay understood .