Submission #1238495

#TimeUsernameProblemLanguageResultExecution timeMemory
1238495em4ma2Arranging Shoes (IOI19_shoes)C++20
10 / 100
10 ms412 KiB
#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<8;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); } ans=min(ans,cur); }while (next_permutation(v.begin(),v.end())); return ans; }
#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...