Submission #152035

#TimeUsernameProblemLanguageResultExecution timeMemory
152035oolimryArranging Shoes (IOI19_shoes)C++14
50 / 100
1078 ms3192 KiB
#include <bits/stdc++.h> using namespace std; long long count_swaps(std::vector<int> s) { int n = s.size() / 2; int ans = 0; for(int pos = 0;pos < n;pos++){ int anchor = s[2*pos]; for(int i = 2*pos+1;i < 2*n;i++){ if(s[i] + anchor == 0){ int x = i; while(x > 2*pos+1){ swap(s[x],s[x-1]); ans++; x--; } if(anchor > 0){ swap(s[pos*2],s[pos*2+1]); ans++; } break; } } for(int i = 0;i < 2 * n;i++){ //cout << s[i] << " "; } //cout << "\n"; } 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...