답안 #346132

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
346132	2021-01-09T06:56:10 Z	jDO_	버섯 세기 (IOI20_mushrooms)	C++17	92.623 / 100	10 ms	492 KB

mushrooms

#include "mushrooms.h"
#include <bits/stdc++.h>
using namespace std;
int count_mushrooms(int n) {
	vector<int> a;
	vector<int> b;
	vector<int> a1;
	vector<int> b1;
	vector<int> in;
	int cou = 1;
	a.push_back(0);
	a1.push_back(0);
	int i = 2;
	int m = 80;
	in.push_back(0);
	in.push_back(1);
	if(use_machine(in) == 1){
		b.push_back(1);
		b1.push_back(1);
	}
	else{
		a.push_back(1);
		a1.push_back(1);
		cou++;
	}
	if(n > 2){
	if(a1.size() != 2){
		in.pop_back();
		in.push_back(2);
		if(use_machine(in) == 1){
			b.push_back(2);
			b1.push_back(2);
		}
		else{
			a.push_back(2);
			a1.push_back(2);
			cou++;
		}
		i++;
	}
	if(a1.size() == 2){
		while(m--){
			in.clear();
			if(i >= n)	break;
			for(auto x: a1){
				if(i >= n)	break;
				in.push_back(x);
				in.push_back(i);
				i++;
			}
			int ans = use_machine(in);
			if(in.size() == 4){
			if(ans/2 == 1)	b.push_back(i-2);
			else 			a.push_back(i-2), cou++;
			}
			if(ans%2 == 1)	b.push_back(i-1);
			else 			a.push_back(i-1), cou++;
			// cout << cou << endl;
		}
	}
	else{
		while(m--){
			if(i >= n)	break;
			in.clear();
			for(auto x: b1){
				if(i >= n)	break;
				in.push_back(x);
				in.push_back(i);
				i++;
			}
			// for(auto x:in){
			// 	cout << x << ' ';
			// }
			// cout << endl;
			int ans = use_machine(in);
			if(in.size() == 4){
			if(ans/2 == 1)	a.push_back(i-2), cou++;
			else 			b.push_back(i-2);
			}
			if(ans%2 == 1)	a.push_back(i-1), cou++;
			else 			b.push_back(i-1);
		}
	}
	}
	while(i < n){
		// cout << i << '\n';
		in.clear();
		if(a.size() > b.size()){
			for(auto x: a){
				if(i >= n)	break;
				in.push_back(x);
				in.push_back(i);
				i++;
				if(i >= n)	break;
			}
			int ans = use_machine(in);
			// for(auto x:in){
			// 	cout << x << ' ';
			// }
			// cout << endl;
			cou += (in.size()/2)-1 - (ans/2);
			if(ans%2 == 0)	a.push_back(i-1), cou++;
			else 			b.push_back(i-1);
		}
		else{
			for(auto x: b){
				if(i >= n)	break;
				in.push_back(x);
				in.push_back(i);
				i++;
				if(i >= n)	break;
			}
			// for(auto x: b){
			// 	cout << x << ' ';
			// }
			int ans = use_machine(in);
			cou += ans/2;
			if(ans%2 == 1)	a.push_back(i-1), cou++;
			else 			b.push_back(i-1);
		}
	}
	return cou;
}

Subtask #1

92.623 / 100.0

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