#include "mushrooms.h"
#include <bits/stdc++.h>
using namespace std;
// macros
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define FOR(a,b) for(auto& a : b)
#define all(a) a.begin(), a.end()
#define INF 1e9
#define EPS 1e-9
#define pb push_back
#define popb pop_back
#define fi first
#define se second
#define sz size()
int mx=147;
int count_mushrooms(int n) {
if(n <= 227) {
int ans = 1;
REP(i,1,n) ans += 1-use_machine({0,i});
return ans;
}
int cur = 0;
vi a[2]; bool swp = 0;
a[0].pb(cur++);
// A_
while(a[0].size() < 2 && a[1].size() < 2) {
a[use_machine({a[0][0], cur})].pb(cur);
cur++;
}
if(a[1].size() > a[0].size()) swap(a[0],a[1]), swp^=1;
// A_A_
while(a[0].size() < 3 && a[1].size() < 3) {
vi m;
m.pb(a[0][0]);
m.pb(cur);
m.pb(a[0][1]);
m.pb(cur+1);
int res = use_machine(m);
a[(res&2)==2].pb(cur);
a[(res&1)==1].pb(cur+1);
cur += 2;
}
if(a[1].size() > a[0].size()) swap(a[0],a[1]), swp^=1;
// A_A_A_ => A_A_
while(a[0].size() < mx && a[1].size() < 2) {
vi m;
m.pb(a[0][0]);
m.pb(cur);
m.pb(a[0][1]);
m.pb(cur+1);
m.pb(a[0][2]);
m.pb(cur+2);
int res = use_machine(m);
a[(res&1)==1].pb(cur+2);
if(res&2) {
m.clear();
m.pb(a[0][0]);
m.pb(cur);
m.pb(a[0][1]);
m.pb(cur+1);
res = use_machine(m);
a[(res&2)==2].pb(cur);
a[(res&1)==1].pb(cur+1);
} else {
a[(res&4)==4].pb(cur );
a[(res&4)==4].pb(cur+1);
}
cur += 3;
if(a[1].size() > a[0].size()) swap(a[0],a[1]), swp^=1;
}
// A_A_A_ => B_BA_A_A_
while(a[0].size() < mx && a[1].size() < mx) {
vi m;
m.pb(a[0][0]);
m.pb(cur);
m.pb(a[0][1]);
m.pb(cur+1);
m.pb(a[0][2]);
m.pb(cur+2);
int res = use_machine(m);
a[(res&1)==1].pb(cur+2);
if(res&2) {
m.clear();
m.pb(a[1][0]);
m.pb(cur);
m.pb(a[1][1]);
m.pb(a[0][0]);
m.pb(cur+1);
m.pb(a[0][1]);
m.pb(cur+3);
m.pb(a[0][2]);
m.pb(cur+4);
res = use_machine(m)-1;
a[(res&2)==2].pb(cur+3);
a[(res&1)==1].pb(cur+4);
if(res&4) {
a[0].pb(cur);
a[1].pb(cur+1);
} else {
a[1].pb(cur);
a[0].pb(cur+1);
}
cur += 5;
} else {
a[(res&4)==4].pb(cur+1);
a[(res&4)==4].pb(cur );
cur += 3;
}
}
if(a[1].size() > a[0].size()) swap(a[0],a[1]), swp^=1;
int ans = a[0].size();
while(cur < n) {
vi m;
FOR(i,a[0]) {
m.pb(i);
m.pb(cur++);
if(cur == n) break;
}
ans += m.size()/2 - (use_machine(m)+1)/2;
}
if(swp) ans = n-ans;
return ans;
}
Compilation message
mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:65:23: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
65 | while(a[0].size() < mx && a[1].size() < 2) {
| ~~~~~~~~~~~~^~~~
mushrooms.cpp:93:23: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
93 | while(a[0].size() < mx && a[1].size() < mx) {
| ~~~~~~~~~~~~^~~~
mushrooms.cpp:93:43: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
93 | while(a[0].size() < mx && a[1].size() < mx) {
| ~~~~~~~~~~~~^~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
256 KB |
Output is correct |
| 2 |
Correct |
0 ms |
256 KB |
Output is correct |
| 3 |
Correct |
1 ms |
256 KB |
Output is correct |
| 4 |
Correct |
1 ms |
256 KB |
Output is correct |
| 5 |
Correct |
2 ms |
256 KB |
Output is correct |
| 6 |
Correct |
2 ms |
384 KB |
Output is correct |
| 7 |
Correct |
7 ms |
256 KB |
Output is correct |
| 8 |
Correct |
7 ms |
256 KB |
Output is correct |
| 9 |
Correct |
9 ms |
256 KB |
Output is correct |
| 10 |
Correct |
7 ms |
384 KB |
Output is correct |
| 11 |
Partially correct |
8 ms |
384 KB |
Output is partially correct |
| 12 |
Correct |
7 ms |
256 KB |
Output is correct |
| 13 |
Correct |
7 ms |
384 KB |
Output is correct |
| 14 |
Correct |
5 ms |
256 KB |
Output is correct |
| 15 |
Partially correct |
7 ms |
256 KB |
Output is partially correct |
| 16 |
Partially correct |
8 ms |
256 KB |
Output is partially correct |
| 17 |
Correct |
4 ms |
256 KB |
Output is correct |
| 18 |
Correct |
7 ms |
256 KB |
Output is correct |
| 19 |
Partially correct |
7 ms |
256 KB |
Output is partially correct |
| 20 |
Correct |
7 ms |
256 KB |
Output is correct |
| 21 |
Correct |
7 ms |
256 KB |
Output is correct |
| 22 |
Partially correct |
7 ms |
256 KB |
Output is partially correct |
| 23 |
Correct |
7 ms |
256 KB |
Output is correct |
| 24 |
Correct |
4 ms |
256 KB |
Output is correct |
| 25 |
Partially correct |
7 ms |
256 KB |
Output is partially correct |
| 26 |
Partially correct |
10 ms |
256 KB |
Output is partially correct |
| 27 |
Partially correct |
7 ms |
384 KB |
Output is partially correct |
| 28 |
Partially correct |
9 ms |
256 KB |
Output is partially correct |
| 29 |
Partially correct |
7 ms |
256 KB |
Output is partially correct |
| 30 |
Partially correct |
9 ms |
256 KB |
Output is partially correct |
| 31 |
Partially correct |
7 ms |
256 KB |
Output is partially correct |
| 32 |
Partially correct |
6 ms |
376 KB |
Output is partially correct |
| 33 |
Partially correct |
8 ms |
256 KB |
Output is partially correct |
| 34 |
Partially correct |
8 ms |
256 KB |
Output is partially correct |
| 35 |
Partially correct |
7 ms |
256 KB |
Output is partially correct |
| 36 |
Partially correct |
10 ms |
256 KB |
Output is partially correct |
| 37 |
Partially correct |
7 ms |
256 KB |
Output is partially correct |
| 38 |
Partially correct |
10 ms |
256 KB |
Output is partially correct |
| 39 |
Partially correct |
7 ms |
256 KB |
Output is partially correct |
| 40 |
Partially correct |
6 ms |
376 KB |
Output is partially correct |
| 41 |
Partially correct |
7 ms |
256 KB |
Output is partially correct |
| 42 |
Partially correct |
10 ms |
256 KB |
Output is partially correct |
| 43 |
Partially correct |
8 ms |
384 KB |
Output is partially correct |
| 44 |
Partially correct |
8 ms |
256 KB |
Output is partially correct |
| 45 |
Partially correct |
8 ms |
512 KB |
Output is partially correct |
| 46 |
Partially correct |
7 ms |
256 KB |
Output is partially correct |
| 47 |
Partially correct |
7 ms |
256 KB |
Output is partially correct |
| 48 |
Partially correct |
8 ms |
384 KB |
Output is partially correct |
| 49 |
Partially correct |
8 ms |
256 KB |
Output is partially correct |
| 50 |
Partially correct |
8 ms |
256 KB |
Output is partially correct |
| 51 |
Partially correct |
8 ms |
256 KB |
Output is partially correct |
| 52 |
Partially correct |
7 ms |
256 KB |
Output is partially correct |
| 53 |
Partially correct |
10 ms |
256 KB |
Output is partially correct |
| 54 |
Partially correct |
7 ms |
256 KB |
Output is partially correct |
| 55 |
Partially correct |
8 ms |
256 KB |
Output is partially correct |
| 56 |
Partially correct |
10 ms |
256 KB |
Output is partially correct |
| 57 |
Partially correct |
7 ms |
256 KB |
Output is partially correct |
| 58 |
Partially correct |
7 ms |
256 KB |
Output is partially correct |
| 59 |
Partially correct |
8 ms |
384 KB |
Output is partially correct |
| 60 |
Partially correct |
8 ms |
384 KB |
Output is partially correct |
| 61 |
Partially correct |
9 ms |
256 KB |
Output is partially correct |
| 62 |
Correct |
1 ms |
256 KB |
Output is correct |
| 63 |
Correct |
0 ms |
256 KB |
Output is correct |
| 64 |
Correct |
0 ms |
256 KB |
Output is correct |
| 65 |
Correct |
1 ms |
256 KB |
Output is correct |
| 66 |
Correct |
1 ms |
256 KB |
Output is correct |
| 67 |
Correct |
0 ms |
256 KB |
Output is correct |
| 68 |
Correct |
0 ms |
256 KB |
Output is correct |
| 69 |
Correct |
0 ms |
256 KB |
Output is correct |
| 70 |
Correct |
0 ms |
256 KB |
Output is correct |
| 71 |
Correct |
1 ms |
256 KB |
Output is correct |
| 72 |
Correct |
0 ms |
288 KB |
Output is correct |
| 73 |
Correct |
0 ms |
256 KB |
Output is correct |
| 74 |
Correct |
1 ms |
256 KB |
Output is correct |
| 75 |
Correct |
0 ms |
256 KB |
Output is correct |
| 76 |
Correct |
0 ms |
256 KB |
Output is correct |
| 77 |
Correct |
0 ms |
256 KB |
Output is correct |
| 78 |
Correct |
0 ms |
256 KB |
Output is correct |
| 79 |
Correct |
0 ms |
256 KB |
Output is correct |
| 80 |
Correct |
0 ms |
256 KB |
Output is correct |
| 81 |
Correct |
0 ms |
256 KB |
Output is correct |
| 82 |
Correct |
0 ms |
256 KB |
Output is correct |
| 83 |
Correct |
1 ms |
256 KB |
Output is correct |
| 84 |
Correct |
0 ms |
256 KB |
Output is correct |
| 85 |
Correct |
0 ms |
256 KB |
Output is correct |
| 86 |
Correct |
1 ms |
256 KB |
Output is correct |
| 87 |
Correct |
1 ms |
256 KB |
Output is correct |
| 88 |
Correct |
0 ms |
256 KB |
Output is correct |
| 89 |
Correct |
0 ms |
256 KB |
Output is correct |
| 90 |
Correct |
1 ms |
256 KB |
Output is correct |
| 91 |
Correct |
0 ms |
256 KB |
Output is correct |
