Submission #263065

#	Time	Username	Problem	Language	Result	Execution time	Memory
263065		keko37	Minerals (JOI19_minerals)	C++14	80 / 100	76 ms	3468 KiB

minerals

#include<bits/stdc++.h>
#include "minerals.h"

using namespace std;

typedef vector <int> vi;

int n, prosli = 0;

bool pitaj (int x) {
	int novi = Query(x);
	bool res = (prosli != novi);
	prosli = novi;
	return res;
}

void calc (vi a, vi b, bool ta, bool tb) {
	int siz = a.size();
	if (siz == 1) {
		Answer(a[0], b[0]);
		return;
	}
	int pola = siz / 2;
	vi a1, b1, a2, b2;
	if (ta == 0) {
		for (int i = 0; i < siz; i++) {
			if (i < pola) {
				pitaj(a[i]);
				a1.push_back(a[i]);
			} else {
				a2.push_back(a[i]);
			}
		}
	} else {
		for (int i = 0; i < siz; i++) {
			if (i < pola) {
				pitaj(a[siz-1 - i]);
				a2.push_back(a[siz-1 - i]);
			} else {
				a1.push_back(a[siz-1 - i]);
			}
		}
	}
	for (int i = 0; i < siz; i++) {
		if (pitaj(b[i])) b2.push_back(b[i]); else b1.push_back(b[i]);
	}
	calc(a1, b1, 1, !tb);
	calc(a2, b2, 0, !tb);
}

void init () {
	vi a, b;
	for (int i = 1; i <= 2 * n; i++) {
		if (pitaj(i)) a.push_back(i); else b.push_back(i);
	}
	calc(a, b, 1, 1);
}

void Solve (int N) {
	n = N;
	init();
}

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