Submission #1238508

#	Time	Username	Problem	Language	Result	Execution time	Memory
1238508		em4ma2	Arranging Shoes (IOI19_shoes)	C++20	0 / 100	1095 ms	15728 KiB

shoes

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

#define pb push_back
#define ll long long

const ll inf=1e9+4;

ll count_swaps(vector<int>a){
    vector<int>v;
    int n=a.size();
    unordered_map<int,int>mp;
    for (int i=0;i<n;i++){
        mp[a[i]]=i;
    }
    for (int i=0;i<n;i++){
        v.pb(i);
    }
    vector<int>pos;
    for (int i=0;i<n;i++){
        if (a[i]>0)pos.pb(a[i]);
    }
    ll ans=inf;
    do{
        vector<int>tmp;
        for (auto x:v){
            tmp.pb(-pos[x]);
            tmp.pb(pos[x]);
        }
        ll cur=0;
        for (int i=0;i<n;i++){
            cur+=abs(mp[tmp[i]]-i);
        }
        cur/=2;
        ans=min(ans,cur);
    }while (next_permutation(v.begin(),v.end()));
    return ans;
}

// int main() {
// 	int n;
// 	assert(1 == scanf("%d", &n));
// 	vector<int> S(2 * n);
// 	for (int i = 0; i < 2 * n; i++)
// 		assert(1 == scanf("%d", &S[i]));
// 	fclose(stdin);

// 	long long result = count_swaps(S);

// 	printf("%lld\n", result);
// 	fclose(stdout);
// 	return 0;
// }

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