Submission #1032001

#	Time	Username	Problem	Language	Result	Execution time	Memory
1032001		Kipras	Arranging Shoes (IOI19_shoes)	C++17	10 / 100	74 ms	139860 KiB

shoes

#include <bits/stdc++.h>

typedef long long ll;

using namespace std;

const ll maxN = 1e5+10;

ll n;

ll val[maxN*2], l[maxN], r[maxN], lazy[maxN], sz[maxN];
deque<ll> pos[maxN], neg[maxN];
ll used[maxN]={0};
ll ind = 0;

void build(ll v){

    if(v>=n){
        l[v]=ind;
        r[v]=ind;
        val[v]=0;
        lazy[v]=0;
        sz[v]=1;
    }else{
        build(v*2);
        build(v*2+1);
        l[v]=l[v*2];
        r[v]=r[v*2+1];
        val[v]=0;
        lazy[v]=0;
        sz[v]=sz[v*2]+sz[v*2+1];
    }

}

void update(ll v, ll L, ll R, ll x){

    if(L>r[v]||R<l[v]){
        return;
    }
    else if(L<=l[v]&&r[v]<=R){
        lazy[v]+=x;
    }else{
        update(v*2, L, R, x);
        update(v*2+1, L, R, x);
    }

}

ll query(ll v, ll L, ll R){

    if(L>r[v]||R<l[v]){
        return 0;
    }
    else if(L<=l[v]&&r[v]<=R){
        val[v]+=lazy[v];
        lazy[v]=0;
        return val[v];
    }else{
        lazy[v*2]+=lazy[v];
        lazy[v*2+1]+=lazy[v];
        lazy[v]=0;
        return query(v*2, L, R)+query(v*2+1, L, R);
    }

}

ll count_swaps(vector<int> s){

    n = s.size();

    build(1);

    ll rez = 0;

    for(int i = 0; i < n; i++){
        if(s[i]>0)
            pos[s[i]].push_back(i);
        else
            neg[abs(s[i])].push_back(i);
    }

    for(int i = 0; i < n; i++){
        if(used[i])continue;

        ll v=abs(s[i]);
        if(s[i]>0){
            rez++;
            pos[v].pop_front();
            ll u = neg[v].front();
            neg[v].pop_front();
            ll p1 = i + query(1, i, i);
            ll p2 = u + query(1, u, u);
            update(1, p1, p2, 1);
            rez+=p2-p1-1;
            used[u]=1;
        }else{
            neg[v].pop_front();
            ll u = pos[v].front();
            pos[v].pop_front();
            ll p1 = i + query(1, i, i);
            ll p2 = u + query(1, u, u);
            update(1, p1, p2, 1);
            rez+=p2-p1-1;
            used[u]=1;
        }

    }

    return rez;

}

/*int main(){

    ll m;
    cin>>m;
    vector<int> aa;
    for(int i = 0; i < m; i++){
        ll aaa;
        cin>>aaa;
        aa.push_back(aaa);
    }

    cout<<count_swaps(aa);

}*/

• Subtask 1: 10 / 10
• Subtask 2: 0 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 15
• Subtask 5: 0 / 20
• Subtask 6: 0 / 15