제출 #1215813

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

shoes

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

using namespace std;

long long count_swaps(std::vector<int> s) {
	vector<int> a;
	int n = s.size()/2;
	for(int i = 0; i < n*2; i++){
		if(s[i] < 0)a.push_back(s[i]);
	}
	sort(a.begin() , a.end());
	int ans = 1e9;
	do{
		int ans2 = 0;
		vector<int> u = s;
		for(int i = 0; i < n*2; i++){
			for(int j = i; j < n*2; j++){
				if(u[j] == (i%2)?a[i/2]:a[i/2]*(-1)){
					for(int z = j; z > i; z--){
						swap(u[z] , u[z-1]);
						ans2++;
					}
					break;
				}
			}
		}
		ans = min(ans , ans2);
	}while(next_permutation(a.begin() , a.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