oj.uz

답안 #676148

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
676148 2022-12-29T13:50:43 Z Trisanu_Das Deda (COCI17_deda) C++17
0 / 140
 59 ms 2900 KB 
#include <bits/stdc++.h>
using namespace std;
 
const int mxN=2e5;
int n, q, a, b, segtree[1<<19];
char op;
 
void update(int s, int x, int i=1, int l=0, int r=n-1) {
	segtree[i]=min(x, segtree[i]);
	if(l==r) return;
	int m=(l+r)/2;
	if(s<=m) update(s, x, 2*i, l, m);
	else update(s, x, 2*i+1, m+1, r);
}
 
int query(int s, int x, int i=1, int l=0, int r=n-1) {
	if(segtree[i]>x) return -2;
	if(l==r) return l;
	int m=(l+r)/2, e = -2;
	if(s<=m) e = query(s, x, 2*i, l, m);
	if(r==-2) e = query(s, x, 2*i+1, m+1, r);
	return e;
}
 
int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> n >> q;
	memset(segtree, 0x3f, sizeof(segtree));
	while(q--) {
		cin >> op >> a >> b, --b;
		if(op=='M') update(b, a);
		else cout << query(b, a)+1 << "\n";
	}
}

Subtask #1
0 / 140.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 2260 KB Output isn't correct
2 Incorrect 1 ms 2260 KB Output isn't correct
3 Incorrect 2 ms 2388 KB Output isn't correct
4 Incorrect 55 ms 2900 KB Output isn't correct
5 Incorrect 56 ms 2704 KB Output isn't correct
6 Incorrect 57 ms 2764 KB Output isn't correct
7 Incorrect 59 ms 2816 KB Output isn't correct