| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 486799 | Haidara | Arranging Shoes (IOI19_shoes) | C++17 | 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<bits/stdc++.h>
#include<grader.h>
#define rep(i,x,n) for(int i=(x);i<(n);i++)
#define FOR(i,n) rep(i,0,n)
#define v(i) vector< i >
#define ll long long
using namespace std;
const ll inf=1LL<<62LL;
const ll mod=1e9+7;
const ll maxn=100200;
ll count_swaps(v(ll)a)
{
ll ans=0;
ll n=a.size()
set<int>posl[maxn],posr[maxn];
FOR(i,n)
if(a[i]<0)
posl[-a[i]].insert(i);
else
posr[a[i]].insert(i);
v(bool)vis(maxn,0);
for(int i=0;i<n;i++)
{
if(vis[i])
continue;
if(a[i]>0)
ans++;
if(a[i]<0)
a[i]*=-1;
vis[*posr[a[i]].begin()]=1;
vis[*posl[a[i]].begin()]=1;
ans+=abs(*posr[a[i]].begin()-*posl[a[i]].begin());
posl[a[i]].erase(posl[a[i]].begin());
posr[a[i]].erase(posr[a[i]].begin());
}
return ans;
}