#include"mushrooms.h"
#ifndef EVAL
#include"stub.cpp"
#endif
#include<bits/stdc++.h>
using namespace std;
int count_mushrooms(int n){
vector<int>a,b;
a.push_back(0);
int id=1;
while(max(a.size(),b.size())<110&&id<n){
if(a.size()>=3&&b.size()>=2&&id+4<n){
int ans1=use_machine({a[0],id,a[1],id+1,a[2],id+2});
if(ans1&1)b.push_back(id+2);
else a.push_back(id+2);
ans1>>=1;
if(ans1==0){
a.push_back(id);
a.push_back(id+1);
id+=3;
}else if(ans1==2){
b.push_back(id);
b.push_back(id+1);
id+=3;
}else{
int ans2=use_machine({b[0],id,b[1],a[0],id+1,a[1],id+3,a[2],id+4})-1;
if(ans2&1)b.push_back(id+4);
else a.push_back(id+4);
ans2>>=1;
if(ans2&1)b.push_back(id+3);
else a.push_back(id+3);
ans2>>=1;
if(ans2&1){
a.push_back(id);
b.push_back(id+1);
}else{
b.push_back(id);
a.push_back(id+1);
}
id+=5;
}
}else if(b.size()>=3&&a.size()>=2&&id+4<n){
int ans1=use_machine({b[0],id,b[1],id+1,b[2],id+2});
if(ans1&1)a.push_back(id+2);
else b.push_back(id+2);
ans1>>=1;
if(ans1==0){
b.push_back(id);
b.push_back(id+1);
id+=3;
}else if(ans1==2){
a.push_back(id);
a.push_back(id+1);
id+=3;
}else{
int ans2=use_machine({a[0],id,a[1],b[0],id+1,b[1],id+3,b[2],id+4})-1;
if(ans2&1)a.push_back(id+4);
else b.push_back(id+4);
ans2>>=1;
if(ans2&1)a.push_back(id+3);
else b.push_back(id+3);
ans2>>=1;
if(ans2&1){
b.push_back(id);
a.push_back(id+1);
}else{
a.push_back(id);
b.push_back(id+1);
}
id+=5;
}
}else if(a.size()>=2&&id+1<n){
int ans=use_machine({a[0],id,a[1],id+1});
if(ans&1)b.push_back(id+1);
else a.push_back(id+1);
ans>>=1;
if(ans&1)b.push_back(id);
else a.push_back(id);
id+=2;
}else if(b.size()>=2&&id+1<n){
int ans=use_machine({b[0],id,b[1],id+1});
if(ans&1)a.push_back(id+1);
else b.push_back(id+1);
ans>>=1;
if(ans&1)a.push_back(id);
else b.push_back(id);
id+=2;
}else{
if(use_machine({0,id}))b.push_back(id);
else a.push_back(id);
id++;
}
}
int res=(int)a.size();
while(id<n){
if(a.size()>b.size()){
vector<int>v;
for(int i=0;i<a.size()&&id<n;i++){
v.push_back(a[i]);
v.push_back(id++);
}
int ans=use_machine(v);
if(ans&1)b.push_back(v.back());
else a.push_back(v.back());
ans++;
ans>>=1;
res+=(int(v.size())>>1)-ans;
}else{
vector<int>v;
for(int i=0;i<b.size()&&id<n;i++){
v.push_back(b[i]);
v.push_back(id++);
}
int ans=use_machine(v);
if(ans&1)a.push_back(v.back());
else b.push_back(v.back());
ans++;
ans>>=1;
res+=ans;
}
}
return res;
}
Compilation message
mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:98:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
98 | for(int i=0;i<a.size()&&id<n;i++){
| ~^~~~~~~~~
mushrooms.cpp:110:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
110 | for(int i=0;i<b.size()&&id<n;i++){
| ~^~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
364 KB |
Output is correct |
2 |
Correct |
1 ms |
364 KB |
Output is correct |
3 |
Correct |
1 ms |
364 KB |
Output is correct |
4 |
Correct |
1 ms |
364 KB |
Output is correct |
5 |
Correct |
1 ms |
364 KB |
Output is correct |
6 |
Correct |
2 ms |
364 KB |
Output is correct |
7 |
Correct |
8 ms |
364 KB |
Output is correct |
8 |
Correct |
8 ms |
364 KB |
Output is correct |
9 |
Correct |
7 ms |
364 KB |
Output is correct |
10 |
Correct |
8 ms |
364 KB |
Output is correct |
11 |
Correct |
8 ms |
396 KB |
Output is correct |
12 |
Correct |
10 ms |
364 KB |
Output is correct |
13 |
Correct |
7 ms |
364 KB |
Output is correct |
14 |
Correct |
5 ms |
492 KB |
Output is correct |
15 |
Correct |
6 ms |
396 KB |
Output is correct |
16 |
Correct |
7 ms |
364 KB |
Output is correct |
17 |
Correct |
4 ms |
364 KB |
Output is correct |
18 |
Correct |
7 ms |
364 KB |
Output is correct |
19 |
Correct |
6 ms |
396 KB |
Output is correct |
20 |
Correct |
7 ms |
364 KB |
Output is correct |
21 |
Correct |
8 ms |
364 KB |
Output is correct |
22 |
Correct |
7 ms |
364 KB |
Output is correct |
23 |
Correct |
7 ms |
364 KB |
Output is correct |
24 |
Correct |
5 ms |
364 KB |
Output is correct |
25 |
Correct |
7 ms |
364 KB |
Output is correct |
26 |
Correct |
8 ms |
364 KB |
Output is correct |
27 |
Correct |
7 ms |
364 KB |
Output is correct |
28 |
Correct |
8 ms |
364 KB |
Output is correct |
29 |
Correct |
7 ms |
364 KB |
Output is correct |
30 |
Correct |
8 ms |
364 KB |
Output is correct |
31 |
Correct |
8 ms |
364 KB |
Output is correct |
32 |
Correct |
8 ms |
364 KB |
Output is correct |
33 |
Correct |
8 ms |
364 KB |
Output is correct |
34 |
Correct |
9 ms |
364 KB |
Output is correct |
35 |
Correct |
9 ms |
364 KB |
Output is correct |
36 |
Correct |
6 ms |
396 KB |
Output is correct |
37 |
Correct |
7 ms |
364 KB |
Output is correct |
38 |
Correct |
7 ms |
364 KB |
Output is correct |
39 |
Correct |
7 ms |
364 KB |
Output is correct |
40 |
Correct |
7 ms |
364 KB |
Output is correct |
41 |
Correct |
7 ms |
364 KB |
Output is correct |
42 |
Correct |
7 ms |
364 KB |
Output is correct |
43 |
Correct |
7 ms |
364 KB |
Output is correct |
44 |
Correct |
8 ms |
364 KB |
Output is correct |
45 |
Correct |
9 ms |
364 KB |
Output is correct |
46 |
Correct |
7 ms |
364 KB |
Output is correct |
47 |
Correct |
9 ms |
364 KB |
Output is correct |
48 |
Correct |
9 ms |
364 KB |
Output is correct |
49 |
Correct |
8 ms |
364 KB |
Output is correct |
50 |
Correct |
8 ms |
364 KB |
Output is correct |
51 |
Correct |
9 ms |
396 KB |
Output is correct |
52 |
Correct |
7 ms |
364 KB |
Output is correct |
53 |
Correct |
9 ms |
364 KB |
Output is correct |
54 |
Correct |
9 ms |
364 KB |
Output is correct |
55 |
Correct |
9 ms |
364 KB |
Output is correct |
56 |
Correct |
8 ms |
364 KB |
Output is correct |
57 |
Correct |
9 ms |
364 KB |
Output is correct |
58 |
Correct |
8 ms |
364 KB |
Output is correct |
59 |
Correct |
7 ms |
396 KB |
Output is correct |
60 |
Correct |
8 ms |
364 KB |
Output is correct |
61 |
Correct |
10 ms |
364 KB |
Output is correct |
62 |
Correct |
1 ms |
364 KB |
Output is correct |
63 |
Correct |
1 ms |
364 KB |
Output is correct |
64 |
Correct |
1 ms |
364 KB |
Output is correct |
65 |
Correct |
1 ms |
364 KB |
Output is correct |
66 |
Correct |
0 ms |
364 KB |
Output is correct |
67 |
Correct |
0 ms |
364 KB |
Output is correct |
68 |
Correct |
1 ms |
512 KB |
Output is correct |
69 |
Correct |
0 ms |
364 KB |
Output is correct |
70 |
Correct |
1 ms |
364 KB |
Output is correct |
71 |
Correct |
1 ms |
364 KB |
Output is correct |
72 |
Correct |
1 ms |
364 KB |
Output is correct |
73 |
Correct |
1 ms |
288 KB |
Output is correct |
74 |
Correct |
1 ms |
364 KB |
Output is correct |
75 |
Correct |
1 ms |
364 KB |
Output is correct |
76 |
Correct |
1 ms |
364 KB |
Output is correct |
77 |
Correct |
1 ms |
364 KB |
Output is correct |
78 |
Correct |
1 ms |
364 KB |
Output is correct |
79 |
Correct |
1 ms |
364 KB |
Output is correct |
80 |
Correct |
1 ms |
364 KB |
Output is correct |
81 |
Correct |
1 ms |
364 KB |
Output is correct |
82 |
Correct |
0 ms |
364 KB |
Output is correct |
83 |
Correct |
1 ms |
364 KB |
Output is correct |
84 |
Correct |
1 ms |
364 KB |
Output is correct |
85 |
Correct |
1 ms |
364 KB |
Output is correct |
86 |
Correct |
1 ms |
364 KB |
Output is correct |
87 |
Correct |
1 ms |
364 KB |
Output is correct |
88 |
Correct |
0 ms |
364 KB |
Output is correct |
89 |
Correct |
1 ms |
364 KB |
Output is correct |
90 |
Correct |
1 ms |
364 KB |
Output is correct |
91 |
Correct |
0 ms |
364 KB |
Output is correct |