Submission #1025418

#	Time	Username	Problem	Language	Result	Execution time	Memory
1025418		Luvidi	Arranging Shoes (IOI19_shoes)	C++17	50 / 100	1095 ms	14004 KiB

shoes

#include "shoes.h"
#include <bits/stdc++.h>
using namespace std;

long long count_swaps(std::vector<int> s) {
	int n=s.size()/2;
	vector<int> v[2*n+1];
	for(int i=0;i<2*n;i++)v[s[i]+n].push_back(i);
	for(int i=0;i<=2*n;i++)reverse(v[i].begin(),v[i].end());
	int ans=0;
	for(int i=0;i<2*n;i+=2){
		int x;
		for(int j=0;j<=2*n;j++){
			for(int k:v[j]){
				if(k==i)x=j-n;
			}
		}
		int idx=v[-x+n].back();
		v[-x+n].pop_back();
		v[x+n].pop_back();
		ans+=idx-1-i+(x>0);
		for(int j=0;j<=2*n;j++){
			for(int &k:v[j]){
				if(k<idx)k++;
			}
		}
	}
	return ans;
}

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