답안 #805117

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
805117	2023-08-03T13:10:38 Z	LittleCube	버섯 세기 (IOI20_mushrooms)	C++17	92.623 / 100	7 ms	360 KB

mushrooms

#include "mushrooms.h"
#include <bits/stdc++.h>
#define ll long long
using namespace std;

/*
90:  92.2449
95:  92.2449
100: 92.2449
110: 91.129
*/
int k = 80;

int count_mushrooms(int n)
{
	int A = 0, B = 0;
	// small case
	if (n <= 226)
	{
		A = 1;
		for (int i = 1; i < n; i++)
			if (!use_machine({0, i}))
				A++;
		return A;
	}

	vector<int> a, b;
	a.emplace_back(0);
	for (int i = 1; i < 3; i++)
		if (use_machine({0, i}))
			b.push_back(i);
		else
			a.push_back(i);
	if (a.size() >= 2)
	{
		int a1 = a[0], a2 = a[1];
		for (int i = 3; i < 2 * k - 1; i += 2)
		{
			int result = use_machine({a1, i, a2, i + 1});
			if (result == 0)
				a.push_back(i), a.push_back(i + 1);
			else if (result == 1)
				a.push_back(i), b.push_back(i + 1);
			else if (result == 2)
				b.push_back(i), a.push_back(i + 1);
			else if (result == 3)
				b.push_back(i), b.push_back(i + 1);
		}
	}
	else
	{
		int b1 = b[0], b2 = b[1];
		for (int i = 3; i < 2 * k - 1; i += 2)
		{
			int result = use_machine({b1, i, b2, i + 1});
			if (result == 3)
				a.push_back(i), a.push_back(i + 1);
			else if (result == 2)
				a.push_back(i), b.push_back(i + 1);
			else if (result == 1)
				b.push_back(i), a.push_back(i + 1);
			else if (result == 0)
				b.push_back(i), b.push_back(i + 1);
		}
	}

	// not too small case
	if (n <= 2 * k - 1)
		return a.size();

	// big case
	for (int i = 2 * k - 1; i < n; i += k)
	{
		k = max(a.size(), b.size());
		if (a.size() >= k)
		{
			vector<int> q;
			int cnt = 0;
			for (int j = 0; j < k && i + j < n; j++)
			{
				q.emplace_back(a[j]);
				q.emplace_back(i + j);
				cnt++;
			}
			int result = use_machine(q);
			int dB = (result + 1) / 2, dA = cnt - dB;
			A += dA;
			if (result % 2 == 1)
				b.emplace_back(q.back());
			else
				a.emplace_back(q.back()), A--;
		}
		else
		{
			vector<int> q;
			int cnt = 0;
			for (int j = 0; j < k && i + j < n; j++)
			{
				q.emplace_back(b[j]);
				q.emplace_back(i + j);
				cnt++;
			}
			int result = use_machine(q);
			int dA = (result + 1) / 2;
			A += dA;
			if (result % 2 == 1)
				a.emplace_back(q.back()), A--;
			else
				b.emplace_back(q.back());
		}
	}
	return a.size() + A;
}

Compilation message

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:75:16: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   75 |   if (a.size() >= k)
      |       ~~~~~~~~~^~~~
mushrooms.cpp:16:13: warning: unused variable 'B' [-Wunused-variable]
   16 |  int A = 0, B = 0;
      |             ^

Subtask #1

92.623 / 100.0

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