Submission #1215762

#	Time	Username	Problem	Language	Result	Execution time	Memory
1215762		ZsofiaKeresztely	Arranging Shoes (IOI19_shoes)	C++20	0 / 100	0 ms	328 KiB

shoes

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

ll count_swaps(vector<int> s) {
	ll n = s.size() / 2;
	vector<ll> p(n);
	iota(p.begin(), p.end(), 1);
	ll op = 1e9, inv; //1e9!!
	do{
		inv = 0;
		vector<int> sc = s;
		for (ll i=0; i<2*n; i++){
			ll j = i;
			while (sc[j] != s[i]){
				j++;
			}
			inv += j - i;
			while (j > i){
				swap(sc[j], sc[j-1]);
				j--;
			}
		}
		op = min(op, inv);
	} while (next_permutation(p.begin(), p.end()));
	return op;
}

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