Submission #1215799

#TimeUsernameProblemLanguageResultExecution timeMemory
1215799SzBenceArranging Shoes (IOI19_shoes)C++20
10 / 100
1 ms328 KiB
#include "shoes.h" #include<bits/stdc++.h> using namespace std; long long count_swaps(std::vector<int> s) { vector<int>v; int n = s.size(); for(int i =0;i < n;i++){ if(s[i]>0)v.push_back(s[i]); } sort(v.begin(),v.end()); int ln =INT_MAX; do{ auto d = s; int sum = 0; for(int i =0; i< n/2;i++){ int j =i*2; while(j < n && d[j] != -v[i])j++; while(j-- != i*2) { swap(d[j],d[j+1]); sum++; } ++++j; while(j < n && d[j] != v[i])j++; while(j-- != i*2+1) { swap(d[j],d[j+1]); } } ln = min(ln,sum); }while(next_permutation(v.begin(),v.end())); return ln; }
#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...