Submission #250093

#	Time	Username	Problem	Language	Result	Execution time	Memory
250093		shenxy	Minerals (JOI19_minerals)	C++14	75 / 100	44 ms	2436 KiB

minerals

#include "minerals.h"
#include <algorithm>
#include <vector>
using namespace std;
vector<int> firsts, ans;
int lquery = 0;
void recurse(vector<int> &v, int l, int r, bool has = true) {
	if (l != r) {
		int m = (l + r) / 2;
		for (int i = l; i <= m; ++i) lquery = Query(firsts[i]);
		vector<int> a, b;
		for (int i: v) {
			int x = Query(i);
			if (has == (x != lquery)) a.push_back(i);
			else b.push_back(i);
			if (x != lquery) lquery = x;
		}
		recurse(a, l, m, !has);
		recurse(b, m + 1, r, has);
	} else ans.push_back(v[0]);
}
void Solve(int N) {
	vector<int> duds;
	for (int i = 1; i <= 2 * N; ++i) {
		int x = Query(i);
		if (x != lquery) firsts.push_back(i), lquery = x;
		else duds.push_back(i);
	}
	recurse(duds, 0, N - 1);
	for (int i = 0; i < N; ++i) Answer(firsts[i], ans[i]);
}

• Subtask 1: 6 / 6
• Subtask 2: 25 / 25
• Subtask 3: 9 / 9
• Subtask 4: 30 / 30
• Subtask 5: 5 / 5
• Subtask 6: 0 / 5
• Subtask 7: 0 / 5
• Subtask 8: 0 / 5
• Subtask 9: 0 / 10