# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
165197 | theStaticMind | Deda (COCI17_deda) | C++14 | 170 ms | 4740 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 mp make_pair
#define pb push_back
#define ii pair<int,int>
#define all(x) (x).begin(),(x).end()
#define INF 100000000000000000
#define modulo 1000000007
#define mod 998244353
#define int long long int
using namespace std;
int32_t main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// freopen("q.gir","r",stdin);
// freopen("q.cik","w",stdout);
int n,q;
cin>>n>>q;
int sq=sqrt(n);
vector<int>no;
for(int i=0;i<=n;i++)no.pb(i/sq);
vector<int>Mo(no.back()+1,INF);
vector<int>P(n+1,INF);
for(int i=0;i<q;i++){
char c;
int x,y;
cin>>c>>x>>y;
if(c=='M'){
P[y]=x;
Mo[no[y]]=min(Mo[no[y]],x);
}
else{
int ind=y,ans=-1;
while(ind<=n&&no[ind]==no[ind-1]){
if(P[ind]<=x){
ans=ind;
break;
}
ind++;
}
if(ind<=n&&ans==-1){
int N=no[ind];
while(N<Mo.size()&&Mo[N]>x)N++;
if(N!=Mo.size()){
ind=N*sq;
while(ind<=n&&no[ind]==N){
if(P[ind]<=x){
ans=ind;
break;
}
ind++;
}
}
}
cout<<ans<<"\n";
}
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |