Submission #159398

#	Time	Username	Problem	Language	Result	Execution time	Memory
159398		David_M	Arranging Shoes (IOI19_shoes)	C++14	0 / 100	137 ms	135416 KiB

shoes

#include "shoes.h"
#include <bits/stdc++.h>
#define ll long long
using namespace std;
queue<int> v[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-V[i]].empty()) j=i+1, v[N+V[i]].push(j);
		else 
			j=v[N-V[i]].front(), v[N-V[i]].pop(),
   			ans+=(i-get(j))+((abs(V[i])/V[i]-1)*(-1)/2);
   		upd(j);
   	}
   	return ans;
}

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