Submission #1215752

#TimeUsernameProblemLanguageResultExecution timeMemory
1215752baliArranging Shoes (IOI19_shoes)C++20
0 / 100
0 ms324 KiB

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

long long count_swaps(std::vector<int> s) {
	vector<int> h;
	for(ll i=0; i<s.size(); i++)
	{
		if(s[i]<0)
		{
			h.push_back(s[i]);
		}
	}
	sort(h.begin(),h.end());
	vector<int> h2;
	ll cmin=LLONG_MAX;
	while(next_permutation(s.begin(),s.end()))
	{
		for(ll i=0; i<h.size(); i++)
		{
			h2.push_back(h[i]);
			h2.push_back(-h[i]);
		}
		ll c=0;
		for(ll i=0; i<s.size(); i++)
		{
		for(ll j=h2.size()-1; j>i; j--)
		{
			if(s[i]==h2[i]){swap(h2[i], h2[i-1]);c++;}
		}
		}
		ll cmin=min(cmin,c);
	}
	return cmin;
}

#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...