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 | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
# | User | Contrib. |
---|---|---|
1 | cry | 169 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 160 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | Dominater069 | 154 |
8 | awoo | 154 |
10 | luogu_official | 151 |
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.)