답안 #606570

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
606570	2022-07-26T07:15:12 Z	CyberCow	버섯 세기 (IOI20_mushrooms)	C++17	92.623 / 100	12 ms	376 KB

mushrooms

#include "mushrooms.h"
#include <vector>
using namespace std;
vector<int> a, b;

int count_mushrooms(int n) {
	int ans = 1, gt = 0;
	if (n <= 250)
	{
		for (int i = 1; i < n - 1; i += 2)
		{
			ans += 2 - use_machine({ i, 0, i + 1 });
		}
		if (n % 2 == 0)
			ans += 1 - use_machine({ 0, n - 1 });
		return ans;
	}
	int st = 0, st1 = 0;
	a.push_back(0);
	if (use_machine({ 0, 1 }))
	{
		st = 1;
		b.push_back(1);
		if (use_machine({ 0, 2 }))
		{
			st1 = 1;
			b.push_back(2);
		}
		else
		{
			a.push_back(2);
		}
	}
	else
	{
		a.push_back(1);
		if (use_machine({ 0, 2 }))
		{
			st1 = 1;
			b.push_back(2);
		}
		else
		{
			a.push_back(2);
		}
	}
	if (st == 0)
	{
		for (int i = 3; i < 160; i += 2)
		{
			int qan = use_machine({ 0, i, 1, i + 1 });
			if (qan == 0)
			{
				a.push_back(i);
				a.push_back(i + 1);
			}
			else if (qan == 1)
			{
				a.push_back(i);
				b.push_back(i + 1);
			}
			else if (qan == 2)
			{
				b.push_back(i);
				a.push_back(i + 1);
			}
			else
			{
				b.push_back(i);
				b.push_back(i + 1);
			}
		}
	}
	else if (st == 1 && st1 == 0)
	{
		for (int i = 3; i < 160; i += 2)
		{
			int qan = use_machine({ 0, i, 2, i + 1 });
			if (qan == 0)
			{
				a.push_back(i);
				a.push_back(i + 1);
			}
			else if (qan == 1)
			{
				a.push_back(i);
				b.push_back(i + 1);
			}
			else if (qan == 2)
			{
				b.push_back(i);
				a.push_back(i + 1);
			}
			else
			{
				b.push_back(i);
				b.push_back(i + 1);
			}
		}
	}
	else
	{
		for (int i = 3; i < 160; i += 2)
		{
			int qan = use_machine({ 1, i, 2, i + 1 });
			if (qan == 0)
			{
				b.push_back(i);
				b.push_back(i + 1);
			}
			else if (qan == 1)
			{
				b.push_back(i);
				a.push_back(i + 1);
			}
			else if (qan == 2)
			{
				a.push_back(i);
				b.push_back(i + 1);
			}
			else
			{
				a.push_back(i);
				a.push_back(i + 1);
			}
		}
	}
	ans = a.size();
	int j;
	vector<int> x;
	for (int i = 161; i < n; i++)
	{
		x.clear();
		if (a.size() > b.size())
		{
			int vr = 0;
			for (j = 0; j < a.size() && i + j < n; j++)
			{
				x.push_back(a[j]);
				x.push_back(i + j);
				vr = j;
			}
			int f = use_machine(x);
			ans += vr - f / 2;
			if (f % 2)
			{
				b.push_back(x[x.size() - 1]);
			}
			else
			{
				a.push_back(x[x.size() - 1]);
				ans++;
			}
			i += vr;
		}
		else
		{
			int vr = 0;
			for (j = 0; j < b.size() && i + j < n; j++)
			{
				x.push_back(b[j]);
				x.push_back(i + j);
				vr = j;
			}
			int f = use_machine(x);
			ans += f / 2;
			if (f % 2)
			{
				a.push_back(x[x.size() - 1]);
				ans++;
			}
			else
			{
				b.push_back(x[x.size() - 1]);
			}
			i += vr;
		}
	}
	return ans;
}

Compilation message

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:137:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  137 |    for (j = 0; j < a.size() && i + j < n; j++)
      |                ~~^~~~~~~~~~
mushrooms.cpp:159:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  159 |    for (j = 0; j < b.size() && i + j < n; j++)
      |                ~~^~~~~~~~~~
mushrooms.cpp:7:15: warning: unused variable 'gt' [-Wunused-variable]
    7 |  int ans = 1, gt = 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	1 ms	208 KB	Output is correct
