# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
835367 | BT21tata | Counting Mushrooms (IOI20_mushrooms) | C++17 | 2 ms | 436 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<bits/stdc++.h>
#define pb push_back
using namespace std;
const int BLOCK=190;
vector<int>a, b;
int count_mushrooms(int n)
{
a.pb(0);
for(int i=1; i<min(n, BLOCK); i++)
{
int cnt=use_machine({0, i});
if(cnt) b.pb(i);
else a.pb(i);
}
if(a.size()>b.size())
{
int ansb=b.size();
for(int i=BLOCK; i<n; i+=BLOCK)
{
vector<int>cur;
int pos=0;
for(int j=i; j<min(n, (int)(i+a.size()-1)); j++)
{
cur.pb(a[pos++]);
cur.pb(j);
}
cur.pb(a[pos]);
int ret=use_machine(cur);
ansb+=(ret/2);
}
return n-ansb;
}
else
{
int ansa=a.size();
for(int i=BLOCK; i<n; i+=BLOCK)
{
vector<int>cur;
int pos=0;
for(int j=i; j<min(n, (int)(i+b.size()-1)); j++)
{
cur.pb(b[pos++]);
cur.pb(j);
}
cur.pb(b[pos]);
int ret=use_machine(cur);
ansa+=(ret/2);
}
return ansa;
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |