Submission #306726

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
306726	2020-09-26T07:58:29 Z	faustaadp	Counting Mushrooms (IOI20_mushrooms)	C++17	92.2449 / 100	10 ms	416 KB

mushrooms

#include "mushrooms.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
const ll NN = 2e4;
ll has = 1;
vector<ll> A, B;
int count_mushrooms(int n) {
	A.pb(0);
	ll k1 = min(n, 3);
	ll k2 = min(n, 160);
	for(ll i = 1; i < k1; i++)
	{
		vector<int> tmp;
		tmp.pb(0);
		tmp.pb(i);
		ll tmp2 = use_machine(tmp);
		has += (1 - tmp2);
		if(!tmp2)
			A.pb(i);
		else
			B.pb(i);
	}
	if(A.size() > B.size())
	{
		for(ll i = k1; i < k2; i += 2)
		{
			vector<int> tmp;
			tmp.pb(A[0]);
			tmp.pb(i);
			tmp.pb(A[1]);
			if(i + 1 < k2)
				tmp.pb(i + 1);
			ll tmp2 = use_machine(tmp);
			if(tmp2 & 2)
				B.pb(i);
			else
			{
				has++;
				A.pb(i);
			}
			if(i + 1 < k2)
			{
				if(tmp2 & 1)
					B.pb(i + 1);
				else
				{
					has++;
					A.pb(i + 1);
				}
			}
		}
	}
	else
	{
		for(ll i = k1; i < k2; i += 2)
		{
			vector<int> tmp;
			tmp.pb(B[0]);
			tmp.pb(i);
			tmp.pb(B[1]);
			if(i + 1 < k2)
				tmp.pb(i + 1);
			ll tmp2 = use_machine(tmp);
			if(tmp2 & 2)
			{
				has++;
				A.pb(i);
			}
			else
				B.pb(i);
			if(i + 1 < k2)
			{
				if(tmp2 & 1)
				{
					has++;
					A.pb(i + 1);
				}
				else
					B.pb(i + 1);
			}
		}
	}
	ll sz = max((ll)A.size(), (ll)B.size());
	for(ll i = k2; i < n;)
	{
		if(A.size() > B.size())
		{		
			ll byk = 0;
			vector<int> tmp;
			for(ll j = 0; j < sz; j++)
			{
				if(i + j >= n)
					break;
				byk++;
				tmp.pb(A[j]);
				tmp.pb(i + j);
			}
			ll tmp2 = use_machine(tmp);
			if(tmp2 % 2 == 0)
				A.pb(i + sz - 1);
			else
				B.pb(i + sz - 1);
			tmp2 = tmp2 / 2 + tmp2 % 2;
			has += (byk - tmp2);
		}
		else
		{
			ll byk = 0;
			vector<int> tmp;
			for(ll j = 0; j <sz; j++)
			{
				if(i + j >= n)
					break;
				byk++;
				tmp.pb(B[j]);
				tmp.pb(i + j);
			}
			ll tmp2 = use_machine(tmp);
			if(tmp2 % 2 == 0)
				B.pb(i + sz - 1);
			else
				A.pb(i + sz - 1);
			tmp2 = tmp2 / 2 + tmp2 % 2;
			has += tmp2;
		}
		i += sz;
		sz = max((ll)A.size(), (ll)B.size());
	}
	return has;
}

Subtask #1

92.2449 / 100.0

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