oj.uz

Submission #54388

# Submission time Handle Problem Language Result Execution time Memory
54388 2018-07-03T09:47:02 Z 노영훈(#1472) Sails (IOI07_sails) C++11
35 / 100
 51 ms 4460 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int MX=100010, inf=2e9, HMX=100000;
const ll linf=2e17;

int n;
pii P[MX];

ll tree[MX];
void upt(int pos, int val){
    for(; pos>0; pos-=pos&(-pos))
        tree[pos]+=val;
}
void upt(int l, int r, int val){
    if(r<l) return;
    // cout<<l<<' '<<r<<'\n';
    upt(r, val); upt(l-1, -val);
}
int val(int pos){
    ll res=0;
    for(; 0<pos && pos<=HMX; pos+=pos&(-pos))
        res+=tree[pos];
    return res;
}

ll cnt[MX];
ll solve(int x){
    ll A[MX];
    for(int i=1; i<=HMX; i++) A[i]=cnt[i];
    ll rem=0;
    for(int i=HMX; i>=1; i--){
        if(A[i]>=x){
            ll k=A[i]-x;
            A[i]-=k, rem+=k;
        }
        else{
            ll k=min(rem, 0LL+x-A[i]);
            A[i]+=k; rem-=k;
        }
    }

    if(rem>0) return linf;
    ll ans=0;
    for(int i=1; i<=HMX; i++)
        ans+=A[i]*(A[i]-1)/2;
    return ans;
}

int main(){
    ios::sync_with_stdio(0); cin.tie(0);
    cin>>n;
    for(int i=1; i<=n; i++){
        int h, a; cin>>h>>a;
        P[i]={h,a};
    }
    sort(P+1, P+n+1, greater<pii>());
    for(int i=1; i<=n; i++){
        int h,a; tie(h,a)=P[i];
        int lo=h-a+1;
        upt(lo, h, 1);
    }
    for(int i=1; i<=HMX; i++) cnt[i]=val(i);
    
    ll S[MX]={};
    for(int i=1; i<=n; i++) S[i]=S[i-1]+cnt[i];

    for(int i=1; i<=HMX; i++) tree[i]=0;
    for(int i=1; i<=n; i++){
        upt(1, P[i].first, 1);
    }
    ll mx[MX];
    for(int i=1; i<=HMX; i++) mx[i]=val(i);


    ll rem=0;
    for(int i=n; i>=1; i--){
        ll now=(S[i]+rem+i-1)/i;
        ll x=min(now, mx[i]);
        rem+=cnt[i]-x;
        cnt[i]=x;
    }
    ll ans=0;
    for(int i=1; i<=n; i++)
        ans+=cnt[i]*(cnt[i]-1)/2;
    cout<<ans<<'\n';

    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 3448 KB Output is correct
2 Correct 8 ms 3556 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 3556 KB Output is correct
2 Correct 7 ms 3556 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 3556 KB Output is correct
2 Correct 8 ms 3640 KB Output is correct

Subtask #4
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 9 ms 3640 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 3640 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 3820 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 3896 KB Output is correct

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 26 ms 3996 KB Output isn't correct

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 51 ms 4300 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 44 ms 4436 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #11
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 48 ms 4460 KB Output isn't correct
2 Halted 0 ms 0 KB -