#include <bits/stdc++.h>
#include<unordered_map>
using namespace std;
#define ll long long
#define endl "\n"
#define Sara ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
const long long mod=998244353;
const double PI=acos(-1);
int main()
{
//freopen("input.in","r",stdin);
Sara
ll n,q;
cin>>n>>q;
map<ll,ll>stops;
vector<ll>v(n+1);
while(q--){
char o;
cin>>o;
if(o=='M'){
ll x,c;
cin>>x>>c;
stops[c]=x;
}
else{
ll y,b;
cin>>y>>b;
bool ok=0;
for(int i=b;i<=n;i++){
if(stops[i]<=y && stops[i]>0){
cout<<i<<endl;
ok=1;
break;
}
}
if(!ok) cout<<-1<<endl;
}
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
29 ms |
444 KB |
Output is correct |
4 |
Execution timed out |
1083 ms |
13948 KB |
Time limit exceeded |
5 |
Execution timed out |
1086 ms |
7340 KB |
Time limit exceeded |
6 |
Execution timed out |
1082 ms |
10852 KB |
Time limit exceeded |
7 |
Execution timed out |
1088 ms |
14280 KB |
Time limit exceeded |