Submission #1215761

#TimeUsernameProblemLanguageResultExecution timeMemory
1215761UVinceArranging Shoes (IOI19_shoes)C++20
30 / 100
1095 ms4164 KiB
#include "shoes.h" #include <bits/stdc++.h> using namespace std; long long count_swaps(std::vector<int> s) { vector<int> v; for (int i : s){ if (i<0) v.push_back(i); } sort(v.begin(), v.end()); int ans=INT_MAX; do{ int cans=0; vector<int> cur=s; vector<int> full; for (int i : v){ full.push_back(i); full.push_back(-i); } for (int i=0;i<full.size();i++){ int ind=-1; for (int j=i;j<cur.size();j++){ if (cur[j]==full[i]){ ind=j; break; } } while (ind>i){ swap(cur[ind], cur[ind-1]); ind--; cans++; } } ans=min(ans, cans); } 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...