# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
623576 | Vanio | 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>
using namespace std;
long long n,a[200006],i,t=1,p[200006],j,b[200006],br,f[200006],q;
vector<int> l[200006],r[200006];
void upd(int k, int d){
while(k<=n){
b[k]+=d;
k=k+(k&(-k));
}
}
int rsq(int k){
long long s=0;
while(k>0){
s=s+b[k];
k=k-(k&(-k));
}
return s;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin>>n;
n=n*2;