### salt_n_ice's blog

By salt_n_ice, history, 6 weeks ago,

Code
    ll n, c;
cin>>n>>c;
vector<pair<ll, ll> > v;
for(int i=0; i<n; ++i)
{
ll a,b,p;
cin>>a>>b>>p;
v.push_back({a, p});
v.push_back({b+1, -p});
}
sort(v.begin(), v.end());
ll ans = 0;
ll accum = 0;
for(int i=0; i<2*n; ++i)
{
ll a = v[i].first, p = v[i].second;
accum += p;
if(i+1<2*n)
{
ans += min(accum*(v[i+1].first-a), c*(v[i+1].first-a));
}
}
cout<<ans<<endl;


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.

• 0

 » 6 weeks ago, # |   +1 You could find the test cases for all Atcoder problems here. Maybe that will help.
•  » » 6 weeks ago, # ^ | ← Rev. 2 →   0 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.