Submission #767555

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
767555	2023-06-26T20:41:28 Z	adrilen	Counting Mushrooms (IOI20_mushrooms)	C++17	92.623 / 100	7 ms	452 KB

mushrooms

	#include "mushrooms.h"
	#include<bits/stdc++.h>
	using namespace std;
	using ll = long long;
	typedef pair<int, int> pii;

	vector <int> a = { 0 }, b;
	int nex = 1;

	int count_mushrooms(int n) {

		if (n == 2)
		{
			return 2 - use_machine({0, 1});
		}

		if (n == 3)
		{
			return 3 - use_machine({0, 1}) - use_machine({0, 2});
		}

		bool swapped = false;
		int e = use_machine({0, 1});
		if (e == 1) {
			b.emplace_back(1);
			e = use_machine({0, 2});
			if (e) {
				b.emplace_back(2);
				swapped = true;
				swap(a, b);
			}
			else a.emplace_back(2);
		} else {
			a.emplace_back(1);
		}

		nex = a.size() + b.size();

		int wanted = min(n, (int)77);	

		while (max(a.size(), b.size()) < (size_t)wanted && a.size() + b.size() + max(a.size(), b.size()) < (size_t)n)
		{
			e = use_machine({a[0], nex, a[1], nex + 1});
			
			switch (e)
			{
			case 0:
				a.emplace_back(nex);
				a.emplace_back(nex + 1);

				break;
			
			case 2:
				a.emplace_back(nex + 1);
				b.emplace_back(nex);
				break;
			case 1:
				a.emplace_back(nex);
				b.emplace_back(nex + 1);
				break;
			case 3:
				b.emplace_back(nex);
				b.emplace_back(nex + 1);
				break;

			default:
				assert(0);
			}
			nex += 2;
		}


		if (a.size() + b.size() == (size_t)n) 
		{
			if (swapped) return b.size();
			else return a.size();
		}

		if (b.size() > a.size()) {
			swap(a, b);
			swapped ^= 1;
		}

		int seen = 0;
		int b_count = 0;

		vector <int> v(a.size() * 2), u(b.size() * 2);

		for (size_t i = 0; i < a.size(); i++) v[i * 2] = a[i];
		for (size_t i = 0; i < b.size(); i++) u[i * 2] = b[i];


		while (nex + (int)a.size() < n)
		{
			for (size_t i = 0; i < a.size(); i++) v[i * 2 + 1] = nex++;

			e = use_machine(v);
			b_count += e / 2;

			seen += a.size() - 1;
			if (e & 1)
			{
				b.emplace_back(nex - 1);
				u.emplace_back(nex - 1);
				u.emplace_back(-1);
				if (b.size() > a.size())
				{
					swap(a, b);
					swap(u, v);
					b_count = seen - b_count;
					swapped ^=1;
				}
			} else {
				a.emplace_back(nex - 1);
				v.emplace_back(nex - 1);
				v.emplace_back(-1);
			}
		}
		
		// cout << n << " " <<  nex <<endl;


		int c = nex;
		if (n - nex != 0) {
			vector <int> j((n - nex) * 2);
			for (int i = 0; i < n - c; i++) j[i * 2] = a[i];
			for (int i = 0; i < n - c; i++) j[i * 2 + 1] = nex++;

			e = use_machine(j);
			b_count += e / 2 + (e & 1);
		}
		

		if (swapped) return b_count + b.size();
		else return n - (b_count + b.size());
		
	}

Subtask #1

