this problem
there is a test case like this:
3
1 P
2 R
3 P
accepted solutions output the answer of this test equal to 3 but why the answer isn't 2?
you can simply connect adjacent cities
Am I right or the test is invalid?
# | 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 | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
this problem
there is a test case like this:
3
1 P
2 R
3 P
accepted solutions output the answer of this test equal to 3 but why the answer isn't 2?
you can simply connect adjacent cities
Am I right or the test is invalid?
Name |
---|
The way you describe it, there is a connection between 1 and 2, and between 2 and 3.
If 2 (R) is removed, then the Ps need to be connected (which they won't be).
"If you look at the only cities of Byteland and the disputed cities, then in the resulting set of cities, any city should be reachable from any other one by one or more cables"
So, in this test case, since there are no cities of Byteland, that means that all disputed cities should be reachable from any other if we only look at them. That means that there must be a cable connecting 1 and 3.