이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
#define int long long
using namespace std;
int n,h,k,sum[100002],cnt[100002],res,cur,mx;
int32_t main(){
ios_base::sync_with_stdio(NULL);cin.tie(nullptr);
cin >> n;
cnt[1]=n;
while (n--){
cin >> h >> k;
mx=max(mx,h);
cnt[h+1]--;
sum[h-k+1]++;
sum[h+1]--;
cur+=k;
}
for (int i=1;i<=100001;i++){
cnt[i]+=cnt[i-1];
sum[i]+=sum[i-1];
}
for (int i=100000;i>=1;i--)
sum[i]+=sum[i+1];
for (int i=1;i<=mx;i++){
if (!cur)
break;
int l=0,r=cnt[i],kq=-1;
while (l<=r){
int mid=(l+r)>>1,amount=0;
for (int j=mx;j>=i;j--)
amount=min(amount+mid,sum[j]);
if (amount>=cur){
kq=mid;
r=mid-1;
}
else
l=mid+1;
}
cur-=kq;
res+=1LL*kq*(kq-1)/2;
}
cout << res;
}
# | 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... |