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 | Radewoosh | 3759 |
2 | orzdevinwang | 3697 |
3 | jiangly | 3662 |
4 | Benq | 3644 |
5 | -0.5 | 3545 |
6 | ecnerwala | 3505 |
7 | tourist | 3486 |
8 | inaFSTream | 3478 |
9 | maroonrk | 3454 |
10 | Rebelz | 3415 |
# | User | Contrib. |
---|---|---|
1 | adamant | 173 |
2 | awoo | 168 |
3 | nor | 164 |
4 | SecondThread | 163 |
5 | BledDest | 162 |
5 | Um_nik | 162 |
7 | maroonrk | 161 |
8 | -is-this-fft- | 150 |
9 | Geothermal | 146 |
10 | TheScrasse | 143 |
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.