제출 #422619

#제출 시각아이디문제언어결과실행 시간메모리
422619TryMaxArranging Shoes (IOI19_shoes)C++17
50 / 100
1079 ms3108 KiB
#include "shoes.h" #include "bits/stdc++.h" using namespace std; long long count_swaps(vector<int> s) { int n = s.size(); int ans = 0; for(int i = 0; i < n; i += 2){ if(s[i] < 0){ int p = 0; for(int j = i + 1; j < n; ++j) if(s[j] == -1 * s[i]){ p = j; break; } while(p > i + 1) swap(s[p - 1], s[p]), --p, ++ans; }else{ int p = 0; for(int j = i + 1; j < n; ++j) if(s[j] == -1 * s[i]){ p = j; break; } while(p > i) swap(s[p - 1], s[p]), --p, ++ans; } } 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...