Submission #796479

#	Time	Username	Problem	Language	Result	Execution time	Memory
796479		alexander707070	Counting Mushrooms (IOI20_mushrooms)	C++14	92.24 / 100	7 ms	336 KiB

mushrooms

#include<bits/stdc++.h>
#include "mushrooms.h"
#define MAXN 20000
using namespace std;
 
int bucket,res,ans;
int color[MAXN],br[2];
vector<int> s1,s2,curr;
pair<int,int> p;
 
int count_mushrooms(int N){
    if(N==2){
        return 1-use_machine({0,1})+1;
    }
    
    bucket=min(int(sqrt(N)*1.25),N-1);
 
    color[1]=use_machine({0,1});
    color[2]=use_machine({0,2});
 
    if(color[1]==0){
        p={0,1};
    }else if(color[2]==0){
        p={0,2};
    }else{
        p={1,2};
    }
 
    for(int i=3;i<bucket;i+=2){
        res=use_machine({p.first,i,p.second,i+1});
        if(p.first==0){
            if(res==0){color[i]=0; color[i+1]=0;}
            if(res==1){color[i]=0; color[i+1]=1;}
            if(res==2){color[i]=1; color[i+1]=0;}
            if(res==3){color[i]=1; color[i+1]=1;}
        }else{
            if(res==0){color[i]=1; color[i+1]=1;}
            if(res==1){color[i]=1; color[i+1]=0;}
            if(res==2){color[i]=0; color[i+1]=1;}
            if(res==3){color[i]=0; color[i+1]=0;}
        }
    }
 
    for(int i=0;i<bucket;i++){
        br[color[i]]++;
        if(color[i]==0)s1.push_back(i);
        else s2.push_back(i);
    }

	ans=br[0];
	for(int i=bucket;i<N;i+=max(br[0],br[1])){
		br[0]=int(s1.size()); br[1]=int(s2.size());

		if(br[0]>=br[1]){
			curr.clear();
			for(int f=i;f<min(i+br[0],N);f++){
				curr.push_back(s1[f-i]);
				curr.push_back(f);
			}
			res=use_machine(curr);
			ans+=(min(i+br[0],N)-i)-ceil(res/2.0);

			if(res%2==0){
				s1.push_back(min(i+br[0],N)-1);
			}else{
				s2.push_back(min(i+br[0],N)-1);
			}

		}else{
			curr.clear();
			for(int f=i;f<min(i+br[1],N);f++){
				curr.push_back(s2[f-i]);
				curr.push_back(f);
			}
			res=use_machine(curr);
			ans+=ceil(res/2.0);

			if(res%2==1){
				s1.push_back(min(i+br[1],N)-1);
			}else{
				s2.push_back(min(i+br[1],N)-1);
			}
		}
	}
 
    return ans;
}
 
/*
int main(){
 
}
*/

• Subtask 1: 92.2449 / 100