# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
85544 | memetkagan44 | Deda (COCI17_deda) | C++11 | 152 ms | 18384 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;
int n,q,a,b,ar[800005];
char tur;
void upd(int ara,int x,int i,int l,int r){
ar[i]=min(ar[i],x);
if(l==r)
return;
int mid=(l+r)/2;
if(ara<=mid)
upd(ara,x,2*i,l,mid);
else
upd(ara,x,2*i+1,mid+1,r);
}
int qry(int ara,int x,int i,int l,int r){
if(ar[i]>x)
return -2;
if(l==r)
return l;
int mid=(l+r)/2;
int res=-2;
if(ara<=mid)
res=qry(ara,x,2*i,l,mid);
if(res==-2)
res=qry(ara,x,2*i+1,mid+1,r);
return res;
}
int main(){
scanf("%d %d",&n,&q);
memset(ar,0x3f,sizeof(ar));
while(q--){
scanf(" %c %d %d",&tur,&a,&b);
if(tur=='M')
upd(b-1,a,1,0,n-1);
else
printf("%d\n",qry(b-1,a,1,0,n-1)+1);
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |