# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
994314 | cpdreamer | Arranging Shoes (IOI19_shoes) | C++17 | 1097 ms | 3164 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) {
int n=(int)s.size();
long long c=0;
for(int i=0;i<n-1;i++){
if(i%2==0){
if(s[i]<0)
continue;
int index;
for(int j=i+1;j<n;j++){
if(s[j]<0){
index=j;
break;
}
}
for(int j=index;j>i;j--){
swap(s[j],s[j-1]);
c++;
}
}
else{
if(s[i]==-s[i-1])
continue;
int index;
for(int j=i+1;j<n;j++){
if(s[j]==-s[i-1]){
index=j;
break;
}
}
for(int j=index;j>i;j--){
swap(s[j],s[j-1]);
c++;
}
}
}
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... |