Submission #727640

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
727640	2023-04-21T04:30:06 Z	SanguineChameleon	New Home (APIO18_new_home)	C++17	5 / 100	5000 ms	88048 KB

new_home

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

void just_do_it();

int main() {
	#ifdef KAMIRULEZ
		freopen("kamirulez.inp", "r", stdin);
		freopen("kamirulez.out", "w", stdout);
	#endif
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	just_do_it();
	return 0;
}

struct store {
	int pos, type, left_T, right_T;
};

struct query {
	int pos, T;
};

const int inf = 1e8 + 20;
const int maxn = 3e5 + 20;
store S[maxn];
query Q[maxn];
set<int> bad[maxn];
set<int> val_pos[maxn];
int res[maxn];
int n, k, q;

void add_bad(int lt, int rt, int val) {
	if (lt > rt) {
		return;
	}
	if (rt == n) {
		rt += val - 1;
	}
	bad[lt].insert(rt);
}

void rem_bad(int lt, int rt, int val) {
	if (lt > rt) {
		return;
	}
	if (rt == n) {
		rt += val - 1;
	}
	bad[lt].erase(rt);
}

void add_val(int pos, int val) {
	auto it = val_pos[val].insert(pos).first;
	int prv = (it == val_pos[val].begin() ? 0 : *prev(it));
	int nxt = (next(it) == val_pos[val].end() ? n + 1 : *next(it));
	rem_bad(prv + 1, nxt - 1, val);
	add_bad(prv + 1, pos - 1, val);
	add_bad(pos + 1, nxt - 1, val);
}

void rem_val(int pos, int val) {
	auto it = val_pos[val].lower_bound(pos);
	int prv = (it == val_pos[val].begin() ? 0 : *prev(it));
	int nxt = (next(it) == val_pos[val].end() ? n + 1 : *next(it));
	rem_bad(prv + 1, pos - 1, val);
	rem_bad(pos + 1, nxt - 1, val);
	add_bad(prv + 1, nxt - 1, val);
	val_pos[val].erase(it);
}

bool check(int lt, int rt) {
	if (lt > rt) {
		return false;
	}
	for (int i = 1; i <= lt; i++) {
		if (!bad[i].empty() && *bad[i].rbegin() >= rt) {
			return false;
		}
	}
	return true;
}

void just_do_it() {
	cin >> n >> k >> q;
	for (int i = 1; i <= k; i++) {
		add_bad(1, n, i);
	}
	vector<pair<int, int>> sorted_pos;
	vector<pair<int, pair<int, int>>> events;
	for (int i = 1; i <= n; i++) {
		cin >> S[i].pos >> S[i].type >> S[i].left_T >> S[i].right_T;
		sorted_pos.push_back({S[i].pos, i});
		events.push_back({S[i].left_T, {1, i}});
		events.push_back({S[i].right_T, {3, i}});
	}
	sort(sorted_pos.begin(), sorted_pos.end());
	for (int i = 1; i <= n; i++) {
		S[sorted_pos[i - 1].second].pos = i;
	}
	for (int i = 1; i <= q; i++) {
		cin >> Q[i].pos >> Q[i].T;
		events.push_back({Q[i].T, {2, i}});
	}
	sort(events.begin(), events.end());
	for (auto e: events) {
		int type = e.second.first;
		int id = e.second.second;
		if (type == 1) {
			add_val(S[id].pos, S[id].type);
		}
		if (type == 2) {
			res[id] = -1;
			int lt = 0;
			int rt = inf;
			while (lt <= rt) {
				int mt = (lt + rt) / 2;
				int ql = lower_bound(sorted_pos.begin(), sorted_pos.end(), make_pair(Q[id].pos - mt, -inf)) - sorted_pos.begin() + 1;
				int qr = upper_bound(sorted_pos.begin(), sorted_pos.end(), make_pair(Q[id].pos + mt, inf)) - sorted_pos.begin();
				if (check(ql, qr)) {
					res[id] = mt;
					rt = mt - 1;
				}
				else {
					lt = mt + 1;
				}
			}
		}
		if (type == 3) {
			rem_val(S[id].pos, S[id].type);
		}
	}
	for (int i = 1; i <= q; i++) {
		cout << res[i] << '\n';
	}
}

