Submission #1215783

#TimeUsernameProblemLanguageResultExecution timeMemory
1215783baliArranging Shoes (IOI19_shoes)C++20
10 / 100
0 ms328 KiB
#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()); vector<int> h2; ll cmin=LLONG_MAX; do { 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=h2.size()-1; j>i; j--) { if(s[i]==h2[j]){swap(h2[j], h2[j-1]);c++;} } } cmin=min(cmin,c); } while((next_permutation(s.begin(),s.end()))); return cmin; }
#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...