제출 #355448

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
355448		tengiz05	Counting Mushrooms (IOI20_mushrooms)	C++17	0 / 100	1 ms	364 KiB

mushrooms

#include "mushrooms.h"
#ifndef EVAL
#include "stub.cpp"
#endif
#include <bits/stdc++.h>
using namespace std;
int count_mushrooms(int n) {
	int ans = 1;
	vector<int> A, B;
	A.push_back(0);
	for(int i=1;i<min(n,140);i++){
		vector<int> tmp = {0,i};
		int t = use_machine(tmp);
		if(t == 0)A.push_back(t), ans++;
		else B.push_back(t);
	}
	for(int i=min(n, 140); i < n; i++){
		if(A.size() >= B.size()){
			vector<int> tmp;
			for(int j=0;j<(int)A.size();j++){
				if(i == n)break;
				tmp.push_back(A[j]);
				tmp.push_back(i++);
			}int t = use_machine(tmp);
			if(tmp.size()%2 == 0){
				if(t%2==0){
					B.push_back(tmp.back());
					t ^= 1;
				}else ans++;
			}
			int sz = (tmp.size()-1)/2;
			ans += (sz*2-t)/2;
		}else {
			vector<int> tmp;
			for(int j=0;j<(int)B.size();j++){
				if(i == n)break;
				tmp.push_back(B[j]);
				tmp.push_back(i++);
			}int t = use_machine(tmp);
			if(tmp.size()%2 == 0){
				if(t%2==0){
					A.push_back(tmp.back());
					t ^= 1;
				}else ans++;
			}
			ans += (t)/2;
		}
		i--;
	}
	return ans;
}

• Subtask 1: 0 / 100