답안 #304395

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
304395 2020-09-21T09:07:36 Z QAQAutoMaton 버섯 세기 (IOI20_mushrooms) C++17
80.427 / 100
10 ms 384 KB
#include "mushrooms.h"
#include<algorithm>
const int B=135;
int solve(int n,std::vector<int> &a){
	std::vector<int> b;
	int st=B+B+3,ans=0;
	while(st<n){
		int m=std::min(n-st,(int)a.size());
		b.clear();
		for(int i=0;i<m;++i){
			b.emplace_back(st+i);
			b.emplace_back(a[i]);
		}
		ans+=(use_machine(b)+1)>>1;
		st+=m;
	}
	return ans;
}
int count_mushrooms(int n) {
	std::vector<int> xA(0),xB(0);
	xA.emplace_back(0);
	if(n<=B){
		int ans=1;
		for(int i=1;i<n;++i){
			ans+=!use_machine({0,i});
		}
		return ans;
	}
	else{
		int x=!use_machine({0,1}),y=!use_machine({0,2});
		(x?xA:xB).emplace_back(1);
		(y?xA:xB).emplace_back(2);
		int s1,s2,w;
		if(x){s1=0,s2=1;w=0;}
		else if(y){s1=0;s2=2;w=0;}
		else{s1=1;s2=2;w=3;}
		if(n<=B+B+3){
			for(int i=3;i<n;i+=2){
				if(i+1==n){
					(!use_machine({0,i})?xA:xB).emplace_back(i);
				}
				else{
					int v=use_machine({s1,i,s2,i+1})^w;
					(v&2?xB:xA).emplace_back(i);
					(v&1?xB:xA).emplace_back(i+1);
				}
			}
			return xA.size();
		}
		else{
			for(int i=0;i<B;++i){
				int v=use_machine({s1,(i<<1)+3,s2,(i<<1)+4})^w;
				(v&2?xB:xA).emplace_back((i<<1)+3);
				(v&1?xB:xA).emplace_back((i<<1)+4);
			}
			if(xA.size()>xB.size()){
				return xA.size()+(n-B-B-3)-solve(n,xA);	
			}
			else{
				return xA.size()+solve(n,xB);	
			}
		}
	}
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 7 ms 256 KB Output is correct
8 Correct 7 ms 256 KB Output is correct
9 Correct 7 ms 256 KB Output is correct
10 Partially correct 6 ms 256 KB Output is partially correct
11 Partially correct 7 ms 256 KB Output is partially correct
12 Partially correct 7 ms 256 KB Output is partially correct
13 Correct 7 ms 256 KB Output is correct
14 Correct 4 ms 256 KB Output is correct
15 Partially correct 7 ms 256 KB Output is partially correct
16 Partially correct 8 ms 256 KB Output is partially correct
17 Correct 4 ms 256 KB Output is correct
18 Correct 10 ms 256 KB Output is correct
19 Partially correct 7 ms 256 KB Output is partially correct
20 Partially correct 7 ms 256 KB Output is partially correct
21 Partially correct 7 ms 256 KB Output is partially correct
22 Partially correct 7 ms 256 KB Output is partially correct
23 Partially correct 9 ms 368 KB Output is partially correct
24 Correct 4 ms 256 KB Output is correct
25 Partially correct 7 ms 256 KB Output is partially correct
26 Partially correct 7 ms 256 KB Output is partially correct
27 Partially correct 7 ms 256 KB Output is partially correct
28 Partially correct 8 ms 256 KB Output is partially correct
29 Partially correct 7 ms 256 KB Output is partially correct
30 Partially correct 7 ms 256 KB Output is partially correct
31 Partially correct 9 ms 256 KB Output is partially correct
32 Partially correct 9 ms 256 KB Output is partially correct
33 Partially correct 7 ms 256 KB Output is partially correct
34 Partially correct 8 ms 256 KB Output is partially correct
35 Partially correct 7 ms 256 KB Output is partially correct
36 Partially correct 9 ms 256 KB Output is partially correct
37 Partially correct 7 ms 256 KB Output is partially correct
38 Partially correct 7 ms 256 KB Output is partially correct
39 Partially correct 7 ms 256 KB Output is partially correct
40 Partially correct 6 ms 364 KB Output is partially correct
41 Partially correct 7 ms 256 KB Output is partially correct
42 Partially correct 8 ms 384 KB Output is partially correct
43 Partially correct 9 ms 256 KB Output is partially correct
44 Partially correct 9 ms 256 KB Output is partially correct
45 Partially correct 9 ms 256 KB Output is partially correct
46 Partially correct 7 ms 256 KB Output is partially correct
47 Partially correct 7 ms 256 KB Output is partially correct
48 Partially correct 9 ms 256 KB Output is partially correct
49 Partially correct 8 ms 384 KB Output is partially correct
50 Partially correct 8 ms 256 KB Output is partially correct
51 Partially correct 7 ms 256 KB Output is partially correct
52 Partially correct 7 ms 256 KB Output is partially correct
53 Partially correct 8 ms 256 KB Output is partially correct
54 Partially correct 8 ms 256 KB Output is partially correct
55 Partially correct 7 ms 256 KB Output is partially correct
56 Partially correct 7 ms 256 KB Output is partially correct
57 Partially correct 7 ms 256 KB Output is partially correct
58 Partially correct 8 ms 256 KB Output is partially correct
59 Partially correct 7 ms 256 KB Output is partially correct
60 Partially correct 9 ms 256 KB Output is partially correct
61 Partially correct 8 ms 256 KB Output is partially correct
62 Correct 0 ms 256 KB Output is correct
63 Correct 0 ms 256 KB Output is correct
64 Correct 0 ms 256 KB Output is correct
65 Correct 0 ms 256 KB Output is correct
66 Correct 0 ms 256 KB Output is correct
67 Correct 0 ms 256 KB Output is correct
68 Correct 0 ms 256 KB Output is correct
69 Correct 0 ms 256 KB Output is correct
70 Correct 0 ms 256 KB Output is correct
71 Correct 0 ms 256 KB Output is correct
72 Correct 0 ms 256 KB Output is correct
73 Correct 0 ms 256 KB Output is correct
74 Correct 0 ms 256 KB Output is correct
75 Correct 0 ms 256 KB Output is correct
76 Correct 0 ms 256 KB Output is correct
77 Correct 1 ms 256 KB Output is correct
78 Correct 0 ms 256 KB Output is correct
79 Correct 0 ms 256 KB Output is correct
80 Correct 0 ms 256 KB Output is correct
81 Correct 0 ms 256 KB Output is correct
82 Correct 0 ms 256 KB Output is correct
83 Correct 0 ms 256 KB Output is correct
84 Correct 0 ms 256 KB Output is correct
85 Correct 0 ms 256 KB Output is correct
86 Correct 0 ms 256 KB Output is correct
87 Correct 0 ms 256 KB Output is correct
88 Correct 0 ms 256 KB Output is correct
89 Correct 0 ms 256 KB Output is correct
90 Correct 1 ms 256 KB Output is correct
91 Correct 0 ms 256 KB Output is correct