92.623 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	208 KB	Output is correct
2	Correct	0 ms	208 KB	Output is correct
3	Correct	0 ms	208 KB	Output is correct
4	Correct	0 ms	208 KB	Output is correct
5	Correct	1 ms	208 KB	Output is correct
6	Correct	1 ms	208 KB	Output is correct
7	Correct	4 ms	208 KB	Output is correct
8	Correct	5 ms	336 KB	Output is correct
9	Correct	4 ms	332 KB	Output is correct
10	Correct	5 ms	320 KB	Output is correct
11	Partially correct	6 ms	332 KB	Output is partially correct
12	Correct	5 ms	336 KB	Output is correct
13	Correct	5 ms	208 KB	Output is correct
14	Correct	4 ms	208 KB	Output is correct
15	Partially correct	5 ms	324 KB	Output is partially correct
16	Partially correct	6 ms	320 KB	Output is partially correct
17	Correct	4 ms	452 KB	Output is correct
18	Correct	4 ms	328 KB	Output is correct
19	Partially correct	5 ms	332 KB	Output is partially correct
20	Correct	6 ms	316 KB	Output is correct
21	Correct	5 ms	208 KB	Output is correct
22	Partially correct	6 ms	336 KB	Output is partially correct
23	Correct	5 ms	336 KB	Output is correct
24	Correct	3 ms	308 KB	Output is correct
25	Partially correct	6 ms	208 KB	Output is partially correct
26	Partially correct	4 ms	336 KB	Output is partially correct
27	Partially correct	6 ms	336 KB	Output is partially correct
28	Partially correct	4 ms	336 KB	Output is partially correct
29	Partially correct	5 ms	208 KB	Output is partially correct
30	Partially correct	5 ms	332 KB	Output is partially correct
31	Partially correct	5 ms	336 KB	Output is partially correct
32	Partially correct	7 ms	328 KB	Output is partially correct
33	Partially correct	6 ms	336 KB	Output is partially correct
34	Partially correct	5 ms	208 KB	Output is partially correct
35	Partially correct	5 ms	336 KB	Output is partially correct
36	Partially correct	5 ms	336 KB	Output is partially correct
37	Partially correct	5 ms	336 KB	Output is partially correct
38	Partially correct	6 ms	208 KB	Output is partially correct
39	Partially correct	5 ms	320 KB	Output is partially correct
40	Partially correct	5 ms	208 KB	Output is partially correct
41	Partially correct	6 ms	304 KB	Output is partially correct
42	Partially correct	5 ms	336 KB	Output is partially correct
43	Partially correct	5 ms	312 KB	Output is partially correct
44	Partially correct	6 ms	332 KB	Output is partially correct
45	Partially correct	5 ms	336 KB	Output is partially correct
46	Partially correct	4 ms	332 KB	Output is partially correct
47	Partially correct	6 ms	332 KB	Output is partially correct
48	Partially correct	5 ms	316 KB	Output is partially correct
49	Partially correct	5 ms	328 KB	Output is partially correct
50	Partially correct	5 ms	208 KB	Output is partially correct
51	Partially correct	5 ms	332 KB	Output is partially correct
52	Partially correct	5 ms	336 KB	Output is partially correct
53	Partially correct	6 ms	324 KB	Output is partially correct
54	Partially correct	5 ms	336 KB	Output is partially correct
55	Partially correct	4 ms	340 KB	Output is partially correct
56	Partially correct	7 ms	324 KB	Output is partially correct
57	Partially correct	5 ms	328 KB	Output is partially correct
58	Partially correct	5 ms	332 KB	Output is partially correct
59	Partially correct	5 ms	336 KB	Output is partially correct
60	Partially correct	4 ms	328 KB	Output is partially correct
61	Partially correct	6 ms	340 KB	Output is partially correct
62	Correct	0 ms	208 KB	Output is correct
63	Correct	0 ms	208 KB	Output is correct
64	Correct	0 ms	208 KB	Output is correct
65	Correct	0 ms	208 KB	Output is correct
66	Correct	0 ms	208 KB	Output is correct
67	Correct	0 ms	208 KB	Output is correct
68	Correct	0 ms	208 KB	Output is correct
69	Correct	0 ms	208 KB	Output is correct
70	Correct	1 ms	208 KB	Output is correct
71	Correct	0 ms	208 KB	Output is correct
72	Correct	0 ms	208 KB	Output is correct
73	Correct	0 ms	208 KB	Output is correct
74	Correct	0 ms	208 KB	Output is correct
75	Correct	1 ms	208 KB	Output is correct
76	Correct	0 ms	208 KB	Output is correct
77	Correct	0 ms	208 KB	Output is correct
78	Correct	0 ms	208 KB	Output is correct
79	Correct	0 ms	208 KB	Output is correct
80	Correct	1 ms	208 KB	Output is correct
81	Correct	0 ms	208 KB	Output is correct
82	Correct	0 ms	208 KB	Output is correct
83	Correct	0 ms	208 KB	Output is correct
84	Correct	0 ms	208 KB	Output is correct
85	Correct	0 ms	208 KB	Output is correct
86	Correct	0 ms	208 KB	Output is correct
87	Correct	0 ms	208 KB	Output is correct
88	Correct	0 ms	208 KB	Output is correct
89	Correct	0 ms	208 KB	Output is correct
90	Correct	1 ms	208 KB	Output is correct
91	Correct	1 ms	208 KB	Output is correct