I am trying to solve DIV2 D problem of Round 197 using segment tree. But on test case 7, I am getting runtime error. Can some one please review my code to find the mistake ? Thanks in advance. My Code — 51594716
# | 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 | 156 |
7 | adamant | 151 |
7 | djm03178 | 151 |
7 | luogu_official | 151 |
10 | awoo | 146 |
I am trying to solve DIV2 D problem of Round 197 using segment tree. But on test case 7, I am getting runtime error. Can some one please review my code to find the mistake ? Thanks in advance. My Code — 51594716
Name |
---|
The first thing that struck me — why are you using pow() as if it returns an int? Do you even know how pow() works? read the doc.
Didn't look too deep into your code but I think I found the error. You use the constant $$$M = 100000$$$ for the size of your array, but you index it with $$$2^n-1$$$ which can be $$$2^{17}-1 = 131071 > M$$$. I tried to change $$$M$$$ to $$$200000$$$ and now everything works.
(Btw don't use
cout.tie(Null);
as it doesn't do anything, don't know why so many people have that line in their header as it really doesn't do anything as cout isn't tied to anything by default.)