제출 #1215751

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1215751		UVince	Arranging Shoes (IOI19_shoes)	C++20	0 / 100	1 ms	328 KiB

shoes

#include "shoes.h"
#include <bits/stdc++.h>

using namespace std;

long long count_swaps(std::vector<int> s) {
	vector<int> v;
	for (int i : s){
		if (i<0) v.push_back(i);
	}

	sort(v.begin(), v.end());
	int ans=INT_MAX;
	do{
		int cans=0;
		vector<int> cur=v;
		vector<int> full;
		for (int i : s){
			full.push_back(i);
			full.push_back(-i);
		}
		for (int i=0;i<full.size();i++){
			int ind=-1;
			for (int j=i;j<s.size();j++){
				if (s[j]==full[i]){
					ind=j;
					break;
				}
			}
			while (ind>i){
				swap(s[ind], s[ind-1]);
				ind--;
				cans++;
			}
		}
		ans=min(ans, cans);
		
	}
	while (next_permutation(v.begin(), v.end()));
	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