#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=sqrt(n)+2;
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++;
}
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++;
}
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);
}
}
}
// while(rem_i<n and )
// {
// int x=use_machine({0,rem_i});
// ind[x].push_back(rem_i);
// rem_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++)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
344 KB |
Output is correct |
| 3 |
Incorrect |
0 ms |
344 KB |
Duplicate value 6 in the query array. |
| 4 |
Halted |
0 ms |
0 KB |
- |
