Submission #1035904

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1035904	2024-07-26T18:17:51 Z	Mr_Husanboy	Counting Mushrooms (IOI20_mushrooms)	C++17	90.4 / 100	6 ms	600 KB

mushrooms

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

using namespace std;

#define ll long long
#define all(a) (a).begin(), (a).end()
#define ff first
#define ss second

template<typename T>
int len(T &a){return a.size();}

mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());


int count_mushrooms(int n) {
	if(n < 226){
		int ans = 1;
		for(int i = 1; i < n; i ++){
			ans += use_machine({0, i}) ^ 1;
		}
		return ans;
	}

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

	int i = 1;
	while(len(a) < 2 && len(b) < 2){
		if(use_machine({0, i})){
			b.push_back(i);
		}else{
			a.push_back(i);
		}
		i ++;
	}
	int sq = 90;
	while(len(a) < sq && len(b) < sq && i < n){
		if(len(a) >= 2){
			int cnt = use_machine({a[0], i, a[1], i + 1});
			if(cnt == 0){
				a.push_back(i);
				a.push_back(i + 1);
			}
			if(cnt == 1){
				a.push_back(i);
				b.push_back(i + 1);
			}
			if(cnt == 2){
				b.push_back(i);
				a.push_back(i + 1);
			}
			if(cnt == 3){
				b.push_back(i);
				b.push_back(i + 1);
			}
			i += 2;
		}else{
			int cnt = use_machine({b[0], i, b[1], i + 1});
			if(cnt == 3){
				a.push_back(i);
				a.push_back(i + 1);
			}
			if(cnt == 2){
				a.push_back(i);
				b.push_back(i + 1);
			}
			if(cnt == 1){
				b.push_back(i);
				a.push_back(i + 1);
			}
			if(cnt == 0){
				b.push_back(i);
				b.push_back(i + 1);
			}
			i += 2;
		}
	}
	if(len(a) >= len(b)){
		ll ans = len(a);
		while(i < n){
		vector<int> req;
			for(int j = 0; j < len(a) && i < n; j ++){
				req.push_back(a[j]);
				req.push_back(i);
				i ++;
			}
			int cnt = use_machine(req);
			ans += len(req) / 2 - (cnt + 1) / 2;
			if(cnt & 1){
				b.push_back(req.back());
			}else a.push_back(req.back());
		}
		return ans;
	}else{
		ll ans = len(a);
		while(i < n){
		vector<int> req;
			for(int j = 0; j < len(b) && i < n; j ++){
				req.push_back(b[j]);
				req.push_back(i);
				i ++;
			}

			int cnt = use_machine(req);
			ans += (cnt + 1) / 2;
			if(cnt & 1){
				a.push_back(req.back());
			}else b.push_back(req.back());
		}
		return ans;
	}
}

Subtask #1

90.4 / 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	344 KB	Output is correct
5	Correct	1 ms	344 KB	Output is correct
6	Correct	1 ms	392 KB	Output is correct
7	Correct	3 ms	344 KB	Output is correct
8	Correct	3 ms	344 KB	Output is correct
9	Correct	3 ms	344 KB	Output is correct
10	Correct	3 ms	596 KB	Output is correct
11	Partially correct	3 ms	456 KB	Output is partially correct
12	Correct	3 ms	344 KB	Output is correct
13	Correct	4 ms	344 KB	Output is correct
14	Correct	2 ms	344 KB	Output is correct
15	Partially correct	3 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	3 ms	344 KB	Output is partially correct
20	Correct	3 ms	460 KB	Output is correct
21	Correct	3 ms	344 KB	Output is correct
22	Partially correct	3 ms	440 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	4 ms	344 KB	Output is partially correct
27	Partially correct	3 ms	456 KB	Output is partially correct
28	Partially correct	5 ms	344 KB	Output is partially correct
29	Partially correct	4 ms	456 KB	Output is partially correct
30	Partially correct	5 ms	456 KB	Output is partially correct
31	Partially correct	3 ms	344 KB	Output is partially correct
32	Partially correct	3 ms	344 KB	Output is partially correct
33	Partially correct	6 ms	344 KB	Output is partially correct
34	Partially correct	3 ms	344 KB	Output is partially correct
35	Partially correct	5 ms	344 KB	Output is partially correct
36	Partially correct	3 ms	344 KB	Output is partially correct
37	Partially correct	5 ms	456 KB	Output is partially correct
38	Partially correct	3 ms	344 KB	Output is partially correct
39	Partially correct	3 ms	344 KB	Output is partially correct
40	Partially correct	5 ms	600 KB	Output is partially correct
41	Partially correct	6 ms	344 KB	Output is partially correct
42	Partially correct	3 ms	344 KB	Output is partially correct
43	Partially correct	4 ms	344 KB	Output is partially correct
44	Partially correct	3 ms	600 KB	Output is partially correct
45	Partially correct	6 ms	456 KB	Output is partially correct
46	Partially correct	3 ms	344 KB	Output is partially correct
47	Partially correct	3 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	344 KB	Output is partially correct
51	Partially correct	3 ms	344 KB	Output is partially correct
52	Partially correct	3 ms	600 KB	Output is partially correct
53	Partially correct	3 ms	344 KB	Output is partially correct
54	Partially correct	3 ms	344 KB	Output is partially correct
55	Partially correct	4 ms	344 KB	Output is partially correct
56	Partially correct	3 ms	464 KB	Output is partially correct
57	Partially correct	6 ms	344 KB	Output is partially correct
58	Partially correct	3 ms	464 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	3 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	360 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	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	1 ms	344 KB	Output is correct
84	Correct	1 ms	344 KB	Output is correct
85	Correct	0 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