Submission #1025352

#	Time	Username	Problem	Language	Result	Execution time	Memory
1025352		LeaRouse	Arranging Shoes (IOI19_shoes)	C++14	10 / 100	73 ms	135052 KiB

shoes

#include <bits/stdc++.h>
#include "shoes.h"
#define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long
using namespace std;
const int MAX=2e5+5;
ll P[MAX],bit[MAX],d=0;
 
void update(int i,int v){
    while(i<=d){
        bit[i]+=v;
        i+=(i&-i);
    }
}
 
ll query (int i){
    ll ans=0;
    while(i>0){
        ans+=bit[i];
        i-=(i&-i);
    }
    return ans;
}
 
ll inv(){
    ll ans=0;
    for(int i=0;i<d;i++){
        ans+=query(P[i]);
        update(P[i],1);
    }
    return ans;
}
 
ll count_swaps(vector<int>s){
    d=s.size(); 
    int a=1;
    queue<int>q[MAX];
    for(int i=0;i<d;i++){
        q[s[i]+d/2].push(i);
    }
    for(int i=0;i<d;i++){
        if(P[i])    continue;
        
        int b=q[d/2-s[i]].front();
        q[d/2-s[i]].pop();  q[d/2+s[i]].pop();
		//asignamos pares
        if(s[i]>0){
            P[i]=a+1;
            P[b]=a;
        }
        else{
            P[i]=a;
            P[b]=a+1;
            a+=2;
        }
        a+=2;
    }
    ll res=d*(d-1)/2;
    ll ans=res-inv();
    return ans;  
}

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