답안 #872001

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
872001	2023-11-12T06:11:24 Z	vjudge1	Deda (COCI17_deda)	C++17	80 / 140	1000 ms	26648 KB

deda

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define len(x) (int) x.size()
#define pb push_back
mt19937 rnd(time(0));

struct query {
	char type;
	int a, b;
};

const int N = 2e5 + 7, SQ = 320, BLOCK = N / SQ + 7;
map<int, int> mp;
set<int> box[BLOCK], c[N];
vector<query> qu;
vector<int> vec;
int n, q;

void read_input() {
	cin >> n >> q;
	for (int i = 0; i < q; i++) {
		query t;
		cin >> t.type >> t.a >> t.b;
		vec.pb(t.a);
		qu.pb(t);
	}
}

void prepare() {
	sort(all(vec));
	vec.resize(unique(all(vec)) - vec.begin());
	for (int i = 0; i < len(vec); i++)
		mp[vec[i]] = i;
}

void solve() {
	for (int i = 0; i < q; i++) {
		char type = qu[i].type;
		int a = qu[i].a, b = qu[i].b;
		a = mp[a];
		if (type == 'M') {
			box[a / SQ].insert(b);
			c[a].insert(b);
		}
		else {
			int l = 0, r = a + 1, ans = INT_MAX;
			for (; l < r; ) {
				if (l % SQ || l + SQ > r) {
					if (c[l].empty() || *(--c[l].end()) < b) 
						l++;
					else {
						ans = min(ans, *c[l].lower_bound(b));
						l++;
					}
				}
				else {
					if (box[l / SQ].empty() || *(--box[l / SQ].end()) < b) 
						l += SQ;
					else {
						ans = min(ans, *box[l / SQ].lower_bound(b));
						l += SQ;
					}
				}
			}
			cout << (ans == INT_MAX? -1: ans) << '\n';
		}
	}
}

int32_t main() {
	ios:: sync_with_stdio(0), cin.tie(0), cout.tie(0);
	read_input(), prepare(), solve();
	return 0;
}

Subtask #1

80.0 / 140.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	9820 KB	Output is correct
2	Correct	2 ms	9820 KB	Output is correct
3	Correct	6 ms	10072 KB	Output is correct
4	Correct	332 ms	21592 KB	Output is correct
5	Execution timed out	1030 ms	26628 KB	Time limit exceeded
6	Execution timed out	1029 ms	26648 KB	Time limit exceeded
7	Execution timed out	1027 ms	25032 KB	Time limit exceeded