# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1067860 | LittleOrange | Arranging Shoes (IOI19_shoes) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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||s[p[i*2+1]]<0||s[p[i*2]]+s[p[i*2+1]]!=0) {
ok = 0;
break;
}
}
if(ok){
ll cur = 0;
for(ll i = 0;i<n*2&&cur<ans;;i++) for(ll j = i+1;j<n*2&&cur<ans;j++){
cur += p[i]>p[j];
}
ans = min(ans,cur);
}
}while(next_permutation(p.begin(),p.end()));
return ans;
}