Submission #1305571

#TimeUsernameProblemLanguageResultExecution timeMemory
1305571ayazArranging Shoes (IOI19_shoes)C++20
10 / 100
1 ms344 KiB
#include "shoes.h" #include <bits/stdc++.h> using namespace std; #define isz(x) (int)x.size() long long count_swaps(std::vector<int> s) { vector<int> a; int n = isz(s); a.resize(n + 1); for (int i = 0; i < n; i++) a[i] = s[i]; if (n == 2) { return (a[0] > 0); } int ans = 0; for (int i = 0; i < n; i++) { int d = 1e9; for (int j = i + 1; j < n; j++) { if (a[i] + a[j] == 0 && abs(d - i) >= abs(j - i)) { d = j; } } if (d == i + 1 || d == i - 1) continue; int v = a[d]; a.erase(a.begin() + d); a.insert(a.begin() + 1 + i, v); ans += (d > i ? d - (i + 1) : (i - 1) - d); } for (int i = 0; i < n; i += 2) { ans += (a[i] > 0); } 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...