답안 #702086

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
702086	2023-02-22T20:23:13 Z	grossly_overconfident	버섯 세기 (IOI20_mushrooms)	C++17	92.623 / 100	8 ms	444 KB

mushrooms

#include "mushrooms.h"
#include <bits/stdc++.h>
using namespace std;
/*
int uses = 0;

int use_machine(vector<int> v){
	int count = 0;
	uses++;
	vector<int> shrooms = 
	for (int i = 1; i < v.size(); ++i){
		if (shrooms[v[i]] != shrooms[v[i - 1]]){
			count++;
		}
	}
	return count;
}
*/


int count_mushrooms(int n) {
	if (n < 220){
		int a = 1;
		for (int i = 1; i < n; ++i){
			a += 1 - use_machine({ 0, i });
		}
		return a;
	}
	int asize = 1;
	int bsize = 0;
	vector<int> a(1, 0);
	vector<int> b;
	if (use_machine({ 0, 1 }) == 1){
		b.push_back(1);
		bsize++;
	}
	else{
		a.push_back(1);
		asize++;
	}
	if (use_machine({ 0, 2 }) == 1){
		b.push_back(2);
		bsize++;
	}
	else{
		a.push_back(2);
		asize++;
	}
	for (int i = 3; i <= 150; i += 2){
		if (asize > bsize){
			int h = use_machine({ i, a[0], i + 1, a[1]});
			//cout << i << " " << a[0] << " " << i + 1 << " " << a[1] << " :: " << h << " :: a" << endl;
			if (h == 0){
				asize += 2;
				a.push_back(i);
				a.push_back(i + 1);
			}
			else if (h == 3){
				bsize += 2;
				b.push_back(i);
				b.push_back(i + 1);
			}
			else{
				bsize += 1;
				asize += 1;
				if (h == 1){
					b.push_back(i);
					a.push_back(i + 1);
				}
				else{
					a.push_back(i);
					b.push_back(i + 1);
				}
			}
		}

		else {
			int h = use_machine({ i, b[0], i + 1, b[1] });
			//cout << i << " " << b[0] << " " << i + 1 << " " << b[1] << " :: " << h << " :: b" << endl;
			if (h == 0){
				bsize += 2;
				b.push_back(i);
				b.push_back(i + 1);
			}
			else if (h == 3){
				asize += 2;
				a.push_back(i);
				a.push_back(i + 1);
			}
			else{
				bsize += 1;
				asize += 1;
				if (h == 1){
					a.push_back(i);
					b.push_back(i + 1);
				}
				else{
					b.push_back(i);
					a.push_back(i + 1);
				}
			}
		}

		
	}
	/*
	for (auto u : a){
		cout << u << " ";
	}
	cout << endl << endl;
	for (auto u : b){
		cout << u << " ";
	}
	*/
	
	int i = 151;
	int tally = asize;
	while (true){
		if (a.size() < b.size()){
			vector<int> p;
			int w = i;
			for (int j = 0; j < bsize; ++j){
				p.push_back(i);
				p.push_back(b[j]);
				i++;
				if (i == n){
					break;
				}
			}
			int h = use_machine(p);
			if (h % 2 == 0){
				b.push_back(w);
				tally += h / 2;
				bsize++;

			}
			else{
				a.push_back(w);
				tally++;
				asize++;
				tally += (h - 1) / 2;
			}
			if (i == n){
				return tally;
			}
		}
		else{
			vector<int> p;
			int w = i;
			int psize = 0;
			for (int j = 0; j < asize; ++j){
				p.push_back(i);
				p.push_back(a[j]);
				psize++;
				i++;
				if (i == n){
					break;
				}
			}
			int h = use_machine(p);
			if (h % 2 == 0){
				a.push_back(w);
				asize++;
				tally++;
				tally += (psize - 1) - (h / 2);

			}
			else{
				b.push_back(w);
				bsize++;
				tally += (psize - 1) - ((h - 1) / 2);
			}
			if (i == n){
				return tally;
			}
		}
		if (i == n){
			return tally;
		}
	}
}
/*
int main(){
	int g = count_mushrooms(19002);
	cout << endl << endl << g << endl << uses;
	return 0;
}
*/

