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.
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3803 |
2 | jiangly | 3707 |
3 | Benq | 3627 |
4 | ecnerwala | 3584 |
5 | orzdevinwang | 3573 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | Radewoosh | 3542 |
9 | jqdai0815 | 3532 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | awoo | 163 |
2 | adamant | 161 |
2 | maomao90 | 161 |
4 | maroonrk | 152 |
5 | -is-this-fft- | 151 |
6 | nor | 150 |
7 | atcoder_official | 147 |
8 | SecondThread | 146 |
8 | TheScrasse | 146 |
10 | Petr | 145 |
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.
Rev. | Язык | Кто | Когда | Δ | Комментарий | |
---|---|---|---|---|---|---|
en1 |
![]() |
salt_n_ice | 2021-01-22 07:10:04 | 858 | Initial revision (published) |
Название |
---|