# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
484636 | AmirElarbi | Counting Mushrooms (IOI20_mushrooms) | C++14 | 0 ms | 0 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>
using namespace std;
int count_mushrooms(int n) {
int X = 199;
vi typ[2];
for(int i = 1; i <= min(n-1,X); i++){
typ[use_machine({0,i})].pb(i);
}
cnt = typ[0].size()+typ[1].size();
for (int i = 200; i < n; i+=200)
{
vi a;
for(int j = i; j < i+typ[0].size();j++){
a.pb(typ[0][u]);
a.pb(i);
}
int res = use_machine(a);
if(typ[0].size() == 0)
cnt += typ[0].size()-(res/2)-1;
else {
cnt += typ[0].size()-((res+1)/2);
}
a.clear();
for(int j = i+typ[0].size(); j < i+200;j++){
a.pb(j-i+typ[0].size());
a.pb(j);
}
res = use_machine(a);
if(typ[1].size() == 0)
cnt += (res/2)-1;
else {
cnt += ((res+1)/2);
}
}
return cnt;
}