Subtask #1

92.623 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	208 KB	Output is correct
2	Correct	0 ms	208 KB	Output is correct
3	Correct	1 ms	208 KB	Output is correct
4	Correct	0 ms	208 KB	Output is correct
5	Correct	3 ms	208 KB	Output is correct
6	Correct	2 ms	208 KB	Output is correct
7	Correct	5 ms	208 KB	Output is correct
8	Correct	5 ms	208 KB	Output is correct
9	Correct	5 ms	208 KB	Output is correct
10	Correct	6 ms	324 KB	Output is correct
11	Partially correct	5 ms	208 KB	Output is partially correct
12	Correct	6 ms	320 KB	Output is correct
13	Correct	5 ms	208 KB	Output is correct
14	Correct	3 ms	328 KB	Output is correct
15	Partially correct	6 ms	208 KB	Output is partially correct
16	Partially correct	7 ms	208 KB	Output is partially correct
17	Correct	3 ms	208 KB	Output is correct
18	Correct	5 ms	208 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	304 KB	Output is correct
22	Partially correct	8 ms	208 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	8 ms	324 KB	Output is partially correct
26	Partially correct	6 ms	324 KB	Output is partially correct
27	Partially correct	5 ms	316 KB	Output is partially correct
28	Partially correct	8 ms	444 KB	Output is partially correct
29	Partially correct	5 ms	208 KB	Output is partially correct
30	Partially correct	7 ms	208 KB	Output is partially correct
31	Partially correct	6 ms	208 KB	Output is partially correct
32	Partially correct	6 ms	316 KB	Output is partially correct
33	Partially correct	6 ms	332 KB	Output is partially correct
34	Partially correct	6 ms	308 KB	Output is partially correct
35	Partially correct	6 ms	320 KB	Output is partially correct
36	Partially correct	6 ms	208 KB	Output is partially correct
37	Partially correct	8 ms	320 KB	Output is partially correct
38	Partially correct	6 ms	340 KB	Output is partially correct
39	Partially correct	6 ms	208 KB	Output is partially correct
40	Partially correct	7 ms	208 KB	Output is partially correct
41	Partially correct	5 ms	332 KB	Output is partially correct
42	Partially correct	6 ms	316 KB	Output is partially correct
43	Partially correct	6 ms	336 KB	Output is partially correct
44	Partially correct	6 ms	316 KB	Output is partially correct
45	Partially correct	6 ms	208 KB	Output is partially correct
46	Partially correct	6 ms	208 KB	Output is partially correct
47	Partially correct	6 ms	320 KB	Output is partially correct
48	Partially correct	5 ms	324 KB	Output is partially correct
49	Partially correct	5 ms	208 KB	Output is partially correct
50	Partially correct	6 ms	208 KB	Output is partially correct
51	Partially correct	6 ms	328 KB	Output is partially correct
52	Partially correct	8 ms	324 KB	Output is partially correct
53	Partially correct	5 ms	208 KB	Output is partially correct
54	Partially correct	5 ms	320 KB	Output is partially correct
55	Partially correct	6 ms	328 KB	Output is partially correct
56	Partially correct	5 ms	324 KB	Output is partially correct
57	Partially correct	8 ms	208 KB	Output is partially correct
58	Partially correct	8 ms	312 KB	Output is partially correct
59	Partially correct	6 ms	208 KB	Output is partially correct
60	Partially correct	6 ms	208 KB	Output is partially correct
61	Partially correct	6 ms	336 KB	Output is partially correct
62	Correct	1 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	0 ms	208 KB	Output is correct
67	Correct	0 ms	208 KB	Output is correct
68	Correct	1 ms	208 KB	Output is correct
69	Correct	1 ms	208 KB	Output is correct
70	Correct	1 ms	208 KB	Output is correct
71	Correct	1 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	1 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	1 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	0 ms	208 KB	Output is correct
83	Correct	0 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	0 ms	208 KB	Output is correct