Subtask #1
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	15 ms	28500 KB	Output is correct
2	Correct	14 ms	28500 KB	Output is correct
3	Correct	13 ms	28432 KB	Output is correct
4	Correct	14 ms	28500 KB	Output is correct
5	Correct	15 ms	28500 KB	Output is correct
6	Correct	17 ms	28484 KB	Output is correct
7	Correct	15 ms	28480 KB	Output is correct
8	Correct	16 ms	28492 KB	Output is correct
9	Correct	17 ms	28592 KB	Output is correct
10	Correct	21 ms	28588 KB	Output is correct
11	Correct	16 ms	28508 KB	Output is correct
12	Correct	19 ms	28488 KB	Output is correct
13	Correct	15 ms	28496 KB	Output is correct
14	Correct	15 ms	28500 KB	Output is correct
15	Correct	16 ms	28584 KB	Output is correct
16	Correct	16 ms	28468 KB	Output is correct
17	Correct	15 ms	28480 KB	Output is correct
18	Correct	15 ms	28560 KB	Output is correct
19	Correct	15 ms	28564 KB	Output is correct
20	Correct	15 ms	28500 KB	Output is correct
21	Correct	15 ms	28500 KB	Output is correct
22	Correct	15 ms	28596 KB	Output is correct
23	Correct	15 ms	28500 KB	Output is correct
24	Correct	15 ms	28500 KB	Output is correct
25	Correct	14 ms	28504 KB	Output is correct
26	Correct	16 ms	28500 KB	Output is correct
27	Correct	15 ms	28568 KB	Output is correct
28	Correct	15 ms	28500 KB	Output is correct
29	Correct	15 ms	28464 KB	Output is correct
30	Correct	17 ms	28500 KB	Output is correct

Subtask #2
0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	15 ms	28500 KB	Output is correct
2	Correct	14 ms	28500 KB	Output is correct
3	Correct	13 ms	28432 KB	Output is correct
4	Correct	14 ms	28500 KB	Output is correct
5	Correct	15 ms	28500 KB	Output is correct
6	Correct	17 ms	28484 KB	Output is correct
7	Correct	15 ms	28480 KB	Output is correct
8	Correct	16 ms	28492 KB	Output is correct
9	Correct	17 ms	28592 KB	Output is correct
10	Correct	21 ms	28588 KB	Output is correct
11	Correct	16 ms	28508 KB	Output is correct
12	Correct	19 ms	28488 KB	Output is correct
13	Correct	15 ms	28496 KB	Output is correct
14	Correct	15 ms	28500 KB	Output is correct
15	Correct	16 ms	28584 KB	Output is correct
16	Correct	16 ms	28468 KB	Output is correct
17	Correct	15 ms	28480 KB	Output is correct
18	Correct	15 ms	28560 KB	Output is correct
19	Correct	15 ms	28564 KB	Output is correct
20	Correct	15 ms	28500 KB	Output is correct
21	Correct	15 ms	28500 KB	Output is correct
22	Correct	15 ms	28596 KB	Output is correct
23	Correct	15 ms	28500 KB	Output is correct
24	Correct	15 ms	28500 KB	Output is correct
25	Correct	14 ms	28504 KB	Output is correct
26	Correct	16 ms	28500 KB	Output is correct
27	Correct	15 ms	28568 KB	Output is correct
28	Correct	15 ms	28500 KB	Output is correct
29	Correct	15 ms	28464 KB	Output is correct
30	Correct	17 ms	28500 KB	Output is correct
31	Execution timed out	5048 ms	33948 KB	Time limit exceeded
32	Halted	0 ms	0 KB	-

Subtask #3
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1567 ms	83332 KB	Output is correct
2	Execution timed out	5031 ms	88048 KB	Time limit exceeded
3	Halted	0 ms	0 KB	-

