| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 428360 | A_D | Arranging Shoes (IOI19_shoes) | C++14 | 0 ms | 0 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;
vector<int> vec;
long long ans=0,cnt=0;
vector<int> s;
set<ii> st;
map<ii,int> mp;
void fix(int x)
{
for(int i=0;i<s.size();i++){
if(s[i]==x){
for(int j=i-1;j>=cnt;j--){
ans++;
swap(s[j],s[j+1]);
}
for(int j=i+1;j<=cnt;j++){
ans++;
swap(s[j],s[j-1]);
}
break;
}
}
cnt+=2;
}
long long count_swaps(std::vector<int> S){
s=S;
vec.clear();ans=0;cnt=0;
for(int i=0;i<s.size();i++){
if(s[i]<0){
vec.push_back(abs(s[i]));
}
}
int l=0,r=vec.size()-1;
while(l<=r){
int h=l+r;
h%=2;
if(h){
cnt=l*2;
fix(-vec[l]);
l++;
}
else{
cnt=r*2;
fix(-vec[r]);
r--;
}
}
l=0;r=vec.size()-1;
while(l<=r){
int h=l+r;
h%=2;
if(h){
cnt=l*2;
fix(vec[l]);
l++;
}
else{
cnt=r*2;
fix(vec[r]);
r--;
}
}
return ans;
}
