답안 #796480

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
796480	2023-07-28T12:24:24 Z	alexander707070	버섯 세기 (IOI20_mushrooms)	C++14	92.2449 / 100	7 ms	340 KB

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),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.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	208 KB	Output is correct
2	Correct	0 ms	208 KB	Output is correct
3	Correct	0 ms	208 KB	Output is correct
4	Correct	0 ms	208 KB	Output is correct
5	Correct	1 ms	208 KB	Output is correct
6	Correct	1 ms	312 KB	Output is correct
7	Correct	5 ms	208 KB	Output is correct
8	Correct	6 ms	208 KB	Output is correct
9	Correct	6 ms	208 KB	Output is correct
10	Correct	5 ms	208 KB	Output is correct
11	Partially correct	5 ms	332 KB	Output is partially correct
12	Correct	5 ms	208 KB	Output is correct
13	Correct	5 ms	312 KB	Output is correct
14	Correct	3 ms	336 KB	Output is correct
15	Partially correct	7 ms	332 KB	Output is partially correct
16	Partially correct	5 ms	312 KB	Output is partially correct
17	Correct	4 ms	208 KB	Output is correct
18	Correct	4 ms	320 KB	Output is correct
19	Partially correct	5 ms	336 KB	Output is partially correct
20	Correct	5 ms	208 KB	Output is correct
21	Correct	5 ms	320 KB	Output is correct
22	Partially correct	5 ms	324 KB	Output is partially correct
23	Correct	6 ms	208 KB	Output is correct
24	Correct	3 ms	208 KB	Output is correct
25	Partially correct	6 ms	336 KB	Output is partially correct
26	Partially correct	5 ms	208 KB	Output is partially correct
27	Partially correct	5 ms	316 KB	Output is partially correct
28	Partially correct	6 ms	208 KB	Output is partially correct
29	Partially correct	5 ms	336 KB	Output is partially correct
30	Partially correct	6 ms	312 KB	Output is partially correct
31	Partially correct	5 ms	316 KB	Output is partially correct
32	Partially correct	5 ms	208 KB	Output is partially correct
33	Partially correct	5 ms	316 KB	Output is partially correct
34	Partially correct	5 ms	336 KB	Output is partially correct
35	Partially correct	4 ms	340 KB	Output is partially correct
36	Partially correct	5 ms	336 KB	Output is partially correct
37	Partially correct	5 ms	328 KB	Output is partially correct
38	Partially correct	5 ms	336 KB	Output is partially correct
39	Partially correct	6 ms	336 KB	Output is partially correct
40	Partially correct	5 ms	336 KB	Output is partially correct
41	Partially correct	5 ms	332 KB	Output is partially correct
42	Partially correct	5 ms	332 KB	Output is partially correct
43	Partially correct	5 ms	336 KB	Output is partially correct
44	Partially correct	7 ms	324 KB	Output is partially correct
45	Partially correct	5 ms	328 KB	Output is partially correct
46	Partially correct	6 ms	336 KB	Output is partially correct
47	Partially correct	5 ms	312 KB	Output is partially correct
48	Partially correct	6 ms	336 KB	Output is partially correct
49	Partially correct	5 ms	336 KB	Output is partially correct
50	Partially correct	6 ms	336 KB	Output is partially correct
51	Partially correct	6 ms	312 KB	Output is partially correct
52	Partially correct	5 ms	336 KB	Output is partially correct
53	Partially correct	6 ms	336 KB	Output is partially correct
54	Partially correct	6 ms	208 KB	Output is partially correct
55	Partially correct	5 ms	336 KB	Output is partially correct
56	Partially correct	7 ms	336 KB	Output is partially correct
57	Partially correct	6 ms	336 KB	Output is partially correct
58	Partially correct	5 ms	336 KB	Output is partially correct
59	Partially correct	5 ms	336 KB	Output is partially correct
60	Partially correct	7 ms	336 KB	Output is partially correct
61	Partially correct	6 ms	208 KB	Output is partially correct
62	Correct	0 ms	208 KB	Output is correct
63	Correct	0 ms	208 KB	Output is correct
64	Correct	0 ms	208 KB	Output is correct
65	Correct	0 ms	208 KB	Output is correct
66	Correct	1 ms	208 KB	Output is correct
67	Correct	0 ms	208 KB	Output is correct
68	Correct	0 ms	208 KB	Output is correct
69	Correct	0 ms	208 KB	Output is correct
70	Correct	0 ms	208 KB	Output is correct
71	Correct	0 ms	208 KB	Output is correct
72	Correct	0 ms	208 KB	Output is correct
73	Correct	0 ms	208 KB	Output is correct
74	Correct	0 ms	208 KB	Output is correct
75	Correct	0 ms	208 KB	Output is correct
76	Correct	0 ms	208 KB	Output is correct
77	Correct	1 ms	208 KB	Output is correct
78	Correct	0 ms	208 KB	Output is correct
79	Correct	0 ms	208 KB	Output is correct
80	Correct	0 ms	208 KB	Output is correct
81	Correct	0 ms	208 KB	Output is correct
82	Correct	1 ms	208 KB	Output is correct
83	Correct	1 ms	208 KB	Output is correct
84	Correct	0 ms	208 KB	Output is correct
85	Correct	0 ms	208 KB	Output is correct
86	Correct	0 ms	208 KB	Output is correct
87	Correct	0 ms	208 KB	Output is correct
88	Correct	0 ms	208 KB	Output is correct
89	Correct	0 ms	208 KB	Output is correct
90	Correct	1 ms	208 KB	Output is correct
91	Correct	1 ms	208 KB	Output is correct