Submission #882313

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
882313	2023-12-03T03:48:11 Z	pirhosig	Counting Mushrooms (IOI20_mushrooms)	C++17	100 / 100	6 ms	716 KB

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.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	1 ms	344 KB	Output is correct
6	Correct	1 ms	604 KB	Output is correct
7	Correct	4 ms	448 KB	Output is correct
8	Correct	4 ms	452 KB	Output is correct
9	Correct	4 ms	456 KB	Output is correct
10	Correct	4 ms	440 KB	Output is correct
11	Correct	4 ms	460 KB	Output is correct
12	Correct	5 ms	444 KB	Output is correct
13	Correct	4 ms	608 KB	Output is correct
14	Correct	2 ms	456 KB	Output is correct
15	Correct	4 ms	460 KB	Output is correct
16	Correct	4 ms	460 KB	Output is correct
17	Correct	2 ms	436 KB	Output is correct
18	Correct	4 ms	452 KB	Output is correct
19	Correct	5 ms	460 KB	Output is correct
20	Correct	4 ms	444 KB	Output is correct
21	Correct	4 ms	448 KB	Output is correct
22	Correct	4 ms	460 KB	Output is correct
23	Correct	5 ms	448 KB	Output is correct
24	Correct	3 ms	704 KB	Output is correct
25	Correct	5 ms	464 KB	Output is correct
26	Correct	5 ms	460 KB	Output is correct
27	Correct	4 ms	460 KB	Output is correct
28	Correct	4 ms	716 KB	Output is correct
29	Correct	4 ms	460 KB	Output is correct
30	Correct	4 ms	456 KB	Output is correct
31	Correct	4 ms	456 KB	Output is correct
32	Correct	5 ms	456 KB	Output is correct
33	Correct	4 ms	460 KB	Output is correct
34	Correct	5 ms	452 KB	Output is correct
35	Correct	4 ms	460 KB	Output is correct
36	Correct	4 ms	456 KB	Output is correct
37	Correct	4 ms	616 KB	Output is correct
38	Correct	4 ms	612 KB	Output is correct
39	Correct	5 ms	460 KB	Output is correct
40	Correct	4 ms	456 KB	Output is correct
41	Correct	4 ms	456 KB	Output is correct
42	Correct	4 ms	456 KB	Output is correct
43	Correct	5 ms	460 KB	Output is correct
44	Correct	5 ms	596 KB	Output is correct
45	Correct	5 ms	456 KB	Output is correct
46	Correct	5 ms	460 KB	Output is correct
47	Correct	4 ms	456 KB	Output is correct
48	Correct	4 ms	456 KB	Output is correct
49	Correct	4 ms	464 KB	Output is correct
50	Correct	4 ms	460 KB	Output is correct
51	Correct	4 ms	464 KB	Output is correct
52	Correct	4 ms	456 KB	Output is correct
53	Correct	4 ms	460 KB	Output is correct
54	Correct	5 ms	460 KB	Output is correct
55	Correct	5 ms	460 KB	Output is correct
56	Correct	6 ms	456 KB	Output is correct
57	Correct	4 ms	704 KB	Output is correct
58	Correct	4 ms	460 KB	Output is correct
59	Correct	5 ms	456 KB	Output is correct
60	Correct	4 ms	464 KB	Output is correct
61	Correct	4 ms	452 KB	Output is correct
62	Correct	0 ms	344 KB	Output is correct
63	Correct	0 ms	344 KB	Output is correct
64	Correct	0 ms	344 KB	Output is correct
65	Correct	0 ms	344 KB	Output is correct
66	Correct	0 ms	344 KB	Output is correct
67	Correct	0 ms	344 KB	Output is correct
68	Correct	0 ms	344 KB	Output is correct
69	Correct	0 ms	344 KB	Output is correct
70	Correct	0 ms	344 KB	Output is correct
71	Correct	0 ms	344 KB	Output is correct
72	Correct	0 ms	344 KB	Output is correct
73	Correct	0 ms	344 KB	Output is correct
74	Correct	0 ms	344 KB	Output is correct
75	Correct	0 ms	344 KB	Output is correct
76	Correct	0 ms	340 KB	Output is correct
77	Correct	0 ms	344 KB	Output is correct
78	Correct	0 ms	344 KB	Output is correct
79	Correct	0 ms	344 KB	Output is correct
80	Correct	1 ms	344 KB	Output is correct
81	Correct	0 ms	344 KB	Output is correct
82	Correct	0 ms	344 KB	Output is correct
83	Correct	0 ms	344 KB	Output is correct
84	Correct	0 ms	344 KB	Output is correct
85	Correct	1 ms	344 KB	Output is correct
86	Correct	0 ms	344 KB	Output is correct
87	Correct	0 ms	344 KB	Output is correct
88	Correct	0 ms	344 KB	Output is correct
89	Correct	0 ms	344 KB	Output is correct
90	Correct	0 ms	344 KB	Output is correct
91	Correct	0 ms	344 KB	Output is correct