| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 155330 | Sasuke0004 | 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>
#define f first
#define s second
#define mp make_pair
#define ll long long
#define pb push_back
#define left 2*h,l,(l+r)/2,L,R
#define right 2*h+1,(l+r)/2+1,r,L,R
#define tree int h,int l,int r,int L,int R
using namespace std;
ll sg[2000006],fx[2000006],n,ans;
vector<int>v[2000006],x;
void upd(tree)
{
if(l>r)return;
if(l>R)return;
if(L>r)return;
if(l==r)
{
sg[h]=sg[h]^(1);
return;
}
sg[h]=sg[2*h]+sg[2*h+1];
}
ll get(tree)
{
if(l>r)return 0;
if(l>R)return 0;
if(L>r)return 0;
if(l>=L && r<=R)return sg[h];
else return get(left)+get(right);
}
int64_t count_swaps(vector<int> x)
{
n=x.size();
for(int i=0;i<n;i++)
{
v[n+x[i]].pb(i);
}
for(int i=0;i<n;i++)
{
for(int j=0;j<int(v[i].size());j++)
{
if(v[i][j]>v[i+n][j]){ans++;swap(v[i][j],v[i+n][j]);}
fx[v[i][j]]=v[i+n][j];
}
}
for(int i=0;i<n;i++)
{
upd(1,0,n-1,i,i);
}
for(int i=0;i<n;i++)
{
ans+=get(1,0,n-1,i,fx[i]);
upd(1,0,n-1,fx[i],fx[i]);
}
return ans;
}
#include<bits/stdc++.h>
#define f first
#define s second
#define mp make_pair
#define ll long long
#define pb push_back
#define left 2*h,l,(l+r)/2,L,R
#define right 2*h+1,(l+r)/2+1,r,L,R
#define tree int h,int l,int r,int L,int R
using namespace std;
ll sg[2000006],fx[2000006],n,ans;
vector<int>v[2000006],x;
void upd(tree)
{
if(l>r)return;
if(l>R)return;
if(L>r)return;
if(l==r)
{
sg[h]=sg[h]^(1);
return;
}
sg[h]=sg[2*h]+sg[2*h+1];
}
ll get(tree)
{
if(l>r)return 0;
if(l>R)return 0;
if(L>r)return 0;
if(l>=L && r<=R)return sg[h];
else return get(left)+get(right);
}
int64_t count_swaps(vector<int> x)
{
n=x.size();
for(int i=0;i<n;i++)
{
v[n+x[i]].pb(i);
}
for(int i=0;i<n;i++)
{
for(int j=0;j<int(v[i].size());j++)
{
if(v[i][j]>v[i+n][j]){ans++;swap(v[i][j],v[i+n][j]);}
fx[v[i][j]]=v[i+n][j];
}
}
for(int i=0;i<n;i++)
{
upd(1,0,n-1,i,i);
}
for(int i=0;i<n;i++)
{
ans+=get(1,0,n-1,i,fx[i]);
upd(1,0,n-1,fx[i],fx[i]);
}
return ans;
}