In 225165101,the length of array a and b is smaller than 2500.However,it doesn't get RE,but get MLE.Why? Problem: 1882E1 - Two Permutations (Easy Version)
# | User | Rating |
---|---|---|
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 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 164 |
2 | Um_nik | 163 |
3 | atcoder_official | 158 |
3 | cry | 158 |
3 | -is-this-fft- | 158 |
6 | awoo | 155 |
7 | adamant | 154 |
7 | nor | 154 |
9 | TheScrasse | 153 |
10 | Dominater069 | 152 |
In 225165101,the length of array a and b is smaller than 2500.However,it doesn't get RE,but get MLE.Why? Problem: 1882E1 - Two Permutations (Easy Version)
Name |
---|
You have:
For $$$i > 2002$$$, there's some garbage at
b[i]
andb[t] = b[b[i]]
, sob[i] != i
will almost certainly be true.So, the while loop runs indefinitely, and
swa()
appends toq
$$$3$$$ times, which leads to MLE.