| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 828672 | Minindu206 | Counting Mushrooms (IOI20_mushrooms) | C++14 | 2 ms | 208 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)
{
	vector<int> posa, posb, pos;
	int acnt = 1, bcnt = 0, cnt, ans = 0;
	posa.push_back(0);
	for (int i = 1; i < min(200, n); i++)
	{
		int cur = use_machine({0, i});
		if (cur == 0)
		{
			if (acnt < 97)
				posa.push_back(i);
			acnt++;
		}
		else
		{
			if (bcnt < 97)
				posb.push_back(i);
			bcnt++;
			ans++;
		}
	}
	if (n <= 200)
	{
		return n - ans;
	}
	if (acnt >= bcnt)
		pos = posa;
	else
		pos = posb;
	int i = 200;
	vector<int> chk;
	while (i < n)
	{
		chk.clear();
		int cur = 0, vr = i + cnt;
		for(;i<vr && cur < pos.size();i++)
		{
			chk.push_back(i);
			chk.push_back(pos[cur]);
			cur++;
		}
		int ncur = use_machine(chk);
		if (acnt >= bcnt)
			ans += (ncur + 1) / 2;
		else
			ans += (cur - ((ncur + 1) / 2));
	}
	return n - ans;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
