#include <bits/stdc++.h>
using namespace std;
#include "mushrooms.h"
#define pb push_back
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int count_mushrooms(int n) {
if(n==2) return 1+(1-use_machine({1,0}));
vector<int> aa;
aa.pb(0);
vector<int> bb;
int lst=3;
( use_machine({0,1}) ? bb.pb(1) : aa.pb(1));
( use_machine({0,2}) ? bb.pb(1) : aa.pb(1));
int a=aa.size();int b=bb.size();
for (int i = 3; i+1 < min(n,202); i+=2)
{
if(aa.size()==100||bb.size()==100) break;
lst=min(200,i+2);
int cur;
if(aa.size()>=2){
cur=use_machine({i,aa[0],i+1,bb[1]});
if(cur==0){
a+=2;
aa.pb(i);
aa.pb(i+1);
}else if(cur==2){
a++;
b++;
aa.pb(i);
bb.pb(i+1);
}else if(cur==3){
b+=2;
bb.pb(i);
bb.pb(i+1);
}
}
else{
cur=use_machine({i,bb[0],i+1,bb[1]});
if(cur==0){
b+=2;
bb.pb(i);
bb.pb(i+1);
}else if(cur==2){
a++;
b++;
bb.pb(i);
aa.pb(i+1);
}else if(cur==3){
a+=2;
aa.pb(i);
aa.pb(i+1);
}
}
}
int ans=a;
for (int i = lst; i < n; i+=99)
{
vector<int> cur;
int k=0;
cur.pb((aa.size()>bb.size() ? aa[k++] : bb[k++]));
for (int j = 0; j < min(n-i,99); ++j)
{
cur.pb(j+i);
cur.pb((aa.size()>bb.size() ? aa[k++] : bb[k++]));
}
int cnt=use_machine(cur);
ans+=(aa.size()<=bb.size() ? cnt/2 : cur.size()-k-cnt/2);
}
return ans;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
344 KB |
Output is correct |
| 3 |
Incorrect |
0 ms |
344 KB |
Duplicate value 1 in the query array. |
| 4 |
Halted |
0 ms |
0 KB |
- |
