# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
144861 | DanerZein | Arranging Shoes (IOI19_shoes) | C++14 | 1080 ms | 2044 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;
int c,i,j,id;
long long count_swaps(std::vector<int> s) {
c=0;
for(i=0;i<s.size();i++){
if(i%2==0){
/* if(s[i]<0 and s[i+1]>0){
i++;
continue;
}*/
if(s[i]>0){
for(j=i+1;j<s.size();j++){
if(s[j]<0){
id=j;
break;
}
}
for(j=id;j>i;j--){
c++;
swap(s[j],s[j-1]);
}
}
}
else{
/* if(s[i]>0 and s[i+1]<0){
i++;
continue;
}*/
if(s[i]<0){
for(j=i+1;j<s.size();j++){
if(s[j]>0){
id=j;
break;
}
}
for(j=id;j>i;j--){
c++;
swap(s[j],s[j-1]);
}
}
}
}
return c;
}
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... |