# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1047332 | vjudge1 | 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>
using namespace std;
const int mxN = 1e5 + 7;
int tree[mxN];
int n;
void upd(int l,int r)
{
l++;
for( ;n > l;l += l & -l) tree[l]++;
for( ;n > r;r += r & -r) tree[r]--;
}
int que(int pos)
{
pos--;
int res = 0;
for( ;pos > 0;pos -= pos & -pos) res += tree[pos];
return res;
}
int64_t count_swaps(int a[])
{
return a[0] < a[1];
}
int main()
{
}