#include "mushrooms.h"
#include <vector>
using namespace std;
const int K = 100;
int count_mushrooms(int n)
{
if(n <= 453)
{
int ret = 1;
for(int i = 1; i < n; i += 2)
{
if(i == n - 1) ret += 1 - use_machine({0, i});
else ret += 2 - use_machine({i, 0, i + 1});
}
return ret;
}
else
{
int ret = 0;
vector<int> A, B, C, D, E;
A.push_back(0);
for(int i = 1; i < n; ++i) C.push_back(i);
while(A.size() < K && B.size() < K && A.size() + B.size() + D.size() < 2 * K - 1)
{
if(A.size() >= 3)
{
int x = C.back(); C.pop_back();
int y = C.back(); C.pop_back();
int z = C.back(); C.pop_back();
int t = use_machine({A[0], x, A[1], y, A[2], z});
if(t & 1) B.push_back(z);
else A.push_back(z);
if(t / 2 == 0) A.push_back(x), A.push_back(y);
else if(t / 2 == 2) B.push_back(x), B.push_back(y);
else if(B.size() >= 2)
{
int u = C.back(); C.pop_back();
int v = C.back(); C.pop_back();
t = use_machine({B[0], x, B[1], A[0], y, A[1], u, A[2], v}) - 1;
if(t & 1) B.push_back(v);
else A.push_back(v);
if(t >> 1 & 1) B.push_back(u);
else A.push_back(u);
if(t >> 2) A.push_back(x), B.push_back(y);
else B.push_back(x), A.push_back(y);
}
else
{
D.push_back(x);
E.push_back(y);
}
}
else if(B.size() >= 3)
{
int x = C.back(); C.pop_back();
int y = C.back(); C.pop_back();
int z = C.back(); C.pop_back();
int t = use_machine({B[0], x, B[1], y, B[2], z});
if(t & 1) A.push_back(z);
else B.push_back(z);
if(t / 2 == 0) B.push_back(x), B.push_back(y);
else if(t / 2 == 2) A.push_back(x), A.push_back(y);
else if(A.size() >= 2)
{
int u = C.back(); C.pop_back();
int v = C.back(); C.pop_back();
t = use_machine({A[0], x, A[1], B[0], y, B[1], u, B[2], v}) - 1;
if(t & 1) A.push_back(v);
else B.push_back(v);
if(t >> 1 & 1) A.push_back(u);
else B.push_back(u);
if(t >> 2) B.push_back(x), A.push_back(y);
else A.push_back(x), B.push_back(y);
}
else
{
D.push_back(x);
E.push_back(y);
}
}
else if(A.size() >= 2)
{
int x = C.back(); C.pop_back();
int y = C.back(); C.pop_back();
int t = use_machine({A[0], x, A[1], y});
if(t & 1) B.push_back(y);
else A.push_back(y);
if(t / 2) B.push_back(x);
else A.push_back(x);
}
else if(B.size() >= 2)
{
int x = C.back(); C.pop_back();
int y = C.back(); C.pop_back();
int t = use_machine({B[0], x, B[1], y});
if(t & 1) A.push_back(y);
else B.push_back(y);
if(t / 2) A.push_back(x);
else B.push_back(x);
}
else
{
int x = C.back(); C.pop_back();
int t = use_machine({A[0], x});
if(t) B.push_back(x);
else A.push_back(x);
}
if(D.size() == 2)
{
if(A.size() >= 2)
{
int t = use_machine({A[0], D[0], A[1], D[1]});
if(t / 2) B.push_back(D[0]), A.push_back(E[0]);
else A.push_back(D[0]), B.push_back(E[0]);
if(t & 1) B.push_back(D[1]), A.push_back(E[1]);
else A.push_back(D[1]), B.push_back(E[1]);
}
else
{
int t = use_machine({B[0], D[0], B[1], D[1]});
if(t / 2) A.push_back(D[0]), B.push_back(E[0]);
else B.push_back(D[0]), A.push_back(E[0]);
if(t & 1) A.push_back(D[1]), B.push_back(E[1]);
else B.push_back(D[1]), A.push_back(E[1]);
}
D.clear(); E.clear();
}
}
if(D.size() == 1)
{
int x = C.back(); C.pop_back();
int t = use_machine({A[0], x, A[1], D[0]});
if(t & 1) B.push_back(D[0]), A.push_back(E[0]);
else A.push_back(D[0]), B.push_back(E[0]);
if(t / 2) B.push_back(x);
else A.push_back(x);
}
while(C.size())
{
if(A.size() >= B.size())
{
int cnt = -1;
vector<int> tmp;
for(int i = 0; (int)C.size() && i < (int)A.size(); ++i)
{
++cnt;
tmp.push_back(A[i]);
tmp.push_back(C.back());
C.pop_back();
}
int t = use_machine(tmp);
if(t & 1) --t, B.push_back(tmp.back());
else A.push_back(tmp.back());
ret += cnt - t / 2;
}
else
{
int cnt = -1;
vector<int> tmp;
for(int i = 0; (int)C.size() && i < (int)B.size(); ++i)
{
++cnt;
tmp.push_back(B[i]);
tmp.push_back(C.back());
C.pop_back();
}
int t = use_machine(tmp);
if(t & 1) --t, A.push_back(tmp.back());
else B.push_back(tmp.back());
ret += t / 2;
}
}
return ret + A.size();
}
}
| # |
결과 |
실행 시간 |
메모리 |
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 |
256 KB |
Output is correct |
| 7 |
Correct |
9 ms |
512 KB |
Output is correct |
| 8 |
Correct |
6 ms |
488 KB |
Output is correct |
| 9 |
Correct |
6 ms |
512 KB |
Output is correct |
| 10 |
Correct |
8 ms |
512 KB |
Output is correct |
| 11 |
Correct |
8 ms |
480 KB |
Output is correct |
| 12 |
Correct |
7 ms |
512 KB |
Output is correct |
| 13 |
Correct |
8 ms |
512 KB |
Output is correct |
| 14 |
Correct |
5 ms |
384 KB |
Output is correct |
| 15 |
Correct |
9 ms |
512 KB |
Output is correct |
| 16 |
Correct |
6 ms |
512 KB |
Output is correct |
| 17 |
Correct |
6 ms |
464 KB |
Output is correct |
| 18 |
Correct |
8 ms |
512 KB |
Output is correct |
| 19 |
Correct |
10 ms |
512 KB |
Output is correct |
| 20 |
Correct |
7 ms |
512 KB |
Output is correct |
| 21 |
Correct |
9 ms |
512 KB |
Output is correct |
| 22 |
Correct |
8 ms |
512 KB |
Output is correct |
| 23 |
Correct |
10 ms |
512 KB |
Output is correct |
| 24 |
Correct |
5 ms |
384 KB |
Output is correct |
| 25 |
Correct |
7 ms |
512 KB |
Output is correct |
| 26 |
Correct |
9 ms |
512 KB |
Output is correct |
| 27 |
Correct |
7 ms |
512 KB |
Output is correct |
| 28 |
Correct |
7 ms |
512 KB |
Output is correct |
| 29 |
Correct |
11 ms |
512 KB |
Output is correct |
| 30 |
Correct |
8 ms |
512 KB |
Output is correct |
| 31 |
Correct |
8 ms |
512 KB |
Output is correct |
| 32 |
Correct |
7 ms |
512 KB |
Output is correct |
| 33 |
Correct |
9 ms |
512 KB |
Output is correct |
| 34 |
Correct |
8 ms |
512 KB |
Output is correct |
| 35 |
Correct |
10 ms |
512 KB |
Output is correct |
| 36 |
Correct |
7 ms |
512 KB |
Output is correct |
| 37 |
Correct |
7 ms |
512 KB |
Output is correct |
| 38 |
Correct |
8 ms |
544 KB |
Output is correct |
| 39 |
Correct |
10 ms |
512 KB |
Output is correct |
| 40 |
Correct |
8 ms |
512 KB |
Output is correct |
| 41 |
Correct |
9 ms |
544 KB |
Output is correct |
| 42 |
Correct |
10 ms |
512 KB |
Output is correct |
| 43 |
Correct |
8 ms |
512 KB |
Output is correct |
| 44 |
Correct |
7 ms |
512 KB |
Output is correct |
| 45 |
Correct |
8 ms |
512 KB |
Output is correct |
| 46 |
Correct |
6 ms |
512 KB |
Output is correct |
| 47 |
Correct |
8 ms |
512 KB |
Output is correct |
| 48 |
Correct |
8 ms |
512 KB |
Output is correct |
| 49 |
Correct |
10 ms |
512 KB |
Output is correct |
| 50 |
Correct |
6 ms |
512 KB |
Output is correct |
| 51 |
Correct |
7 ms |
512 KB |
Output is correct |
| 52 |
Correct |
8 ms |
512 KB |
Output is correct |
| 53 |
Correct |
7 ms |
512 KB |
Output is correct |
| 54 |
Correct |
9 ms |
512 KB |
Output is correct |
| 55 |
Correct |
7 ms |
512 KB |
Output is correct |
| 56 |
Correct |
9 ms |
512 KB |
Output is correct |
| 57 |
Correct |
9 ms |
512 KB |
Output is correct |
| 58 |
Correct |
7 ms |
576 KB |
Output is correct |
| 59 |
Correct |
7 ms |
512 KB |
Output is correct |
| 60 |
Correct |
7 ms |
512 KB |
Output is correct |
| 61 |
Correct |
8 ms |
512 KB |
Output is correct |
| 62 |
Correct |
0 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 |
0 ms |
256 KB |
Output is correct |
| 66 |
Correct |
0 ms |
256 KB |
Output is correct |
| 67 |
Correct |
1 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 |
0 ms |
256 KB |
Output is correct |
| 72 |
Correct |
0 ms |
256 KB |
Output is correct |
| 73 |
Correct |
0 ms |
256 KB |
Output is correct |
| 74 |
Correct |
1 ms |
288 KB |
Output is correct |
| 75 |
Correct |
1 ms |
256 KB |
Output is correct |
| 76 |
Correct |
1 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 |
288 KB |
Output is correct |
| 83 |
Correct |
1 ms |
384 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 |
0 ms |
256 KB |
Output is correct |
| 91 |
Correct |
0 ms |
288 KB |
Output is correct |
