# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
159396 | David_M | Arranging Shoes (IOI19_shoes) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "shoes.h"
#include <bits/stdc++.h>
#define ll long long
using namespace std;
queue<int> q[200005];
vector <int> F(100005);
ll ans,N,j;
void upd(int x){ for (int i=x; i<=N; i+=i&(-i)) F[i]++; }
int get(int x){ for (int i=x, ans=0; i; i-=i&(-i))ans+=F[i]; return ans;}
ll count_swaps(vector<int> V){N=V.size()/2;
for (int i=0, j; i<2*N; i++){
if(v[N-S[i]].empty()) j=i+1, v[N+S[i]].push(j);
else
j=v[N-S[i]].front(), v[N-S[i]].pop(),
ans+=(i-get(j))+((abs(V[i])/V[i]-1)*(-1)/2);
upd(j);
}
return ans;
}