Submission #1215774

#	Time	Username	Problem	Language	Result	Execution time	Memory
1215774		baranj	Arranging Shoes (IOI19_shoes)	C++20	30 / 100	1096 ms	3264 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> x;
	for(int i=0; i<2*n; i++){
		if(s[i]<0){
			x.push_back(s[i]);
		}
	}
	vector<int> s1=s;
	sort(x.begin(), x.end());
	long long mx=100000000000000000;
	do{
		long long cnt=0;
		s=s1;
		for(int i=0; i<n; i++){
			for(int j=2*i; j<2*n; j++){
				if(s[j]==x[i]){
					while(s[2*i]!=x[i]){
						cnt++;
						swap(s[j], s[j-1]);
						j--;
					}
					break;
				}
			}
			for(int j=2*i+1; j<2*n; j++){
				if(s[j]==-x[i]){
					while(s[2*i+1]!=-x[i]){
						cnt++;
						swap(s[j], s[j-1]);
						j--;
					}
					break;
				}
			}
		}
		//cout<<cnt<<endl;
		mx=min(mx, cnt);
	}while(next_permutation(x.begin(), x.end()));
	return mx;
}

/*int main(){
	cout<<count_swaps({2, 1, -1, -2});
}*/ 

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