# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
889458 | Lincito_31 | Arranging Shoes (IOI19_shoes) | C++14 | 26 ms | 4056 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>
#include "shoes.h"
using namespace std;
long long x=0;
long long count_swaps(vector<int> s) {
vector<int> xd_po;
vector<int> xd_ne;
for(int i=0;i<s.size();i++){
if(s[i]<0){
if(i%2!=0){
xd_ne.push_back(i);
}
}else{
if(i%2==0){
xd_po.push_back(i);
}
}
}
for(int i=0;i<xd_po.size();i++){
if(xd_po[i]>xd_ne[i]){
x+=xd_po[i]-xd_ne[i];
}else{
x+=xd_ne[i]-xd_po[i];
}
}
return x;
}
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... |