제출 #111835

#제출 시각아이디문제언어결과실행 시간메모리
111835vexDeda (COCI17_deda)C++14
0 / 140
595 ms4316 KiB
#include<bits/stdc++.h>
#define maxn 200005
#define INF 1000000007
using namespace std;

int n;
int a[maxn];
int blok,len;
int b[1000];

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	
	cin>>n;
	for(int i=0;i<n;i++)a[i]=INF;
	blok=sqrt(n);
	len=(n+blok-1)/blok;
	for(int i=0;i<len;i++)b[i]=INF;
	
	int q;
	cin>>q;
	while(q>0)
	{
		char c;
		cin>>c;
		if(c=='M')
		{
			int st,uzr;
			cin>>st>>uzr;
			uzr--;
			
			a[uzr]=st;
			int bb=uzr/blok;
			b[bb]=min(b[bb],st);
		}
		else
		{
			int br,uzr;
			cin>>br>>uzr;
			uzr--;
			
			while(uzr<n && uzr%blok!=0 && a[uzr]>br)uzr++;
			
			int bb=uzr/blok;
			while(bb<len && b[bb]>br)
			{
				uzr+=blok;
				bb++;
			}
			
			if(uzr<n)cout<<uzr+1<<endl;
			else cout<<"-1"<<endl;
		}
      	q--;
	}
	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...