Submission #1019310

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1019310	2024-07-10T17:12:05 Z	j_vdd16	Counting Mushrooms (IOI20_mushrooms)	C++17	84.0149 / 100	5 ms	604 KB

mushrooms

#include "mushrooms.h"

#include <algorithm>
#include <bitset>
#include <cstdint>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <math.h>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>

//#define int long long
#define loop(X, N) for(int X = 0; X < (N); X++)
#define all(V) V.begin(), V.end()
#define rall(V) V.rbegin(), V.rend()

using namespace std;

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;

//int use_machine(vi x);

int count_mushrooms(int n)
{
	if (n < 10) {
		int As = 1;
		for (int i = 1; i < n; i++) {
			if (!use_machine({ 0, i })) As++;
		}
		return As;
	}

	vi a = { 0 };
	vi b;

	int i = 1;
	if (use_machine({ 0, 1 }) == 1)
	{
		b.push_back(1); 
		if (use_machine({ 0, 2 }))
			b.push_back(2);
		else
			a.push_back(2);

		i += 2;
	}
	else
	{
		a.push_back(1);
		i++;
	}

	int result = a.size();
	while (i < n)
	{
		if (a.size() > b.size())
		{
			int sq = a.size();
			
			vi ask;
			int asked;
			if (i <= 164 && i + 1 < n)
			{
				asked = 2;
			}
			else if (i <= 300 && i + 2 < n && a.size() >= 3)
			{
				asked = 3;
			}
			else
			{
				asked = min(sq, n - i);
			}

			loop(j, asked)
			{
				ask.push_back(a[j]);
				ask.push_back(i++);
			}

			int res = use_machine(ask);
			result += asked - res / 2 - res % 2;
			if (res % 2)
				b.push_back(i - 1);
			else
				a.push_back(i - 1);

			int others = (res - res % 2) / 2;
			if (others == asked - 1)
			{
				loop(j, asked - 1)
					b.push_back(i - 2 - j);
			}
			else if (others == 0)
			{
				loop(j, asked - 1)
					a.push_back(i - 2 - j);
			}
		}
		else
		{
			int sq = b.size();

			vi ask;
			int asked;

			if (i <= 164 && i + 1 < n)
			{
				asked = 2;
			}
			else if (i <= 300 && i + 2 < n && b.size() >= 3)
			{
				asked = 3;
			}
			else
			{
				asked = min(sq, n - i);
			}

			loop(j, asked)
			{
				ask.push_back(b[j]);
				ask.push_back(i++);
			}

			int res = use_machine(ask);
			result += res / 2 + res % 2;
			if (res % 2)
				a.push_back(i - 1);
			else
				b.push_back(i - 1);

			int others = (res - res % 2) / 2;
			if (others == asked - 1)
			{
				loop(j, asked - 1)
					a.push_back(i - 2 - j);
			}
			else if (others == 0)
			{
				loop(j, asked - 1)
					b.push_back(i - 2 - j);
			}
		}
	}

	return result;
}

Subtask #1

84.0149 / 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	344 KB	Output is correct
7	Correct	5 ms	576 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	344 KB	Output is correct
11	Partially correct	3 ms	344 KB	Output is partially correct
12	Correct	5 ms	344 KB	Output is correct
13	Correct	3 ms	600 KB	Output is correct
14	Correct	2 ms	344 KB	Output is correct
15	Partially correct	5 ms	344 KB	Output is partially correct
16	Partially correct	5 ms	344 KB	Output is partially correct
17	Correct	3 ms	344 KB	Output is correct
18	Correct	3 ms	448 KB	Output is correct
19	Partially correct	3 ms	344 KB	Output is partially correct
20	Correct	3 ms	344 KB	Output is correct
21	Partially correct	3 ms	600 KB	Output is partially correct
22	Partially correct	4 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	3 ms	344 KB	Output is partially correct
29	Partially correct	3 ms	344 KB	Output is partially correct
30	Partially correct	4 ms	344 KB	Output is partially correct
31	Partially correct	4 ms	344 KB	Output is partially correct
32	Partially correct	3 ms	344 KB	Output is partially correct
33	Partially correct	4 ms	344 KB	Output is partially correct
34	Partially correct	4 ms	344 KB	Output is partially correct
35	Partially correct	4 ms	344 KB	Output is partially correct
36	Partially correct	4 ms	344 KB	Output is partially correct
37	Partially correct	4 ms	448 KB	Output is partially correct
38	Partially correct	4 ms	344 KB	Output is partially correct
39	Partially correct	5 ms	456 KB	Output is partially correct
40	Partially correct	5 ms	600 KB	Output is partially correct
41	Partially correct	3 ms	344 KB	Output is partially correct
42	Partially correct	3 ms	440 KB	Output is partially correct
43	Partially correct	5 ms	344 KB	Output is partially correct
44	Partially correct	3 ms	344 KB	Output is partially correct
45	Partially correct	5 ms	344 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	5 ms	448 KB	Output is partially correct
51	Partially correct	5 ms	604 KB	Output is partially correct
52	Partially correct	3 ms	344 KB	Output is partially correct
53	Partially correct	3 ms	344 KB	Output is partially correct
54	Partially correct	3 ms	464 KB	Output is partially correct
55	Partially correct	5 ms	344 KB	Output is partially correct
56	Partially correct	3 ms	452 KB	Output is partially correct
57	Partially correct	3 ms	344 KB	Output is partially correct
58	Partially correct	4 ms	444 KB	Output is partially correct
59	Partially correct	3 ms	344 KB	Output is partially correct
60	Partially correct	3 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	344 KB	Output is correct
68	Correct	0 ms	344 KB	Output is correct
69	Correct	0 ms	356 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	1 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	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