# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
721360 | sofija6 | 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 <bits/stdc++.h>
#define ll long long
using namespace std;
ll n;
struct bit
{
vector<ll> v;
void Init()
{
v.resize(n+5);
}
void Add(ll pos,ll val)
{
for (ll i=pos;i<=n;i+=i&(-i))
v[i]+=val;
}
ll Sum(ll pos)
{
ll ans=0;
for (ll i=pos;i>0;i-=i&(-i))
ans+=v[i];
return ans;
}
ll Calc(ll l,ll r)
{
return Sum(r)-Sum(l-1);
}
};
ll count_swaps(vector<int> S)
{