# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
308524 | CodePlatina | Counting Mushrooms (IOI20_mushrooms) | C++14 | 11 ms | 576 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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();
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |