제출 #147283

#제출 시각아이디문제언어결과실행 시간메모리
147283joylintpArranging Shoes (IOI19_shoes)C++14
70 / 100
1066 ms3956 KiB
#include<bits/stdc++.h> #include "shoes.h" using namespace std; long long count_swaps(vector<int> s) { long long n = s.size(), ret = 0; bool sub2 = true, sub3 = true; for (int i = 0; i < n && sub2; i++) if (abs(s[i]) != abs(s[0])) sub2 = false; for (int i = 0; i < n / 2 && sub3; i++) if (s[i] > 0 || -s[i] != s[i + n / 2]) sub3 = false; if (sub2) { vector<int> vv, ww; for (int i = 0; i < n; i++) if (i % 2 == 0 && s[i] > 0) vv.push_back(i); else if (i % 2 && s[i] < 0) ww.push_back(i); for (int i = 0; i < (int)vv.size(); i++) ret += abs(vv[i] - ww[i]); return ret; } for (int i = 0; i < n; i++) { int j; if (i % 2 == 0) for (j = i; s[j] != -abs(s[i]); j++); else for (j = i; s[j] != -s[i - 1]; j++); ret += j - i; int t = s[j]; for (int k = j - 1; k >= i; k--) s[k + 1] = s[k]; s[i] = t; } return ret; }
#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...