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 | 4009 |
2 | jiangly | 3831 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | ksun48 | 3373 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
6 | adamant | 157 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
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