/* Author : Mychecksdead */
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define MOD (1000000000+7)
#define MOD1 (998244353)
#define pb push_back
#define all(x) x.begin(), x.end()
#define en cout << '\n'
const int N = 1e6+100, M = 1e5+10, K = 52, MX = 30;
int n, q, T[N];
void build(int l, int r, int k){
if(l == r){
T[k] = MOD;
return;
}
int m = l+r>>1;
build(l, m, k<<1);
build(m+1, r, k<<1|1);
T[k] = 0;
}
void upd(int l, int r, int p, int k, int val){
if(l == r){
T[k] = val;
return;
}
int m = l+r>>1;
if(p <= m) upd(l, m, p, k<<1, val);
else upd(m+1, r, p, k<<1|1, val);
T[k] = min(T[k<<1], T[k<<1|1]);
}
int get(int l, int r, int p, int k, int val){
if(r < p || T[k] > val) return -1;
if(l == r){
return l;
}
int m = l+r>>1;
int v = get(l, m, p, k<<1, val);
if(v != -1) return v;
return get(m+1, r, p, k<<1|1, val);
}
void solve(){
cin >> n >> q;
build(1, n, 1);
for(int i = 0; i < q; ++i){
char c; cin >> c;
if(c == 'M'){
int X, A; cin >> X >> A;
upd(1, n, A, 1, X);
}else{
int B, Y; cin >> Y >> B;
cout << get(1, n, B, 1, Y) << '\n';
}
}
}
int main(){
cin.tie(0); ios::sync_with_stdio(0);
int tt = 1, aa;
// freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
while(tt--){
solve();
en;
}
cerr<<"time taken : "<<(float)clock()/CLOCKS_PER_SEC<<" seconds\n";
return 0;
}
Compilation message
deda.cpp: In function 'void build(int, int, int)':
deda.cpp:18:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
18 | int m = l+r>>1;
| ~^~
deda.cpp: In function 'void upd(int, int, int, int, int)':
deda.cpp:28:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
28 | int m = l+r>>1;
| ~^~
deda.cpp: In function 'int get(int, int, int, int, int)':
deda.cpp:38:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
38 | int m = l+r>>1;
| ~^~
deda.cpp: In function 'int main()':
deda.cpp:62:15: warning: unused variable 'aa' [-Wunused-variable]
62 | int tt = 1, aa;
| ^~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Correct |
1 ms |
344 KB |
Output is correct |
3 |
Correct |
3 ms |
344 KB |
Output is correct |
4 |
Execution timed out |
1022 ms |
2772 KB |
Time limit exceeded |
5 |
Execution timed out |
1046 ms |
4596 KB |
Time limit exceeded |
6 |
Execution timed out |
1045 ms |
3812 KB |
Time limit exceeded |
7 |
Execution timed out |
1029 ms |
3576 KB |
Time limit exceeded |