# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
948014 | study | Arranging Shoes (IOI19_shoes) | C++17 | 1071 ms | 11348 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 <bits/stdc++.h>
using namespace std;
long long count_swaps(vector<int> s) {
set<int> st;
for (int i:s){
st.emplace(i);
}
if (st.size() == 2){
int crt = 0, ans = 0;
for (int i=0; i<s.size(); ++i){
if (s[i] < 0){
ans += abs(crt-i);
crt += 2;
}
}
return ans;
}
int cnt=0, n = s.size();
for (int i=0; i<n; i += 2){
int idx = 0;
for (int j=i+1; j<n; ++j){
if (s[i] == -s[j]){
idx = j;
break;
}
}
for (int j=idx; j>=i+2; --j){
swap(s[j],s[j-1]);
++cnt;
}
if (s[i] > 0){
++cnt;
}
}
return cnt;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |