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 | jiangly | 3846 |
2 | tourist | 3799 |
3 | orzdevinwang | 3706 |
4 | jqdai0815 | 3682 |
5 | ksun48 | 3590 |
6 | Ormlis | 3533 |
7 | Benq | 3468 |
8 | Radewoosh | 3463 |
9 | ecnerwala | 3451 |
9 | Um_nik | 3451 |
# | User | Contrib. |
---|---|---|
1 | cry | 165 |
2 | -is-this-fft- | 160 |
2 | Qingyu | 160 |
4 | atcoder_official | 156 |
5 | Dominater069 | 155 |
6 | adamant | 154 |
7 | djm03178 | 151 |
8 | luogu_official | 149 |
9 | awoo | 147 |
10 | Um_nik | 146 |
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 .