oj.uz

Submission #54398

# Submission time Handle Problem Language Result Execution time Memory
54398 2018-07-03T10:08:30 Z 노영훈(#1472) Sails (IOI07_sails) C++11
35 / 100
 30 ms 2924 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 mx[MX];

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};
    }
    ll sum=0;
    for(int i=1; i<=n; i++)
        upt(1, P[i].first, 1), sum+=P[i].second;
    for(int i=1; i<=HMX; i++) mx[i]=val(i);

    for(int i=1; i<=HMX; i++) tree[i]=0;


    for(int i=HMX; i>=1; i--){
        if(mx[i]==0) continue;
        ll x=min(sum/i, mx[i]-val(i));
        sum-=x*i;
        upt(1,i,x);
        if(sum<=i && mx[i]>val(i)){
            upt(1,sum,1);
            sum=0;
            break;
        }
    }


    ll ans=0;
    for(int i=1; i<=n; i++){
        ll x=val(i);
        ans+=x*(x-1)/2;
    }
    cout<<ans<<'\n';

    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1912 KB Output is correct
2 Correct 5 ms 1912 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 2096 KB Output is correct
2 Correct 5 ms 2148 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 2148 KB Output is correct
2 Correct 4 ms 2148 KB Output is correct

Subtask #4
0 / 5.0

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

Subtask #5
0 / 10.0

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

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 2148 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 23 ms 2388 KB Output is correct

Subtask #8
0 / 10.0

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

Subtask #9
0 / 10.0

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

Subtask #10
0 / 10.0

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

Subtask #11
0 / 10.0

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