# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
384197 | meperdonas203 | Arranging Shoes (IOI19_shoes) | C++17 | 1093 ms | 3308 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 movs=0;
for(int i=0;i<s.size();i+=2){
for(int j=i+1;j<s.size();j++){
if(abs(s[i])==abs(s[j])and (s[i]!=s[j])){
int pos_r=0;
pos_r=j;
while(pos_r>i+1){
swap(s[pos_r],s[pos_r-1]);
pos_r--;
movs++;
}
if(s[i]>s[i+1]){
movs++;
}
break;
}
}
}
return movs;
}
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... |