#include "mushrooms.h"
#include <algorithm>
#include <bitset>
#include <cstdint>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <math.h>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
//#define int long long
#define loop(X, N) for(int X = 0; X < (N); X++)
#define all(V) V.begin(), V.end()
#define rall(V) V.rbegin(), V.rend()
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;
//int use_machine(vi x);
int count_mushrooms(int n)
{
vi a = { 0 };
vi b;
int i = 1;
for (; i < n; i++)
{
int res = use_machine({ 0, i });
if (res == 0)
a.push_back(i);
else
b.push_back(i);
if (a.size() * a.size() >= n)
break;
if (b.size() * b.size() >= n)
break;
}
i++;
int result = a.size();
if (a.size() > b.size())
{
int sq = a.size() - 1;
while (i < n)
{
vi ask;
loop(j, min(sq, n - i))
{
ask.push_back(a[j]);
ask.push_back(i++);
}
ask.push_back(a.back());
result += sq - use_machine(ask) / 2;
}
}
else
{
int sq = b.size() - 1;
while (i < n)
{
vi ask;
loop(j, min(sq, n - i))
{
ask.push_back(b[j]);
ask.push_back(i++);
}
ask.push_back(b.back());
result += use_machine(ask) / 2;
}
}
return result;
}
Compilation message
mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:49:27: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
49 | if (a.size() * a.size() >= n)
| ~~~~~~~~~~~~~~~~~~~~^~~~
mushrooms.cpp:52:27: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
52 | if (b.size() * b.size() >= n)
| ~~~~~~~~~~~~~~~~~~~~^~~~
| # |
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 |
344 KB |
Answer is not correct. |
| 7 |
Halted |
0 ms |
0 KB |
- |
