///made by : Mr_Ph :D
#include<bits/stdc++.h>
#include<unordered_map>
typedef long long ll;
typedef long long int lli;
typedef unsigned long long ull;
using namespace std;
const double PI=acos(-1.0);
const ll mod=(ll)1e9+7;
//int dx[4] = {0, 0, 1, -1};
//int dy[4] = {1, -1, 0, 0};
///the defines :)
#define endl '\n'
#define vi vector<int>
#define vll vector<ll>
#define lower(s) transform(s.begin(),s.end(),s.begin(),::tolower)
#define upper(s) transform(s.begin(),s.end(),s.begin(),::toupper)
#define ent(arr) for(int i=0;i<arr.size();i++)cin>>arr[i];
#define all(arr) arr.begin(),arr.end()
#define allr(arr) arr.rbegin(),arr.rend()
#define sz size()
///the end of the defines ;)
void solve()
{
int n,m;
cin>>n>>m;
map<int,int>mp;
for(int i=0;i<m;i++)
{
char x;
cin>>x;
if(x=='M')
{
int a,b;
cin>>a>>b;
mp[b]=a;
}
else
{
int a,b;
cin>>a>>b;
int done=0;
for(int i=b; i<=n; i++)
{
if(mp[i]<=a&&mp[i])
{
cout<<i<<endl;
done++;
break;
}
}
if(!done)
cout<<-1<<endl;
}
}
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(0);
//freopen("window.in","r",stdin);
//freopen("output.txt","w",stdout);
int t=1;//int st;
//cin>>t;//cin>>st;
while(t--)
solve();
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
24 ms |
372 KB |
Output is correct |
4 |
Execution timed out |
1093 ms |
9308 KB |
Time limit exceeded |
5 |
Execution timed out |
1081 ms |
5076 KB |
Time limit exceeded |
6 |
Execution timed out |
1094 ms |
7492 KB |
Time limit exceeded |
7 |
Execution timed out |
1088 ms |
9472 KB |
Time limit exceeded |