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.
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3831 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | ksun48 | 3373 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
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.
Name |
---|
You could find the test cases for all Atcoder problems here. Maybe that will help.
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.