이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n; cin >> n;
vector<pair<int,int>> v(n);
for(auto &x : v)cin >> x.first >> x.second;
set<pair<int,int>> S;
S.insert({1,-1});
sort(v.begin(),v.end());
int cn = -2;
for(int i = 0; i < n; ++i){
int z = v[i].second;
int mx = v[i].first;
auto it = prev(S.end());
vector<pair<int,int>> del, add;
bool ok = 0;
while(z){
if((*it).first == 1)ok = 1;
del.push_back(*it);
int am = min(z,mx-(*it).first+1);
z-=am;
add.push_back({(*it).first+am,(*it).second});
mx = (*it).first-1;
it = prev(it);
}
for(auto x : del)S.erase(x);
for(auto x : add)S.insert(x);
if(ok){
S.insert({1,cn--});
}
}
long long ans = 0;
for(auto x : S){
ans += -1ll * (x.first-1) * (x.second+1);
}
cout << ans << '\n';
}
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |