# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
520104 | A_D | Arranging Shoes (IOI19_shoes) | C++14 | 1060 ms | 3140 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){
long long ans=0;
int n=s.size();
vector<bool> vis(n);
for(int i=0;i<n;i++){
if(vis[i])continue;
vis[i]=1;
int u=-s[i];
int k;
for(int j=i+1;j<n;j++){
if(vis[j])continue;
if(s[j]==u){
k=j;
vis[j]=1;
break;
}
}
// cout<<i<<" "<<k<<endl;
// for(int j=0;j<n;j++)cout<<s[j]<<" ";cout<<endl;
// for(int j=0;j<n;j++)cout<<vis[j]<<" ";cout<<endl;
int h=i;
if(s[i]<0)h++;
for(int j=k;j>h;j--){
swap(vis[j],vis[j-1]);
swap(s[j],s[j-1]);
ans++;
}
}
return ans;
}
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... |