Submission #1052341

#	Time	Username	Problem	Language	Result	Execution time	Memory
1052341		aykhn	Counting Mushrooms (IOI20_mushrooms)	C++17	54.07 / 100	6 ms	596 KiB

mushrooms

#include "mushrooms.h"
#include <bits/stdc++.h>

using namespace std;

const int B = 137;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int count_mushrooms(int n) 
{
	vector<int> v[2];
	vector<int> o(n);
	iota(o.begin(), o.end(), 0);
	shuffle(o.begin() + 1, o.end(), rng);
	v[0] = {0};
	int i = 1;
	for (; i < n && max(v[0].size(), v[1].size()) < B + 1; i += 2) 
	{
		if (i + 1 < n)
		{
			int x = use_machine({0, o[i], o[i + 1]});
			if (x == 0) v[0].push_back(o[i]), v[0].push_back(o[i + 1]);
			else if (x == 2) v[1].push_back(o[i]), v[0].push_back(o[i + 1]);
			else 
			{
				v[1].push_back(o[i + 1]);
				if (!use_machine({0, o[i]})) v[0].push_back(o[i]);
				else v[1].push_back(o[i]);
			}
		}
		else v[use_machine({0, o[i]})].push_back(o[i]);
	}
	int res = 0;
	for (int j = i; j < n; j += B)
	{
		vector<int> q;
		int sz = min(n, j + B) - j;
		for (int k = j; k < min(n, j + B); k++)
		{
			if (v[0].size() > v[1].size())
			{
				q.push_back(v[0][k - j]);
				q.push_back(o[k]);
			}
			else
			{
				q.push_back(v[1][k - j]);
				q.push_back(o[k]);
			}
		}
		if (v[0].size() > v[1].size())
		{
			q.push_back(v[0].back());
			res += sz - (use_machine(q) / 2);
		}
		else
		{
			q.push_back(v[1].back());
			res += use_machine(q) / 2;
		}
	}
	return res + v[0].size();

}

• Subtask 1: 54.067 / 100