# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
154799 | TadijaSebez | Matryoshka (JOI16_matryoshka) | C++11 | 998 ms | 77308 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;
#define pb push_back
const int N=200050;
const int M=N*60;
const int lim=1e9;
int a[N],b[N],x[N],y[N];
int uid[N],qid[N],ans[N];
int ls[M],rs[M],tsz,root[2],sum[M];
void Set(int &c, int ss, int se, int qi)
{
if(!c) c=++tsz;
sum[c]++;
if(ss==se) return;
int mid=ss+se>>1;
if(qi<=mid) Set(ls[c],ss,mid,qi);
else Set(rs[c],mid+1,se,qi);
}
int Get(int c, int ss, int se, int qs, int qe)
{
if(qs>qe || qs>se || ss>qe) return 0;
if(qs<=ss && qe>=se) return sum[c];
int mid=ss+se>>1;
return Get(ls[c],ss,mid,qs,qe)+Get(rs[c],mid+1,se,qs,qe);
}
int main()
{
int n,q;
scanf("%i %i",&n,&q);
for(int i=1;i<=n;i++) scanf("%i %i",&a[i],&b[i]),uid[i]=i;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |