Had it been given that the sequence of integers p1,p2..pn is not necessarily a permutation, it would have been a more interesting problem ! How will we solve this modified version of the problem?
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
8 | ecnerwala | 3494 |
9 | Um_nik | 3396 |
10 | gamegame | 3386 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | Um_nik | 164 |
2 | -is-this-fft- | 162 |
3 | maomao90 | 159 |
3 | atcoder_official | 159 |
5 | cry | 158 |
5 | awoo | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 153 |
10 | Dominater069 | 152 |
Had it been given that the sequence of integers p1,p2..pn is not necessarily a permutation, it would have been a more interesting problem ! How will we solve this modified version of the problem?
Название |
---|
Maybe you find amount of strongly connected components ?
Not really, 2, 3, 4, 5, 6, 5 needs just one change!
I didn't read the statement carefully and thought this was the condition and tried to solve the harder problem, but failed due to missing a case. :(
Same here :(
Same here :D I solved the harder version in the contest :D
I guess just one extra change has to be made if components = 1 and graph is not cycle then ans++
Nope, it will fail on this test :
7 2 3 4 7 6 1 6
0 1 0 0 0 0 0
what's the answer in that case? isn't it 5?