Submission #1006247

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1006247	2024-06-23T15:20:58 Z	thinknoexit	Counting Mushrooms (IOI20_mushrooms)	C++17	87.5969 / 100	6 ms	600 KB

mushrooms

#include "mushrooms.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int n;
int count_mushrooms(int N) {
	n = N;
	if (n <= 900) {
		vector<int> A, B;
		A.push_back(0);
		int p;
		for (p = 2;p < n;p += 2) {
			if (A.size() < 2 && B.size() < 2) {
				int v = use_machine({ p - 1, 0, p });
				if (v == 0) {
					A.push_back(p);
					A.push_back(p - 1);
				}
				else if (v == 2) {
					B.push_back(p);
					B.push_back(p - 1);
				}
				else {
					if (use_machine({ 0, p })) B.push_back(p), A.push_back(p - 1);
					else B.push_back(p - 1), A.push_back(p);
				}
			}
			else if (A.size() >= 2) {
				int v = use_machine({ A[0], p - 1, A[1], p });
				if (v & 1) B.push_back(p);
				else A.push_back(p);
				if (v & 2) B.push_back(p - 1);
				else A.push_back(p - 1);
			}
			else {
				int v = use_machine({ B[0], p - 1, B[1], p });
				if (!(v & 1)) B.push_back(p);
				else A.push_back(p);
				if (!(v & 2)) B.push_back(p - 1);
				else A.push_back(p - 1);
			}
		}
		p--;
		if (p == n - 1) {
			if (use_machine({ 0, p })) B.push_back(p);
			else A.push_back(p);
		}
		return (int)A.size();
	}
	int sq = 144;
	vector<int> A, B;
	A.push_back(0);
	int p;
	for (p = 2;p < n && (int)A.size() < sq && (int)B.size() < sq;p += 2) {
		if (A.size() < 2 && B.size() < 2) {
			int v = use_machine({ p - 1, 0, p });
			if (v == 0) {
				A.push_back(p);
				A.push_back(p - 1);
			}
			else if (v == 2) {
				B.push_back(p);
				B.push_back(p - 1);
			}
			else {
				if (use_machine({ 0, p })) B.push_back(p), A.push_back(p - 1);
				else B.push_back(p - 1), A.push_back(p);
			}
		}
		else if (A.size() >= 2) {
			int v = use_machine({ A[0], p - 1, A[1], p });
			if (v & 1) B.push_back(p);
			else A.push_back(p);
			if (v & 2) B.push_back(p - 1);
			else A.push_back(p - 1);
		}
		else {
			int v = use_machine({ B[0], p - 1, B[1], p });
			if (!(v & 1)) B.push_back(p);
			else A.push_back(p);
			if (!(v & 2)) B.push_back(p - 1);
			else A.push_back(p - 1);
		}
	}
	p--;
	// count A from p -> n - 1
	int ans = A.size();
	while (p < n) {
		int j;
		if (A.size() > B.size()) {
			int sz = A.size();
			vector<int> Q;
			for (j = p;j < min(n, p + sz);j++) {
				Q.push_back(j);
				Q.push_back(A[j - p]);
			}
			int v = use_machine(Q);
			int s = Q.size();
			ans += (s - v) / 2;
			if (!(v & 1)) A.push_back(p);
			else B.push_back(p);
		}
		else {
			int sz = B.size();
			vector<int> Q;
			for (j = p;j < min(n, p + sz);j++) {
				Q.push_back(j);
				Q.push_back(B[j - p]);
			}
			int v = use_machine(Q);
			ans += (v + 1) / 2;
			if (v & 1) A.push_back(p);
			else B.push_back(p);
		}
		p = j;
	}
	return ans;
}

Subtask #1

87.5969 / 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	0 ms	340 KB	Output is correct
5	Correct	1 ms	344 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	4 ms	344 KB	Output is correct
8	Correct	5 ms	344 KB	Output is correct
9	Correct	3 ms	344 KB	Output is correct
10	Correct	5 ms	344 KB	Output is correct
11	Partially correct	4 ms	344 KB	Output is partially correct
12	Correct	3 ms	344 KB	Output is correct
13	Correct	3 ms	344 KB	Output is correct
14	Correct	2 ms	344 KB	Output is correct
15	Partially correct	4 ms	600 KB	Output is partially correct
16	Partially correct	3 ms	344 KB	Output is partially correct
17	Correct	2 ms	344 KB	Output is correct
18	Correct	3 ms	344 KB	Output is correct
19	Partially correct	4 ms	344 KB	Output is partially correct
20	Correct	3 ms	344 KB	Output is correct
21	Correct	4 ms	344 KB	Output is correct
22	Partially correct	3 ms	344 KB	Output is partially correct
23	Correct	3 ms	344 KB	Output is correct
24	Correct	2 ms	344 KB	Output is correct
25	Partially correct	3 ms	344 KB	Output is partially correct
26	Partially correct	5 ms	344 KB	Output is partially correct
27	Partially correct	3 ms	344 KB	Output is partially correct
28	Partially correct	5 ms	344 KB	Output is partially correct
29	Partially correct	3 ms	344 KB	Output is partially correct
30	Partially correct	3 ms	344 KB	Output is partially correct
31	Partially correct	3 ms	444 KB	Output is partially correct
32	Partially correct	3 ms	344 KB	Output is partially correct
33	Partially correct	3 ms	344 KB	Output is partially correct
34	Partially correct	3 ms	344 KB	Output is partially correct
35	Partially correct	3 ms	344 KB	Output is partially correct
36	Partially correct	3 ms	344 KB	Output is partially correct
37	Partially correct	3 ms	344 KB	Output is partially correct
38	Partially correct	6 ms	344 KB	Output is partially correct
39	Partially correct	3 ms	344 KB	Output is partially correct
40	Partially correct	3 ms	440 KB	Output is partially correct
41	Partially correct	3 ms	448 KB	Output is partially correct
42	Partially correct	3 ms	344 KB	Output is partially correct
43	Partially correct	3 ms	344 KB	Output is partially correct
44	Partially correct	3 ms	344 KB	Output is partially correct
45	Partially correct	3 ms	344 KB	Output is partially correct
46	Partially correct	6 ms	344 KB	Output is partially correct
47	Partially correct	5 ms	344 KB	Output is partially correct
48	Partially correct	3 ms	344 KB	Output is partially correct
49	Partially correct	3 ms	344 KB	Output is partially correct
50	Partially correct	3 ms	596 KB	Output is partially correct
51	Partially correct	4 ms	344 KB	Output is partially correct
52	Partially correct	3 ms	600 KB	Output is partially correct
53	Partially correct	4 ms	344 KB	Output is partially correct
54	Partially correct	4 ms	344 KB	Output is partially correct
55	Partially correct	3 ms	344 KB	Output is partially correct
56	Partially correct	3 ms	344 KB	Output is partially correct
57	Partially correct	3 ms	444 KB	Output is partially correct
58	Partially correct	3 ms	344 KB	Output is partially correct
59	Partially correct	3 ms	344 KB	Output is partially correct
60	Partially correct	4 ms	344 KB	Output is partially correct
61	Partially correct	6 ms	344 KB	Output is partially 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	1 ms	344 KB	Output is correct
73	Correct	1 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	344 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	0 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	0 ms	596 KB	Output is correct
86	Correct	0 ms	344 KB	Output is correct
87	Correct	0 ms	404 KB	Output is correct
88	Correct	0 ms	344 KB	Output is correct
89	Correct	1 ms	344 KB	Output is correct
90	Correct	0 ms	344 KB	Output is correct
91	Correct	0 ms	344 KB	Output is correct