oj.uz

Submission #760069

# Submission time Handle Problem Language Result Execution time Memory
760069 2023-06-17T07:12:48 Z aryan12 Counting Mushrooms (IOI20_mushrooms) C++17
92.623 / 100
 8 ms 352 KB 
#include "mushrooms.h"
#include <bits/stdc++.h>
using namespace std;

int count_mushrooms(int n)
{
	vector<int> a_type, b_type;
	a_type.push_back(0);
	int current_mushroom = 1;
	int answer = 0;
	const int brute_force = 80;
	while(current_mushroom < n)
	{
		if(max((int)a_type.size(), (int)b_type.size()) <= brute_force
			and max((int)a_type.size(), (int)b_type.size()) >= 2
			and current_mushroom != n - 1)
		{
			vector<int> query;
			if((int)a_type.size() >= 2)
			{
				query.push_back(a_type[0]);
				query.push_back(current_mushroom);
				query.push_back(a_type[1]);
				query.push_back(current_mushroom + 1);
				int response = use_machine(query);
				if(response >= 2)
				{
					b_type.push_back(current_mushroom);
				}
				else
				{
					a_type.push_back(current_mushroom);
				}
				if(response & 1)
				{
					b_type.push_back(current_mushroom + 1);
				}
				else
				{
					a_type.push_back(current_mushroom + 1);
				}
				current_mushroom += 2;
			}
			else if((int)b_type.size() >= 2)
			{
				query.push_back(b_type[0]);
				query.push_back(current_mushroom);
				query.push_back(b_type[1]);
				query.push_back(current_mushroom + 1);
				int response = use_machine(query);
				if(response >= 2)
				{
					a_type.push_back(current_mushroom);
				}
				else
				{
					b_type.push_back(current_mushroom);
				}
				if(response & 1)
				{
					a_type.push_back(current_mushroom + 1);
				}
				else
				{
					b_type.push_back(current_mushroom + 1);
				}
				current_mushroom += 2;
			}
			else
			{
				assert(false);
			}
			continue;
		}
		if(a_type.size() > b_type.size())
		{
			// use a_type.size()
			int cnt = min((int)a_type.size(), n - 1 - current_mushroom + 1);
			vector<int> query;
			for(int i = 0; i < cnt; i++)
			{
				query.push_back(a_type[i]);
				query.push_back(current_mushroom + i);
			}
			int response = use_machine(query);
			int last_one = current_mushroom + cnt - 1;
			if(response & 1) // last one is b_type
			{
				b_type.push_back(last_one);
				response -= 1;
			}
			else
			{
				a_type.push_back(last_one);
			}
			int total = query.size() - 2;
			answer += (total - response) / 2;
			current_mushroom += cnt;
		}
		else
		{
			int cnt = min((int)b_type.size(), n - 1 - current_mushroom + 1);
			vector<int> query;
			for(int i = 0; i < cnt; i++)
			{
				query.push_back(b_type[i]);
				query.push_back(current_mushroom + i);
			}
			int response = use_machine(query);
			int last_one = current_mushroom + cnt - 1;
			if(response & 1)
			{
				a_type.push_back(last_one);
				response -= 1;
			}
			else
			{
				b_type.push_back(last_one);
			}
			answer += response / 2;
			current_mushroom += cnt;
		}
	}
	return answer + (int)a_type.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 1 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 308 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 6 ms 308 KB Output is correct
8 Correct 6 ms 208 KB Output is correct
9 Correct 4 ms 336 KB Output is correct
10 Correct 5 ms 332 KB Output is correct
11 Partially correct 5 ms 328 KB Output is partially correct
12 Correct 6 ms 328 KB Output is correct
13 Correct 5 ms 208 KB Output is correct
14 Correct 3 ms 208 KB Output is correct
15 Partially correct 4 ms 208 KB Output is partially correct
16 Partially correct 5 ms 308 KB Output is partially correct
17 Correct 3 ms 320 KB Output is correct
18 Correct 6 ms 304 KB Output is correct
19 Partially correct 5 ms 332 KB Output is partially correct
20 Correct 7 ms 316 KB Output is correct
21 Correct 6 ms 324 KB Output is correct
22 Partially correct 5 ms 324 KB Output is partially correct
23 Correct 6 ms 208 KB Output is correct
24 Correct 3 ms 328 KB Output is correct
25 Partially correct 8 ms 336 KB Output is partially correct
26 Partially correct 4 ms 332 KB Output is partially correct
27 Correct 6 ms 336 KB Output is correct
28 Partially correct 5 ms 320 KB Output is partially correct
29 Partially correct 5 ms 208 KB Output is partially correct
30 Partially correct 6 ms 336 KB Output is partially correct
31 Partially correct 7 ms 208 KB Output is partially correct
32 Partially correct 5 ms 208 KB Output is partially correct
33 Partially correct 7 ms 332 KB Output is partially correct
34 Partially correct 7 ms 328 KB Output is partially correct
35 Partially correct 6 ms 308 KB Output is partially correct
36 Partially correct 6 ms 324 KB Output is partially correct
37 Partially correct 5 ms 316 KB Output is partially correct
38 Partially correct 4 ms 328 KB Output is partially correct
39 Partially correct 5 ms 208 KB Output is partially correct
40 Partially correct 5 ms 208 KB Output is partially correct
41 Partially correct 7 ms 316 KB Output is partially correct
42 Partially correct 5 ms 208 KB Output is partially correct
43 Partially correct 6 ms 312 KB Output is partially correct
44 Partially correct 5 ms 208 KB Output is partially correct
45 Partially correct 6 ms 328 KB Output is partially correct
46 Partially correct 4 ms 336 KB Output is partially correct
47 Partially correct 6 ms 208 KB Output is partially correct
48 Partially correct 5 ms 328 KB Output is partially correct
49 Partially correct 5 ms 336 KB Output is partially correct
50 Partially correct 4 ms 308 KB Output is partially correct
51 Partially correct 5 ms 328 KB Output is partially correct
52 Partially correct 6 ms 316 KB Output is partially correct
53 Partially correct 4 ms 208 KB Output is partially correct
54 Partially correct 5 ms 352 KB Output is partially correct
55 Partially correct 7 ms 208 KB Output is partially correct
56 Partially correct 6 ms 320 KB Output is partially correct
57 Partially correct 7 ms 316 KB Output is partially correct
58 Partially correct 4 ms 208 KB Output is partially correct
59 Partially correct 5 ms 208 KB Output is partially correct
60 Partially correct 4 ms 208 KB Output is partially correct
61 Partially correct 5 ms 312 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 0 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 1 ms 208 KB Output is correct
74 Correct 1 ms 208 KB Output is correct
75 Correct 0 ms 208 KB Output is correct
76 Correct 1 ms 208 KB Output is correct
77 Correct 0 ms 208 KB Output is correct
78 Correct 1 ms 208 KB Output is correct
79 Correct 0 ms 208 KB Output is correct
80 Correct 0 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 1 ms 208 KB Output is correct
89 Correct 0 ms 208 KB Output is correct
90 Correct 0 ms 208 KB Output is correct
91 Correct 0 ms 208 KB Output is correct