# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1079968 | Faisal_Saqib | Counting Mushrooms (IOI20_mushrooms) | C++17 | 73 ms | 1096 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) {
std::vector<int> ind[2];
int ans=0;
ind[0].push_back(0);
for(int i=1;i<n;i++)
{
if(ind[0].size()>=2 and (i+1)<n)
{
int i0=i,i1=i+1;
vector<int> query={ind[0][0],i0,ind[0][1],i1};
int x=use_machine(query);
if((x&1)==1)
{
ind[1].push_back(i1);
}
else
{
ind[0].push_back(i1);
}
if((x&2)==2)
{
ind[1].push_back(i0);
}
else
{
ind[0].push_back(i0);
}
i++;
}
else if(ind[1].size()>=2 and (i+1)<n)
{
int i0=i,i1=i+1;
vector<int> query={ind[1][0],i0,ind[1][1],i1};
int x=3-use_machine(query);
if((x&1)==1)
{
ind[1].push_back(i1);
}
else
{
ind[0].push_back(i1);
}
if((x&2)==2)
{
ind[1].push_back(i0);
}
else
{
ind[0].push_back(i0);
}
i++;
}
else
{
ind[0].push_back(i);
int x=use_machine(ind[0]);
ind[0].pop_back();
if(x==0)
{
ind[0].push_back(i);
}
else
{
ind[1].push_back(i);
}
}
}
return ind[0].size();
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |