# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
401172 | victoriad | Arranging Shoes (IOI19_shoes) | C++14 | 1091 ms | 3116 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"
long long count_swaps(std::vector<int> s) {
long long int x=0;
for(int i=0;i<s.size();i+=2){
if(s[i+1]!=-1*s[i]){
int a=s[i+1];
for(int j=i+1;j<s.size();j++){
if(s[j]!=-1*s[i]){
int b=s[j];
s[j]=a;
a=b;
}
else{
s[i+1]=s[j];
s[j]=a;
x+=j-i-1;
break;
}
}
}
if(s[i+1]<s[i])x++;
}
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... |