Submission #904705

#	Time	Username	Problem	Language	Result	Execution time	Memory
904705		JakobZorz	Sails (IOI07_sails)	C++17	70 / 100	1043 ms	1872 KiB

sails

#include<iostream>
#include<vector>
#include<queue>
#include<stack>
#include<algorithm>
#include<limits.h>
#include<math.h>
#include<map>
#include<set>
#include<unordered_map>
#include<unordered_set>
#include<iomanip>
#include<cstring>
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
using namespace std;
//const int MOD=1e9+7;
//typedef pair<ll,ll>Point;
//typedef pair<ll,ll>Line;
//#define x first
//#define y second

const int TREE_SIZE=1<<17;

ll tree[TREE_SIZE];
int beg=TREE_SIZE;

ll get_sum(int l,int r){
    ll res=0;
    for(int i=l;i<r;i++)
        res+=tree[i];
    return res;
}

void update(int l,int r,int v){
    for(int i=l;i<r;i++)
        tree[i]+=v;
}

int get_first(int v){
    int l=beg-1,r=TREE_SIZE;
    while(l<r-1){
        int m=(l+r)/2;
        if(get_sum(m,m+1)<v)
            l=m;
        else
            r=m;
    }
    return r;
}

int get_last(int v){ // get one after last
    int l=beg-1,r=TREE_SIZE;
    while(l<r-1){
        int m=(l+r)/2;
        if(get_sum(m,m+1)<=v)
            l=m;
        else
            r=m;
    }
    return r;
}

void add(){
    beg--;
}

ll get(int k){
    if(k==0)
        return 0;
    int mv=(int)get_sum(beg+k-1,beg+k);
    int i1=get_first(mv);
    ll res=get_sum(beg,i1);
    update(beg,i1,1);
    k-=i1-beg;
    int i2=get_last(mv);
    res+=get_sum(i2-k,i2);
    update(i2-k,i2,1);
    return res;
}

void solve(){
    int n;
    cin>>n;
    vector<pair<int,int>>arr(n);
    for(auto&i:arr)
        cin>>i.first>>i.second;
    sort(arr.begin(),arr.end());
    int ph=0;
    multiset<int>s;
    ll r=0;
    
    for(auto [h,k]:arr){
        for(int i=ph;i<h;i++)
            add();
        r+=get(k);
        ph=h;
    }
    cout<<r<<"\n";
}

int main(){
    ios::sync_with_stdio(false);cout.tie(NULL);cin.tie(NULL);
    //freopen("bank.in","r",stdin);freopen("bank.out","w",stdout);
    int t=1;//cin>>t;
    while(t--)solve();
    return 0;
}

/*

6
3 2
5 3
4 1
2 1
4 3
3 2

10
 
*/

• Subtask 1: 5 / 5
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 5 / 5
• Subtask 5: 10 / 10
• Subtask 6: 10 / 10
• Subtask 7: 10 / 10
• Subtask 8: 10 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10
• Subtask 11: 0 / 10