Submission #294380

#TimeUsernameProblemLanguageResultExecution timeMemory
294380MilosMilutinovicArranging Shoes (IOI19_shoes)C++14
10 / 100
1077 ms3836 KiB
#include <bits/stdc++.h> #include "shoes.h" using namespace std; long long count_swaps(vector<int> a){ int n = (int) a.size(); vector<int> b; for (int i = 0; i < n; i++) { if (a[i] > 0) { b.push_back(a[i]); } } sort(b.rbegin(), b.rend()); long long ans = 0; for (int i = 0; i < n; i++) { int nxt = b[i / 2]; if (i % 2 == 0) nxt = -nxt; for (int j = i; j < n; j++) { if (a[j] == nxt) { while (j > i) { swap(a[j - 1], a[j]); ans++; j--; } break; } } } return ans; } /*int main() { ios::sync_with_stdio(false); cin.tie(0); int n; cin >> n; vector<int> a(n); for (int i = 0; i < n; i++) { cin >> a[i]; } cout << count_swaps(a); return 0; }*/
#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...