# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
207170 | Sho10 | Arranging Shoes (IOI19_shoes) | C++14 | 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.
/*
ID: Sho10
LANG: C++
*/
#include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho10
#define ll long long int
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#define sz size
#define f first
#define s second
#define pb push_back
#define er erase
#define in insert
#define mp make_pair
#define pi pair
#define rc(s) return cout<<s,0
#define endl '\n'
#define mod 1000000007
#define PI 3.14159265359
#define CODE_START ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
vector<int>v;
vector<int>l;
vector<int>a;
vector<int>an;
vector<int>S;
map<ll,ll>viz;
ll count_swaps(std::vector<int> S){
v=S;
if(n<=8){
for(ll i=0;i<v.size();i++)
if(v[i]<0){
l.pb(v[i]);
}
ll ans=mod;
sort(l.begin(),l.end());
do{
a=l;
ll s=0;
for(ll i=0;i<a.size();i++)
if(a[i]<0){
a.insert(a.begin()+i+1,abs(a[i]));
}
an=v;
for(ll i=0;i<a.size();i++)
{
for(ll j=i;j<an.size();j++)
if(an[j]==a[i]){
for(ll c=j;c>i;c--)
{
swap(an[c],an[c-1]);
s++;
}
break;
}
}
ans=min(ans,s);
}while (next_permutation(l.begin(),l.end()));
}else {
ans=n*(n-1)/2;
}
return ans;
}