salt_n_ice's blog

By salt_n_ice, history, 4 years ago, In English

Link

Code

After submitting this solution, there is a single test case out of 28 which is giving WA. And I don't see what's wrong with this solution. I don't think the problem is with constraints either.

  • Vote: I like it
  • 0
  • Vote: I do not like it

»
4 years ago, # |
  Vote: I like it +1 Vote: I do not like it

You could find the test cases for all Atcoder problems here. Maybe that will help.

  • »
    »
    4 years ago, # ^ |
    Rev. 2   Vote: I like it 0 Vote: I do not like it

    Thanks.
    For someone having a similar problem, The reason is probably overflowing.
    ans += min(accum*(v[i+1].first-a), c*(v[i+1].first-a)); At this step, accum could be up to 10^14 so:
    ans += (v[i+1].first-a) * min(accum, c); will be good.