5	Correct	2 ms	208 KB	Output is correct
6	Correct	1 ms	300 KB	Output is correct
7	Correct	8 ms	292 KB	Output is correct
8	Correct	7 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	8 ms	208 KB	Output is partially correct
12	Correct	7 ms	304 KB	Output is correct
13	Correct	9 ms	292 KB	Output is correct
14	Correct	5 ms	312 KB	Output is correct
15	Partially correct	6 ms	316 KB	Output is partially correct
16	Partially correct	10 ms	316 KB	Output is partially correct
17	Correct	5 ms	304 KB	Output is correct
18	Correct	5 ms	208 KB	Output is correct
19	Partially correct	6 ms	308 KB	Output is partially correct
20	Correct	6 ms	336 KB	Output is correct
21	Correct	7 ms	304 KB	Output is correct
22	Partially correct	8 ms	304 KB	Output is partially correct
23	Correct	10 ms	208 KB	Output is correct
24	Correct	4 ms	208 KB	Output is correct
25	Partially correct	10 ms	312 KB	Output is partially correct
26	Partially correct	8 ms	304 KB	Output is partially correct
27	Partially correct	8 ms	312 KB	Output is partially correct
28	Partially correct	7 ms	316 KB	Output is partially correct
29	Partially correct	7 ms	364 KB	Output is partially correct
30	Partially correct	9 ms	208 KB	Output is partially correct
31	Partially correct	10 ms	316 KB	Output is partially correct
32	Partially correct	5 ms	376 KB	Output is partially correct
33	Partially correct	8 ms	316 KB	Output is partially correct
34	Partially correct	12 ms	292 KB	Output is partially correct
35	Partially correct	7 ms	308 KB	Output is partially correct
36	Partially correct	5 ms	316 KB	Output is partially correct
37	Partially correct	9 ms	308 KB	Output is partially correct
38	Partially correct	8 ms	208 KB	Output is partially correct
39	Partially correct	7 ms	312 KB	Output is partially correct
40	Partially correct	8 ms	304 KB	Output is partially correct
41	Partially correct	9 ms	208 KB	Output is partially correct
42	Partially correct	8 ms	312 KB	Output is partially correct
43	Partially correct	8 ms	324 KB	Output is partially correct
44	Partially correct	11 ms	320 KB	Output is partially correct
45	Partially correct	10 ms	304 KB	Output is partially correct
46	Partially correct	6 ms	312 KB	Output is partially correct
47	Partially correct	8 ms	308 KB	Output is partially correct
48	Partially correct	7 ms	208 KB	Output is partially correct
49	Partially correct	5 ms	320 KB	Output is partially correct
50	Partially correct	7 ms	308 KB	Output is partially correct
51	Partially correct	9 ms	312 KB	Output is partially correct
52	Partially correct	11 ms	304 KB	Output is partially correct
53	Partially correct	9 ms	208 KB	Output is partially correct
54	Partially correct	7 ms	316 KB	Output is partially correct
55	Partially correct	8 ms	316 KB	Output is partially correct
56	Partially correct	8 ms	208 KB	Output is partially correct
57	Partially correct	8 ms	228 KB	Output is partially correct
58	Partially correct	8 ms	312 KB	Output is partially correct
59	Partially correct	8 ms	304 KB	Output is partially correct
60	Partially correct	9 ms	308 KB	Output is partially correct
61	Partially correct	9 ms	300 KB	Output is partially correct
62	Correct	1 ms	208 KB	Output is correct
63	Correct	1 ms	256 KB	Output is correct
64	Correct	1 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	1 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	284 KB	Output is correct
72	Correct	0 ms	208 KB	Output is correct
73	Correct	1 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	0 ms	208 KB	Output is correct
78	Correct	1 ms	208 KB	Output is correct
79	Correct	1 ms	208 KB	Output is correct
80	Correct	1 ms	208 KB	Output is correct
81	Correct	1 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	1 ms	208 KB	Output is correct
85	Correct	0 ms	288 KB	Output is correct
86	Correct	1 ms	208 KB	Output is correct
87	Correct	1 ms	208 KB	Output is correct
88	Correct	0 ms	208 KB	Output is correct
89	Correct	1 ms	208 KB	Output is correct
90	Correct	0 ms	208 KB	Output is correct
91	Correct	0 ms	208 KB	Output is correct