Submission #1067856

#	Time	Username	Problem	Language	Result	Execution time	Memory
1067856		LittleOrange	Arranging Shoes (IOI19_shoes)	C++17	10 / 100	1100 ms	3540 KiB

shoes

#include "shoes.h"
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
long long count_swaps(std::vector<int> s) {
	ll n = s.size()/2;
	ll ans = n*n*10;
	vector<ll> p(n*2);
	iota(p.begin(),p.end(),0);
	do{
		ll ok = 1;
		for(ll i = 0;i<n;i++){
			if (s[p[i*2]]>0) ok = 0;
			if (s[p[i*2+1]]<0) ok = 0;
			if (s[p[i*2]]+s[p[i*2+1]]!=0) ok = 0;
		}
		if(ok){
			ll cur = 0;
			for(ll i = 0;i<n*2;i++) for(ll j = i+1;j<n*2;j++){
				cur += p[i]>p[j];
			}
			ans = min(ans,cur);
		}
	}while(next_permutation(p.begin(),p.end()));
	return ans;
}

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