Submission #399165

#	Time	Username	Problem	Language	Result	Execution time	Memory
399165		Antekb	버섯 세기 (IOI20_mushrooms)	C++14	0 / 100	2 ms	304 KiB

mushrooms

#include "mushrooms.h"
#include<bits/stdc++.h>
#define st first
#define nd second
#define pb(x) push_back(x)
using namespace std;
int count_mushrooms(int n) {
	vector<int> A, B, C(n-1);
	A.pb(0);
	iota(C.begin(), C.end(), 1);
	int k=81;
	for(int i=0; i<2 && C.size(); i++){
		int c1 = use_machine({0, C.back()});
		if(c1==1)B.pb(C.back());
		else A.pb(C.back());
		C.pop_back();
	}
	bool swa=0;
	if(A.size()<B.size()){
		swap(A, B);
		swa=1;
	}
	for(int i=0; i<k && C.size()>1; i++){
		int c1 = use_machine({A[0], C.back(), A[1], C[C.size()-2]});
		if(c1>=2)B.pb(C.back());
		else A.pb(C.back());
		C.pop_back();
		if(c1&1)B.pb(C.back());
		else A.pb(C.back());
		C.pop_back();
	}
	int a=A.size(), b=B.size();
	while(C.size()){
		if(A.size()<B.size()){
			swap(A, B);
			swap(a, b);
			swa^=1;
		}
		int t=min(A.size(), C.size());
		vector<int> V;
		for(int i=0; i<t; i++){
			V.pb(A[i]);
			V.pb(C.back());
			C.pop_back();
		}
		int c=use_machine(V);
		b+=(c+1)/2;
		a+=t-(c+1)/2;
		if(c&1)A.pb(V.back());
		else B.pb(V.back());
	}
	if(swa)swap(a, b);
	return a;
}

• Subtask 1: 0 / 100