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 | 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 | 170 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 160 |
5 | djm03178 | 158 |
5 | -is-this-fft- | 158 |
7 | adamant | 154 |
7 | Dominater069 | 154 |
9 | awoo | 153 |
10 | luogu_official | 152 |
What's wrong with the logic?
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 |
---|