Submission #838872

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
838872	2023-08-28T03:22:12 Z	pavement	Minerals (JOI19_minerals)	C++17	40 / 100	21 ms	2780 KB

minerals

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

#define pb push_back
#define mp make_pair

void Solve(int N) {
	vector<int> uniq, others;
	for (int i = 0, prv = 0; i < 2 * N; i++) {
		if (Query(i + 1) > prv) {
			uniq.pb(i);
			prv++;
		} else {
			others.pb(i);
		}
	}
	for (int i = 0; i < 2 * N; i++) {
		Query(i + 1);
	}
	vector<int> lo(2 * N, 0), hi(2 * N, N - 1), mid(2 * N), ans(2 * N, -1);
	int cur_l = -1, cur_r = -1, prv = -1;
	
	auto shift = [&](int new_l, int new_r) {
		if (cur_l == -1 || cur_r - cur_l + 1 + new_r - new_l + 1 < abs(cur_l - new_l) + abs(cur_r - new_r)) {
			if (cur_l != -1) {
				for (int i = cur_l; i <= cur_r; i++) {
					prv = Query(uniq[i] + 1);
				}
			}
			for (int i = new_l; i <= new_r; i++) {
				prv = Query(uniq[i] + 1);
			}
		} else {
			if (new_l <= cur_l) {
				for (int i = cur_l - 1; i >= new_l; i--) {
					prv = Query(uniq[i] + 1);
				}
				if (new_r <= cur_r) {
					for (int i = cur_r; i > new_r; i--) {
						prv = Query(uniq[i] + 1);
					}
				} else {
					for (int i = cur_r + 1; i <= new_r; i++) {
						prv = Query(uniq[i] + 1);
					}
				}
			} else {
				if (new_r <= cur_r) {
					for (int i = cur_r; i > new_r; i--) {
						prv = Query(uniq[i] + 1);
					}
				} else {
					for (int i = cur_r + 1; i <= new_r; i++) {
						prv = Query(uniq[i] + 1);
					}
				}
				for (int i = cur_l; i < new_l; i++) {
					prv = Query(uniq[i] + 1);
				}
			}
		}
		cur_l = new_l;
		cur_r = new_r;
	};
	
	for (int rep = 0; (1 << rep) <= N; rep++) {
		vector<bool> can(2 * N, 0);
		for (int i : others) {
			mid[i] = (lo[i] + hi[i]) / 2;
			// insert [lo[i], mid[i]] from uniq
		}
		sort(others.begin(), others.end(), [&](const auto &lhs, const auto &rhs) {
			return mp(lo[lhs], mid[rhs]) < mp(lo[rhs], mid[rhs]);
		});
		for (int i : others) {
			shift(lo[i], mid[i]);
			int ret_1 = Query(i + 1);
			int ret_2 = Query(i + 1);
			if (ret_1 == ret_2) {
				can[i] = 1;
			}
		}
		for (int i : others) {
			if (can[i]) {
				ans[i] = mid[i];
				hi[i] = mid[i] - 1;
			} else {
				lo[i] = mid[i] + 1;
			}
		}
	}
	for (int i : others) {
		Answer(i + 1, uniq[ans[i]] + 1);
	}
}

Subtask #1
6.0 / 6.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	208 KB	Output is correct
2	Correct	0 ms	208 KB	Output is correct
3	Correct	0 ms	208 KB	Output is correct
4	Correct	0 ms	208 KB	Output is correct

Subtask #2
25.0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	336 KB	Output is correct
2	Correct	2 ms	336 KB	Output is correct
3	Correct	3 ms	592 KB	Output is correct
4	Correct	6 ms	748 KB	Output is correct
5	Correct	13 ms	1360 KB	Output is correct

Subtask #3
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	208 KB	Output is correct
2	Correct	0 ms	208 KB	Output is correct
3	Correct	0 ms	208 KB	Output is correct
4	Correct	0 ms	208 KB	Output is correct
5	Correct	1 ms	336 KB	Output is correct
6	Correct	2 ms	336 KB	Output is correct
7	Correct	3 ms	592 KB	Output is correct
8	Correct	6 ms	748 KB	Output is correct
9	Correct	13 ms	1360 KB	Output is correct
10	Correct	1 ms	336 KB	Output is correct
11	Correct	8 ms	976 KB	Output is correct
12	Correct	14 ms	1316 KB	Output is correct
13	Correct	11 ms	1372 KB	Output is correct
14	Correct	12 ms	1260 KB	Output is correct

Subtask #4
0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	208 KB	Output is correct
2	Correct	0 ms	208 KB	Output is correct
3	Correct	0 ms	208 KB	Output is correct
4	Correct	0 ms	208 KB	Output is correct
5	Correct	1 ms	336 KB	Output is correct
6	Correct	2 ms	336 KB	Output is correct
7	Correct	3 ms	592 KB	Output is correct
8	Correct	6 ms	748 KB	Output is correct
9	Correct	13 ms	1360 KB	Output is correct
10	Correct	1 ms	336 KB	Output is correct
11	Correct	8 ms	976 KB	Output is correct
12	Correct	14 ms	1316 KB	Output is correct
13	Correct	11 ms	1372 KB	Output is correct
14	Correct	12 ms	1260 KB	Output is correct
15	Incorrect	21 ms	2780 KB	Wrong Answer [2]
16	Halted	0 ms	0 KB	-

