제출 #590317

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
590317		almothana05	버섯 세기 (IOI20_mushrooms)	C++14	79.58 / 100	9 ms	336 KiB

mushrooms

#include "mushrooms.h"
#include <bits/stdc++.h>
using namespace std;
vector<int>comp , a, b , cmp , erg;;
int count_mushrooms(int menge) {
	int rechner = 0 , numm , pl , nummer;
	a.push_back(0);
	for(int i = 1 ; i < min(menge , 310) ; i++){
		if(i <= 2 || i == min(menge , 310) - 1){
			comp = {0 , i};
			if(use_machine(comp) == 0){
				a.push_back(i);
			}
			else{
				b.push_back(i);
			}
		}
		else if(a.size() > 1){
			comp = {i , a[0] , i + 1, a[1]};
			nummer = use_machine(comp);
			if(nummer % 2 == 1){
				b.push_back(i);
			}
			else{
				a.push_back(i);
			}
			if(nummer > 1){
				b.push_back(i + 1);
			}
			else{
				a.push_back(i + 1);
			}
			i++;
		}
		else{
			comp = {i , b[0] , i + 1 , b[1]};
			nummer = use_machine(comp);
			if(nummer % 2 == 1){
				a.push_back(i);
			}
			else{
				b.push_back(i);
			}
			if(nummer > 1){
				a.push_back(i + 1);
			}
			else{
				b.push_back(i + 1);
			}
			i++;
		}
	}
	if(menge <= 310){
		return a.size();
	}
	if(a.size() > b.size()){
		cmp = a;
	}
	else{
		cmp = b;
	}
	// cout << cmp.size()
	for(int i = 310 ; i < menge ; i = i ){
		numm = i + cmp.size();
		pl = 0;
	// cout << i << " ja\n";
		while(i < min(menge , numm)){
			erg.push_back(i);
			erg.push_back(cmp[pl]);
			pl++;
			i++;
		}
		nummer = use_machine(erg);
		numm = 0;
		if(nummer % 2 == 1){
			numm++;
		}
		numm += nummer / 2;
		erg.clear();
 
		if(a.size() > b.size()){
			rechner += (pl - numm);
		}
		else{
			rechner += numm;
		}
	}
	return rechner + a.size();
}

• Subtask 1: 79.5775 / 100