제출 #882313

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
882313		pirhosig	버섯 세기 (IOI20_mushrooms)	C++17	100 / 100	6 ms	716 KiB

mushrooms

#include <bits/stdc++.h>
#include "mushrooms.h"
#define  R(a) for (int i = 0; i < a; ++i)
#define RR(a) for (int j = 0; j < a; ++j)
using namespace std;



void query2(vector<int> val[2], bool type, int a, int b) {
	if (!type) {
		int qres = use_machine({val[0][0], a, val[0][1], b});
		val[(qres / 2) > 0].push_back(a);
		val[qres % 2].push_back(b);
	} else {
		int qres = use_machine({val[1][0], a, val[1][1], b});
		val[!(qres / 2)].push_back(a);
		val[!(qres % 2)].push_back(b);
	}
}



int count_mushrooms(int n)
{
	if (n < 225)
	{
		int tot = 1;
		for (int i = 1; i < n; ++i) tot += 1 - use_machine({0, i});
		return tot;
	}

	vector<int> val[2];
	val[0].push_back(0);

	R(2) val[use_machine({0, i + 1})].push_back(i + 1);
	int up = 3;

	if (n < 400) {
		if (!(n & 1)) {
			val[use_machine({0, up})].push_back(up);
			up++;
		}
		while (up < n) {
			query2(val, val[0].size() < val[1].size(), up, up + 1);
			up += 2;
		}
		return val[0].size();
	}

	R(3) {
		query2(val, val[0].size() < val[1].size(), up, up + 1);
		up += 2;
	}

	int tot = 0;
	R(38) {
		int qv[5] = {up, up + 1, up + 2, up + 3, up + 4};
		up += 5;
		if (val[0].size() > val[1].size()) {
			int qres = use_machine({val[0][0], qv[0], val[0][1], qv[1], val[0][2], qv[2], val[0][3], qv[3], val[0][4], qv[4]});
			val[qres & 1].push_back(qv[4]);
			if (qres < 2 || qres > 7) {
				bool can = qres > 7;
				val[can].push_back(qv[0]);
				val[can].push_back(qv[1]);
				val[can].push_back(qv[2]);
				val[can].push_back(qv[3]);
			} else if (qres == 4 || qres == 5) {
				if (val[1].size() < 2) {
					query2(val, false, qv[0], qv[1]);
					query2(val, false, qv[2], qv[3]);
				} else {
					int cres = use_machine({val[1][0], qv[0], val[1][1], qv[1], val[0][0], qv[2], val[0][1], qv[3]});
					val[cres < 4].push_back(qv[0]);
					val[cres == 1 || cres == 4 || cres == 5].push_back(qv[1]);
					val[cres == 3 || cres == 5 || cres == 6].push_back(qv[2]);
					val[!(cres & 1)].push_back(qv[3]);
				}
			} else if (qres == 2 || qres == 3) {
				if (val[1].size() < 2) {
					query2(val, false, qv[0], qv[1]);
					query2(val, false, qv[2], qv[3]);
				} else {
					int cres = use_machine({val[1][0], qv[0], val[1][1], qv[1], qv[2], qv[3]});
					val[cres == 1].push_back(qv[0]);
					val[cres == 3].push_back(qv[1]);
					val[cres == 5].push_back(qv[2]);
					val[cres == 4].push_back(qv[3]);
				}
			} else if (qres == 6 || qres == 7) {
				int cres = use_machine({val[0][0], qv[0], val[0][1], qv[1], qv[2], qv[3]});
				val[cres != 1].push_back(qv[0]);
				val[cres != 3].push_back(qv[1]);
				val[cres != 5].push_back(qv[2]);
				val[cres != 4].push_back(qv[3]);
			}
		} else {
			int qres = use_machine({val[1][0], qv[0], val[1][1], qv[1], val[1][2], qv[2], val[1][3], qv[3], val[1][4], qv[4]});
			val[!(qres & 1)].push_back(qv[4]);
			if (qres < 2 || qres > 7) {
				bool can = qres < 2;
				val[can].push_back(qv[0]);
				val[can].push_back(qv[1]);
				val[can].push_back(qv[2]);
				val[can].push_back(qv[3]);
			} else if (qres == 4 || qres == 5) {
				if (val[0].size() < 2) {
					query2(val, false, qv[0], qv[1]);
					query2(val, false, qv[2], qv[3]);
				} else {
					int cres = use_machine({val[0][0], qv[0], val[0][1], qv[1], val[1][0], qv[2], val[1][1], qv[3]});
					val[!(cres < 4)].push_back(qv[0]);
					val[!(cres == 1 || cres == 4 || cres == 5)].push_back(qv[1]);
					val[!(cres == 3 || cres == 5 || cres == 6)].push_back(qv[2]);
					val[cres & 1].push_back(qv[3]);
				}
			} else if (qres == 2 || qres == 3) {
				if (val[1].size() < 2) {
					query2(val, false, qv[0], qv[1]);
					query2(val, false, qv[2], qv[3]);
				} else {
					int cres = use_machine({val[0][0], qv[0], val[0][1], qv[1], qv[2], qv[3]});
					val[cres != 1].push_back(qv[0]);
					val[cres != 3].push_back(qv[1]);
					val[cres != 5].push_back(qv[2]);
					val[cres != 4].push_back(qv[3]);
				}
			} else if (qres == 6 || qres == 7) {
				int cres = use_machine({val[1][0], qv[0], val[1][1], qv[1], qv[2], qv[3]});
				val[cres == 1].push_back(qv[0]);
				val[cres == 3].push_back(qv[1]);
				val[cres == 5].push_back(qv[2]);
				val[cres == 4].push_back(qv[3]);
			}
		}
	}

	while (up < n) {
		int rem = n - up;
		int s1 = val[0].size();
		int s2 = val[1].size();
		vector<int> query;
		if (s1 > s2) {
			int qs = min(rem, s1);
			R(qs) {
				query.push_back(val[0][i]);
				query.push_back(up++);
			}
			int qres = use_machine(query);
			val[qres % 2].push_back(up - 1);
			tot += qs - 1 - (qres / 2);
		}
		else {
			int qs = min(rem, s2);
			R(qs) {
				query.push_back(val[1][i]);
				query.push_back(up++);
			}
			int qres = use_machine(query);
			val[!(qres % 2)].push_back(up - 1);
			tot += qres / 2;
		}
	}

	return tot + val[0].size();
}

• Subtask 1: 100 / 100