#include "mushrooms.h"
#include <bits/stdc++.h>
using namespace std;
const int k=10;
vector <int> a,b;
int t,res,sz;
int count_mushrooms(int n){
if (n<=227){
for (int i=1;i<n;i++)
res+=1-use_machine({0,i});
return res+1;
}
a.push_back(0);
for (int i=1;i<=2;i++){
int x=use_machine({0,i});
if (x)
b.push_back(i);
else
a.push_back(i);
}
for (int j=3;j<k*2;j+=2){
if (max(a.size(),b.size())==k)
break;
if (a.size()>1){
int x=use_machine({j,a[0],j+1,a[1]});
if (x&1)
b.push_back(j);
else
a.push_back(j);
if ((x>>1)&1)
b.push_back(j+1);
else
a.push_back(j+1);
}
else if (b.size()>1){
int x=use_machine({j,b[0],j+1,b[1]});
if (x&1)
a.push_back(j);
else
b.push_back(j);
if ((x>>1)&1)
a.push_back(j+1);
else
b.push_back(j+1);
}
}
t=(a.size()!=k);
if (a.size()!=k)
swap(a,b);
res=b.size();
for (int i=a.size()+b.size();i<n;){
if (i==n-1){
res+=abs(t-use_machine({0,i}));
continue;
}
vector <int> ve;
for (int j=i;j<min(i+(int)a.size(),n);j++){
ve.push_back(j);
ve.push_back(a[j-i]);
}
int x=use_machine(ve);
res+=(x+1)/2;
if (x&1)
b.push_back(i);
else
a.push_back(i);
if (a.size()<b.size()){
res=min(i+(int)a.size(),n)-res;
swap(a,b);
t^=1;
}
i=ve[ve.size()-2]+1;
}
return (t?res:n-res);
}
| # |
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 |
440 KB |
Output is correct |
| 7 |
Incorrect |
0 ms |
344 KB |
Too small array for query. |
| 8 |
Halted |
0 ms |
0 KB |
- |
