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 | tourist | 3856 |
2 | jiangly | 3747 |
3 | orzdevinwang | 3706 |
4 | jqdai0815 | 3682 |
5 | ksun48 | 3591 |
6 | gamegame | 3477 |
7 | Benq | 3468 |
8 | Radewoosh | 3462 |
9 | ecnerwala | 3451 |
10 | heuristica | 3431 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | -is-this-fft- | 162 |
3 | Dominater069 | 160 |
4 | Um_nik | 158 |
5 | atcoder_official | 157 |
6 | Qingyu | 155 |
7 | djm03178 | 151 |
7 | adamant | 151 |
9 | luogu_official | 150 |
10 | awoo | 147 |
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