# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
49748 | model_code | Matryoshka (JOI16_matryoshka) | C++17 | 676 ms | 92744 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<stdio.h>
#include<vector>
#include<algorithm>
using namespace std;
int p[210000];
int q[210000];
int z[210000];
int s[210000];
int t[210000];
int segtree[524288];
int query(int a,int b,int c,int d,int e){
if(d<a||b<c)return 0;
if(c<=a&&b<=d)return segtree[e];
return max(query(a,(a+b)/2,c,d,e*2),query((a+b)/2+1,b,c,d,e*2+1));
}
void update(int a,int b){
a+=262144;
while(a){
segtree[a]=max(segtree[a],b);
a/=2;
}
}
int ans[210000];
vector<pair<int,pair<int,int> > >ev;
int main(){
int N,Q;
scanf("%d%d",&N,&Q);
for(int i=0;i<N;i++)scanf("%d%d",q+i,p+i);
for(int i=0;i<N;i++)z[i]=q[i];
std::sort(z,z+N);
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... |