Submission #1330985

#TimeUsernameProblemLanguageResultExecution timeMemory
1330985boclobanchatSails (IOI07_sails)C++20
25 / 100
13 ms1956 KiB
#include<bits/stdc++.h>
using namespace std;
const int MAXN=1e5+5;
long long pref[MAXN];
pair<int,int> A[MAXN];
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n;
    cin>>n;
    long long s=0;
    for(int i=1;i<=n;i++)
	{
		cin>>A[i].first>>A[i].second;
		pref[A[i].first]--,pref[A[i].first-A[i].second]++,s+=A[i].second;
	}
    for(int i=1;i<1e5;i++) pref[i]+=pref[i-1];
    int l=0,r=n,pos=0;
    while(l<=r)
    {
    	int mid=(l+r)/2;
    	long long sum=0,rem=0;
    	for(int i=1e5;i+1;i--)
    	{
    		long long val=pref[i]+rem;
    		sum+=min(val,1LL*mid),rem=val-min(val,1LL*mid);
		}
    	if(rem==0) r=mid-1,pos=mid;
    	else l=mid+1;
	}
	long long ans=0,rem=0;
	for(int i=1e5;i+1;i--)
	{
		long long val=pref[i]+rem;
    	ans+=min(val,1LL*pos)*(min(val,1LL*pos)-1)/2,rem=val-min(val,1LL*pos);
	}
	cout<<ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...