# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
75181 | vex | medians (balkan11_medians) | 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 maxn 100005
using namespace std;
int n;
bool bio[maxn];
int sol[2*maxn];
int tree[8*maxn];
int najm,najv;
void update(int v,int l,int r,int ind)
{
if(l>r || l>ind || ind>r)return;
tree[v]++;
if(l==r)return;
int mid=(l+r)/2;
update(2*v,l,mid,ind);
update(2*v+1,mid+1,r,ind);
}
int query(int v,int l,int r,int lu,int ru)
{
if(l>r || l>ru || lu>r)return 0;
if(lu<=l && r<=ru)return tree[v];
int mid=(l+r)/2;
return query(2*v,l,mid,lu,ru)+query(2*v+1,mid+1,r,lu,ru);
}
int main()