When submitting a solution in C++, please select either C++14 (GCC 6-32) or C++17 (GCC 7-32) as your compiler. ×

kaizen19's blog

By kaizen19, history, 5 years ago, In English

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

  • Vote: I like it
  • -9
  • Vote: I do not like it

| Write comment?
»
5 years ago, # |
  Vote: I like it +2 Vote: I do not like it

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.

»
5 years ago, # |
  Vote: I like it +6 Vote: I do not like it

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.)