Submission #1052339

# Submission time Handle Problem Language Result Execution time Memory
1052339 2024-08-10T13:33:47 Z aykhn Counting Mushrooms (IOI20_mushrooms) C++17
54.067 / 100
6 ms 600 KB
#include "mushrooms.h"
#include <bits/stdc++.h>

using namespace std;

const int B = 137;

int count_mushrooms(int n) 
{
	vector<int> v[2];
	v[0] = {0};
	int i = 1;
	for (; i < n && max(v[0].size(), v[1].size()) < B + 1; i += 2) 
	{
		if (i + 1 < n)
		{
			int x = use_machine({0, i, i + 1});
			if (x == 0) v[0].push_back(i), v[0].push_back(i + 1);
			else if (x == 2) v[1].push_back(i), v[0].push_back(i + 1);
			else 
			{
				v[1].push_back(i + 1);
				if (!use_machine({0, i})) v[0].push_back(i);
				else v[1].push_back(i);
			}
		}
		else v[use_machine({0, i})].push_back(i);
	}
	int res = 0;
	for (int j = i; j < n; j += B)
	{
		vector<int> q;
		int sz = min(n, j + B) - j;
		for (int k = j; k < min(n, j + B); k++)
		{
			if (v[0].size() > v[1].size())
			{
				q.push_back(v[0][k - j]);
				q.push_back(k);
			}
			else
			{
				q.push_back(v[1][k - j]);
				q.push_back(k);
			}
		}
		if (v[0].size() > v[1].size())
		{
			q.push_back(v[0].back());
			res += sz - (use_machine(q) / 2);
		}
		else
		{
			q.push_back(v[1].back());
			res += use_machine(q) / 2;
		}
	}
	return res + v[0].size();

}
# 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 1 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 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 Partially correct 3 ms 344 KB Output is partially correct
11 Partially correct 4 ms 444 KB Output is partially correct
12 Partially correct 3 ms 344 KB Output is partially correct
13 Partially correct 3 ms 344 KB Output is partially correct
14 Partially correct 2 ms 344 KB Output is partially correct
15 Partially correct 3 ms 344 KB Output is partially correct
16 Partially correct 3 ms 344 KB Output is partially correct
17 Partially correct 2 ms 344 KB Output is partially correct
18 Partially correct 3 ms 344 KB Output is partially correct
19 Partially correct 3 ms 344 KB Output is partially correct
20 Partially correct 3 ms 344 KB Output is partially correct
21 Partially correct 3 ms 344 KB Output is partially correct
22 Partially correct 3 ms 344 KB Output is partially correct
23 Partially correct 3 ms 344 KB Output is partially correct
24 Partially correct 2 ms 344 KB Output is partially correct
25 Partially correct 3 ms 344 KB Output is partially correct
26 Partially correct 3 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 4 ms 344 KB Output is partially correct
30 Partially correct 3 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 5 ms 600 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 4 ms 444 KB Output is partially correct
37 Partially correct 5 ms 344 KB Output is partially correct
38 Partially correct 4 ms 344 KB Output is partially correct
39 Partially correct 5 ms 344 KB Output is partially correct
40 Partially correct 3 ms 344 KB Output is partially correct
41 Partially correct 3 ms 344 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 448 KB Output is partially correct
45 Partially correct 3 ms 344 KB Output is partially correct
46 Partially correct 4 ms 344 KB Output is partially correct
47 Partially correct 6 ms 344 KB Output is partially correct
48 Partially correct 4 ms 344 KB Output is partially correct
49 Partially correct 3 ms 344 KB Output is partially correct
50 Partially correct 5 ms 344 KB Output is partially correct
51 Partially correct 3 ms 344 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 4 ms 344 KB Output is partially correct
55 Partially correct 6 ms 344 KB Output is partially correct
56 Partially correct 5 ms 444 KB Output is partially correct
57 Partially correct 4 ms 344 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 3 ms 600 KB Output is partially correct
61 Partially correct 3 ms 600 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 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 0 ms 344 KB Output is correct
84 Correct 0 ms 340 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