| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 397882 | snasibov05 | Arranging Shoes (IOI19_shoes) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "shoes.h"
#include <set>
using namespace std;
long long count_swaps(vector<int> s) {
long long ans = 0;
int n = s.size();
set<int> st;
for (int i = 1; i < n; i += 2) {
if (s[i] < 0) st.insert(i);
}
for (int i = 0; i < n; i += 2) {
if (s[i] < 0) continue;
ans += abs(*st.begin() - i);
st.erase(st.begin());
}
return ans;
}
