Submission #1080625

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1080625	2024-08-29T11:41:35 Z	Faisal_Saqib	Counting Mushrooms (IOI20_mushrooms)	C++17	91.8699 / 100	6 ms	856 KB

mushrooms

#include "mushrooms.h"
#include <bits/stdc++.h>
using namespace std;
int count_mushrooms(int n) {
	std::vector<int> ind[2];
	ind[0].push_back(0);
	int sq=64;
	int rem_i=1;
	for(int i=1;i<n and max(ind[0].size(),ind[1].size())<sq;i++,rem_i++)
	{
		if(ind[0].size()>=2 and (i+1)<n)
		{
			int i0=i,i1=i+1;
			vector<int> query={ind[0][0],i0,ind[0][1],i1};
			int x=use_machine(query);
			if((x&1)==1)
			{
				ind[1].push_back(i1);
			}
			else
			{
				ind[0].push_back(i1);
			}
			if((x&2)==2)
			{
				ind[1].push_back(i0);
			}
			else
			{
				ind[0].push_back(i0);
			}
			i++;
			rem_i++;
		}
		else if(ind[1].size()>=2 and (i+1)<n)
		{
			int i0=i,i1=i+1;
			vector<int> query={ind[1][0],i0,ind[1][1],i1};
			int x=3-use_machine(query);
			if((x&1)==1)
			{
				ind[1].push_back(i1);
			}
			else
			{
				ind[0].push_back(i1);
			}
			if((x&2)==2)
			{
				ind[1].push_back(i0);
			}
			else
			{
				ind[0].push_back(i0);
			}
			i++;
			rem_i++;
		}
		else
		{			
			ind[0].push_back(i);
			int x=use_machine(ind[0]);
			ind[0].pop_back();
			if(x==0)
			{
				ind[0].push_back(i);
			}
			else
			{
				ind[1].push_back(i);
			}
		}
	}
	int ans=ind[0].size();
	for(int i=rem_i;i<n;)
	{
		if(ind[0].size()>=ind[1].size())
		{
			vector<int> query;
			int rem=min(n-i,(int)ind[0].size());
			for(int j=0;j<rem;j++)
			{
				query.push_back(ind[0][j]);
				query.push_back(i+j);
			}
			int x=use_machine(query);
			int ones=(x+1)/2;
			int zeros=rem-ones;
			ans+=zeros;
			if(x%2==1)
			{
				ind[1].push_back(i+rem-1);
			}
			else
			{
				ind[0].push_back(i+rem-1);
			}
			i+=rem;
		}
		else
		{
			vector<int> query;
			int rem=min(n-i,(int)ind[1].size());
			for(int j=0;j<rem;j++)
			{
				query.push_back(ind[1][j]);
				query.push_back(i+j);
			}
			int x=use_machine(query);
			int zeros=(x+1)/2;
			ans+=zeros;
			if(x%2==1)
			{
				ind[0].push_back(i+rem-1);
			}
			else
			{
				ind[1].push_back(i+rem-1);
			}
			i+=rem;
		}
	}
	return ans;
}

Compilation message

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:9:54: warning: comparison of integer expressions of different signedness: 'const long unsigned int' and 'int' [-Wsign-compare]
    9 |  for(int i=1;i<n and max(ind[0].size(),ind[1].size())<sq;i++,rem_i++)
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~

Subtask #1

91.8699 / 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	0 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	468 KB	Output is correct
9	Correct	5 ms	600 KB	Output is correct
10	Correct	3 ms	456 KB	Output is correct
11	Partially correct	6 ms	344 KB	Output is partially correct
12	Correct	3 ms	344 KB	Output is correct
13	Correct	3 ms	344 KB	Output is correct
14	Correct	3 ms	344 KB	Output is correct
15	Partially correct	3 ms	344 KB	Output is partially correct
16	Partially correct	4 ms	696 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	464 KB	Output is partially correct
20	Correct	3 ms	344 KB	Output is correct
21	Correct	4 ms	600 KB	Output is correct
22	Partially correct	4 ms	472 KB	Output is partially correct
23	Correct	4 ms	600 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	3 ms	452 KB	Output is partially correct
27	Partially correct	6 ms	344 KB	Output is partially correct
28	Partially correct	3 ms	448 KB	Output is partially correct
29	Partially correct	3 ms	344 KB	Output is partially correct
30	Partially correct	3 ms	344 KB	Output is partially correct
31	Partially correct	3 ms	344 KB	Output is partially correct
32	Partially correct	6 ms	344 KB	Output is partially correct
33	Partially correct	5 ms	344 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	3 ms	344 KB	Output is partially correct
37	Partially correct	3 ms	344 KB	Output is partially correct
38	Partially correct	6 ms	344 KB	Output is partially correct
39	Partially correct	3 ms	344 KB	Output is partially correct
40	Partially correct	4 ms	452 KB	Output is partially correct
41	Partially correct	5 ms	460 KB	Output is partially correct
42	Partially correct	4 ms	344 KB	Output is partially correct
43	Partially correct	4 ms	344 KB	Output is partially correct
44	Partially correct	3 ms	344 KB	Output is partially correct
45	Partially correct	4 ms	600 KB	Output is partially correct
46	Partially correct	3 ms	464 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	628 KB	Output is partially correct
50	Partially correct	3 ms	344 KB	Output is partially correct
51	Partially correct	3 ms	600 KB	Output is partially correct
52	Partially correct	5 ms	344 KB	Output is partially correct
53	Partially correct	4 ms	464 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	6 ms	344 KB	Output is partially correct
57	Partially correct	4 ms	856 KB	Output is partially correct
58	Partially correct	3 ms	456 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	1 ms	344 KB	Output is correct
64	Correct	1 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	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	1 ms	344 KB	Output is correct
91	Correct	0 ms	344 KB	Output is correct