#include "mushrooms.h"
#include <bits/stdc++.h>
using namespace std;
int B = 137;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int count_mushrooms(int n)
{
vector<int> v[2];
vector<int> o(n);
iota(o.begin(), o.end(), 0);
shuffle(o.begin() + 1, o.end(), rng);
v[0] = {0};
int i = 1;
while (i < n && max(v[0].size(), v[1].size()) < 2) v[use_machine({0, o[i]})].push_back(o[i]), i++;
for (; i < n && max(v[0].size(), v[1].size()) < B; i += 2)
{
if (i + 1 < n)
{
if (v[0].size() >= 2)
{
int x = use_machine({v[0][0], o[i], v[0][1], o[i + 1]});
v[x >> 1 & 1].push_back(o[i]);
v[x & 1].push_back(o[i + 1]);
}
else
{
int x = use_machine({v[1][0], o[i], v[1][1], o[i + 1]});
v[1 ^ (x >> 1 & 1)].push_back(o[i]);
v[1 ^ (x & 1)].push_back(o[i + 1]);
}
}
else v[use_machine({0, o[i]})].push_back(o[i]);
}
int res = 0;
for (int j = i; j < n;)
{
vector<int> q;
int sz = min(n, j + (int)max(v[0].size(), v[1].size())) - j, k = j;
for (; k < min(n, j + (int)max(v[0].size(), v[1].size())); k++)
{
if (v[0].size() > v[1].size())
{
q.push_back(v[0][k - j]);
q.push_back(o[k]);
}
else
{
q.push_back(v[1][k - j]);
q.push_back(o[k]);
}
}
j = k;
if (v[0].size() > v[1].size())
{
int x = use_machine(q);
res += sz - ((x + 1) / 2);
if (x & 1) v[1].push_back(o[min(n, j + (int)max(v[0].size(), v[1].size())) - 1]);
else v[0].push_back(o[min(n, j + (int)max(v[0].size(), v[1].size())) - 1]), res--;
}
else
{
int x = use_machine(q);
res += (x + 1) / 2;
if (x & 1) v[0].push_back(o[min(n, j + (int)max(v[0].size(), v[1].size())) - 1]), res--;
else v[1].push_back(o[min(n, j + (int)max(v[0].size(), v[1].size())) - 1]);
}
}
return res + v[0].size();
}
Compilation message
mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:19:48: warning: comparison of integer expressions of different signedness: 'const long unsigned int' and 'int' [-Wsign-compare]
19 | for (; i < n && max(v[0].size(), v[1].size()) < B; i += 2)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
| # |
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 |
Incorrect |
1 ms |
600 KB |
Duplicate value 1882 in the query array. |
| 7 |
Halted |
0 ms |
0 KB |
- |
