I tried this problem using segment tree but it's getting TLE. Can anybody explain how to remove TLE from this code?
Solution : https://pastebin.com/8iuk4mQp
Problem : http://www.spoj.com/problems/PATULJCI/
# | User | Rating |
---|---|---|
1 | jiangly | 3640 |
2 | Benq | 3593 |
3 | tourist | 3572 |
4 | orzdevinwang | 3561 |
5 | cnnfls_csy | 3539 |
6 | ecnerwala | 3534 |
7 | Radewoosh | 3532 |
8 | gyh20 | 3447 |
9 | Rebelz | 3409 |
10 | Geothermal | 3408 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 173 |
2 | adamant | 164 |
3 | awoo | 161 |
4 | TheScrasse | 160 |
5 | nor | 159 |
6 | maroonrk | 156 |
7 | SecondThread | 152 |
8 | pajenegod | 146 |
9 | BledDest | 144 |
10 | Um_nik | 143 |
I tried this problem using segment tree but it's getting TLE. Can anybody explain how to remove TLE from this code?
Solution : https://pastebin.com/8iuk4mQp
Problem : http://www.spoj.com/problems/PATULJCI/
Name |
---|
Well, i don't see why this code should pass. There are simple alternatives than trying to squeeze a heavy-constant segment tree anyway, but if you still want to, you can read. I was able to pass with a Merge Sort Tree in szkopul using some constant optimization, code here. There is a simple solution using the fact that the element appears > 1/2 in the range, we can try to pick random a number between [L,R] and see if in the range, this number appears more than 1/2 times using a histogram, the probability of error is if you try k numbers
I read that editorial but still couldn't get past the TLE. By the way that codechef question got AC. Thanks for help
Can you explain the probability idea more clearly as I am not aware about it
Just random generate index between L and R ~30 times and see if the number this index represent appears more than 1/2 in subarray [L,R]
Thanks for the idea