Submission #1215842

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

shoes

#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());
	
	ll cmin=LLONG_MAX;
	do
	{   
		vector<int> h2;
		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=i; j<h2.size(); j++)
		{
			if(s[i]==h2[j])
			{
				for(ll k=j; k>i; k--)
				{
					swap(h2[k], h2[k-1]);c++;
				}
				break;
			}
		}
		}
		cmin=min(cmin,c);
	} while((next_permutation(s.begin(),s.end())));
	return cmin;
}

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