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?
# | User | Rating |
---|---|---|
1 | tourist | 3803 |
2 | jiangly | 3707 |
3 | Benq | 3627 |
4 | ecnerwala | 3584 |
5 | orzdevinwang | 3573 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | Radewoosh | 3542 |
9 | jqdai0815 | 3532 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 163 |
2 | maomao90 | 160 |
3 | adamant | 159 |
4 | maroonrk | 152 |
5 | -is-this-fft- | 150 |
6 | atcoder_official | 148 |
6 | SecondThread | 148 |
8 | nor | 147 |
9 | TheScrasse | 146 |
10 | Petr | 144 |
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?
Name |
---|
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?