# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
227185 | urd05 | Arranging Shoes (IOI19_shoes) | C++14 | 41 ms | 3832 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 <bits/stdc++.h>
using namespace std;
vector<int> pl;
vector<int> mi;
long long count_swaps(vector<int> v) {
int n=v.size()/2;
for(int i=0;i<2*n;i++) {
if (v[i]>0) {
pl.push_back(i);
}
else {
mi.push_back(i);
}
}
long long ret=0;
int used=0;
vector<int> big;
int ind=0;
for(int i=0;i<n;i++) {
if (pl[i]>mi[i]) {
ret+=pl[i]-mi[i]-1;
big.push_back(pl[i]);
}
else {
ret+=mi[i]-pl[i];
big.push_back(mi[i]);
}
while (ind<big.size()&&big[ind]<min(pl[i],mi[i])) {
ind++;
used--;
}
ret-=used;
used++;
}
return ret;
}
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... |