Subtask #5
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	208 KB	Output is correct
2	Correct	0 ms	208 KB	Output is correct
3	Correct	0 ms	208 KB	Output is correct
4	Correct	0 ms	208 KB	Output is correct
5	Correct	1 ms	336 KB	Output is correct
6	Correct	2 ms	336 KB	Output is correct
7	Correct	3 ms	592 KB	Output is correct
8	Correct	6 ms	748 KB	Output is correct
9	Correct	13 ms	1360 KB	Output is correct
10	Correct	1 ms	336 KB	Output is correct
11	Correct	8 ms	976 KB	Output is correct
12	Correct	14 ms	1316 KB	Output is correct
13	Correct	11 ms	1372 KB	Output is correct
14	Correct	12 ms	1260 KB	Output is correct
15	Incorrect	21 ms	2780 KB	Wrong Answer [2]
16	Halted	0 ms	0 KB	-

Subtask #6
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	208 KB	Output is correct
2	Correct	0 ms	208 KB	Output is correct
3	Correct	0 ms	208 KB	Output is correct
4	Correct	0 ms	208 KB	Output is correct
5	Correct	1 ms	336 KB	Output is correct
6	Correct	2 ms	336 KB	Output is correct
7	Correct	3 ms	592 KB	Output is correct
8	Correct	6 ms	748 KB	Output is correct
9	Correct	13 ms	1360 KB	Output is correct
10	Correct	1 ms	336 KB	Output is correct
11	Correct	8 ms	976 KB	Output is correct
12	Correct	14 ms	1316 KB	Output is correct
13	Correct	11 ms	1372 KB	Output is correct
14	Correct	12 ms	1260 KB	Output is correct
15	Incorrect	21 ms	2780 KB	Wrong Answer [2]
16	Halted	0 ms	0 KB	-

Subtask #7
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	208 KB	Output is correct
2	Correct	0 ms	208 KB	Output is correct
3	Correct	0 ms	208 KB	Output is correct
4	Correct	0 ms	208 KB	Output is correct
5	Correct	1 ms	336 KB	Output is correct
6	Correct	2 ms	336 KB	Output is correct
7	Correct	3 ms	592 KB	Output is correct
8	Correct	6 ms	748 KB	Output is correct
9	Correct	13 ms	1360 KB	Output is correct
10	Correct	1 ms	336 KB	Output is correct
11	Correct	8 ms	976 KB	Output is correct
12	Correct	14 ms	1316 KB	Output is correct
13	Correct	11 ms	1372 KB	Output is correct
14	Correct	12 ms	1260 KB	Output is correct
15	Incorrect	21 ms	2780 KB	Wrong Answer [2]
16	Halted	0 ms	0 KB	-

Subtask #8
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	208 KB	Output is correct
2	Correct	0 ms	208 KB	Output is correct
3	Correct	0 ms	208 KB	Output is correct
4	Correct	0 ms	208 KB	Output is correct
5	Correct	1 ms	336 KB	Output is correct
6	Correct	2 ms	336 KB	Output is correct
7	Correct	3 ms	592 KB	Output is correct
8	Correct	6 ms	748 KB	Output is correct
9	Correct	13 ms	1360 KB	Output is correct
10	Correct	1 ms	336 KB	Output is correct
11	Correct	8 ms	976 KB	Output is correct
12	Correct	14 ms	1316 KB	Output is correct
13	Correct	11 ms	1372 KB	Output is correct
14	Correct	12 ms	1260 KB	Output is correct
15	Incorrect	21 ms	2780 KB	Wrong Answer [2]
16	Halted	0 ms	0 KB	-

Subtask #9
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	208 KB	Output is correct
2	Correct	0 ms	208 KB	Output is correct
3	Correct	0 ms	208 KB	Output is correct
4	Correct	0 ms	208 KB	Output is correct
5	Correct	1 ms	336 KB	Output is correct
6	Correct	2 ms	336 KB	Output is correct
7	Correct	3 ms	592 KB	Output is correct
8	Correct	6 ms	748 KB	Output is correct
9	Correct	13 ms	1360 KB	Output is correct
10	Correct	1 ms	336 KB	Output is correct
11	Correct	8 ms	976 KB	Output is correct
12	Correct	14 ms	1316 KB	Output is correct
13	Correct	11 ms	1372 KB	Output is correct
14	Correct	12 ms	1260 KB	Output is correct
15	Incorrect	21 ms	2780 KB	Wrong Answer [2]
16	Halted	0 ms	0 KB	-

Submission #838872

Compilation message