Subtask #4
0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	5062 ms	77236 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #5
0 / 35.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	15 ms	28500 KB	Output is correct
2	Correct	14 ms	28500 KB	Output is correct
3	Correct	13 ms	28432 KB	Output is correct
4	Correct	14 ms	28500 KB	Output is correct
5	Correct	15 ms	28500 KB	Output is correct
6	Correct	17 ms	28484 KB	Output is correct
7	Correct	15 ms	28480 KB	Output is correct
8	Correct	16 ms	28492 KB	Output is correct
9	Correct	17 ms	28592 KB	Output is correct
10	Correct	21 ms	28588 KB	Output is correct
11	Correct	16 ms	28508 KB	Output is correct
12	Correct	19 ms	28488 KB	Output is correct
13	Correct	15 ms	28496 KB	Output is correct
14	Correct	15 ms	28500 KB	Output is correct
15	Correct	16 ms	28584 KB	Output is correct
16	Correct	16 ms	28468 KB	Output is correct
17	Correct	15 ms	28480 KB	Output is correct
18	Correct	15 ms	28560 KB	Output is correct
19	Correct	15 ms	28564 KB	Output is correct
20	Correct	15 ms	28500 KB	Output is correct
21	Correct	15 ms	28500 KB	Output is correct
22	Correct	15 ms	28596 KB	Output is correct
23	Correct	15 ms	28500 KB	Output is correct
24	Correct	15 ms	28500 KB	Output is correct
25	Correct	14 ms	28504 KB	Output is correct
26	Correct	16 ms	28500 KB	Output is correct
27	Correct	15 ms	28568 KB	Output is correct
28	Correct	15 ms	28500 KB	Output is correct
29	Correct	15 ms	28464 KB	Output is correct
30	Correct	17 ms	28500 KB	Output is correct
31	Execution timed out	5048 ms	33948 KB	Time limit exceeded
32	Halted	0 ms	0 KB	-

Subtask #6
0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	15 ms	28500 KB	Output is correct
2	Correct	14 ms	28500 KB	Output is correct
3	Correct	13 ms	28432 KB	Output is correct
4	Correct	14 ms	28500 KB	Output is correct
5	Correct	15 ms	28500 KB	Output is correct
6	Correct	17 ms	28484 KB	Output is correct
7	Correct	15 ms	28480 KB	Output is correct
8	Correct	16 ms	28492 KB	Output is correct
9	Correct	17 ms	28592 KB	Output is correct
10	Correct	21 ms	28588 KB	Output is correct
11	Correct	16 ms	28508 KB	Output is correct
12	Correct	19 ms	28488 KB	Output is correct
13	Correct	15 ms	28496 KB	Output is correct
14	Correct	15 ms	28500 KB	Output is correct
15	Correct	16 ms	28584 KB	Output is correct
16	Correct	16 ms	28468 KB	Output is correct
17	Correct	15 ms	28480 KB	Output is correct
18	Correct	15 ms	28560 KB	Output is correct
19	Correct	15 ms	28564 KB	Output is correct
20	Correct	15 ms	28500 KB	Output is correct
21	Correct	15 ms	28500 KB	Output is correct
22	Correct	15 ms	28596 KB	Output is correct
23	Correct	15 ms	28500 KB	Output is correct
24	Correct	15 ms	28500 KB	Output is correct
25	Correct	14 ms	28504 KB	Output is correct
26	Correct	16 ms	28500 KB	Output is correct
27	Correct	15 ms	28568 KB	Output is correct
28	Correct	15 ms	28500 KB	Output is correct
29	Correct	15 ms	28464 KB	Output is correct
30	Correct	17 ms	28500 KB	Output is correct
31	Execution timed out	5048 ms	33948 KB	Time limit exceeded
32	Halted	0 ms	0 KB	-

Submission #727640

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 0 / 7.0

Subtask #3 0 / 10.0

Subtask #4 0 / 23.0

Subtask #5 0 / 35.0

Subtask #6 0 / 20.0

Subtask #1
5.0 / 5.0

Subtask #2
0 / 7.0

Subtask #3
0 / 10.0

Subtask #4
0 / 23.0

Subtask #5
0 / 35.0

Subtask #6
0 / 20.0