Submission #304275

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
304275	2020-09-21T05:34:16 Z	galca	Counting Mushrooms (IOI20_mushrooms)	C++14	92.2449 / 100	10 ms	384 KB

mushrooms

#include "mushrooms.h"

using namespace std;

int count_mushrooms(int n) {
	vector<int> knownZeros;
	vector<int> knownOnes;

	knownZeros.push_back(0);
	// find one more, or two 1s
	int i = 1;
	while ((knownZeros.size() < 2) && (knownOnes.size() < 2)) {
		int c = use_machine({ 0, i });
		if (c) {
			knownOnes.push_back(i);
		}
		else {
			knownZeros.push_back(i);
		}
		++i;
		if (i == n) {
			return knownZeros.size();
		}
	}

	vector<int> fours;
	bool isZero = false;

	if (knownZeros.size() == 2) {
		fours.push_back(knownZeros[0]);
		fours.push_back(0);
		fours.push_back(knownZeros[1]);
		fours.push_back(0);
		isZero = true;
	}
	else {
		fours.push_back(knownOnes[0]);
		fours.push_back(0);
		fours.push_back(knownOnes[1]);
		fours.push_back(0);
	}

	while ((knownZeros.size() < 100) && (knownOnes.size() < 100)) {
		if (i == n) {
			return knownZeros.size();
		}
		if (i == (n - 1)) {
			int c = use_machine({ 0, n - 1 });
			if (c) {
				return knownZeros.size();
			}
			else {
				return knownZeros.size() + 1;
			}
		}
		fours[1] = i;
		fours[3] = i+1;
		int c = use_machine(fours);

		switch (c) {
			case 0:
				if (isZero) {
					knownZeros.push_back(i);
					knownZeros.push_back(i+1);
				}
				else {
					knownOnes.push_back(i);
					knownOnes.push_back(i + 1);
				}
				break;
			case 1:
				if (isZero) {
					knownZeros.push_back(i);
					knownOnes.push_back(i+1);
				}
				else {
					knownOnes.push_back(i);
					knownZeros.push_back(i + 1);
				}
				break;
			case 2:
				if (isZero) {
					knownOnes.push_back(i);
					knownZeros.push_back(i+1);
				}
				else {
					knownZeros.push_back(i);
					knownOnes.push_back(i + 1);
				}
				break;
			case 3:
				if (isZero) {
					knownOnes.push_back(i);
					knownOnes.push_back(i + 1);
				}
				else {
					knownZeros.push_back(i);
					knownZeros.push_back(i + 1);
				}
				break;
		}
		i += 2;
	}

	int totalZeros = knownZeros.size();

	while (i < n) {
		vector<int> m;
		if (knownOnes.size() >= knownZeros.size()) {
			
			for (int j = 0; j < knownOnes.size(); j++) {
				if ((i + j) < n) {
					m.push_back(knownOnes[j]);
					m.push_back(i + j);
				}
			}
			i += knownOnes.size();
			int c = use_machine(m);
			if (c & 1) {
				++totalZeros;
				--c;
				knownZeros.push_back(m[m.size() - 1]);
			}
			else {
				knownOnes.push_back(m[m.size() - 1]);
			}
			totalZeros += c / 2;
			
		}
		else {
			for (int j = 0; j < knownZeros.size(); j++) {
				if ((i + j) < n) {
					m.push_back(knownZeros[j]);
					m.push_back(i + j);
				}
			}
			i += knownZeros.size();
			int c = use_machine(m);
			if (c & 1) {
				++c;
				knownOnes.push_back(m[m.size() - 1]);
			}
			else {
				knownZeros.push_back(m[m.size() - 1]);
			}
			totalZeros += (m.size() - c) / 2;
			
		}
	}
	return totalZeros;
}

Compilation message

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:111:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  111 |    for (int j = 0; j < knownOnes.size(); j++) {
      |                    ~~^~~~~~~~~~~~~~~~~~
mushrooms.cpp:131:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  131 |    for (int j = 0; j < knownZeros.size(); j++) {
      |                    ~~^~~~~~~~~~~~~~~~~~~

Subtask #1

92.2449 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	256 KB	Output is correct
2	Correct	0 ms	256 KB	Output is correct
3	Correct	0 ms	256 KB	Output is correct
4	Correct	0 ms	256 KB	Output is correct
5	Correct	1 ms	256 KB	Output is correct
6	Correct	2 ms	256 KB	Output is correct
7	Correct	8 ms	256 KB	Output is correct
8	Correct	7 ms	288 KB	Output is correct
9	Correct	6 ms	256 KB	Output is correct
10	Correct	7 ms	368 KB	Output is correct
11	Partially correct	7 ms	256 KB	Output is partially correct
12	Correct	7 ms	256 KB	Output is correct
13	Correct	8 ms	256 KB	Output is correct
14	Correct	4 ms	384 KB	Output is correct
15	Partially correct	7 ms	256 KB	Output is partially correct
16	Partially correct	9 ms	256 KB	Output is partially correct
17	Correct	4 ms	256 KB	Output is correct
18	Correct	6 ms	256 KB	Output is correct
19	Partially correct	7 ms	256 KB	Output is partially correct
20	Correct	7 ms	256 KB	Output is correct
21	Correct	7 ms	256 KB	Output is correct
22	Partially correct	7 ms	256 KB	Output is partially correct
23	Correct	7 ms	256 KB	Output is correct
24	Correct	4 ms	256 KB	Output is correct
25	Partially correct	9 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	7 ms	256 KB	Output is partially correct
29	Partially correct	9 ms	256 KB	Output is partially correct
30	Partially correct	7 ms	256 KB	Output is partially correct
31	Partially correct	7 ms	256 KB	Output is partially correct
32	Partially correct	9 ms	256 KB	Output is partially correct
33	Partially correct	9 ms	256 KB	Output is partially correct
34	Partially correct	7 ms	256 KB	Output is partially correct
35	Partially correct	7 ms	256 KB	Output is partially correct
36	Partially correct	7 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	7 ms	256 KB	Output is partially correct
41	Partially correct	7 ms	256 KB	Output is partially correct
42	Partially correct	7 ms	256 KB	Output is partially correct
43	Partially correct	8 ms	256 KB	Output is partially correct
44	Partially correct	9 ms	288 KB	Output is partially correct
45	Partially correct	7 ms	256 KB	Output is partially correct
46	Partially correct	7 ms	376 KB	Output is partially correct
47	Partially correct	10 ms	256 KB	Output is partially correct
48	Partially correct	7 ms	256 KB	Output is partially correct
49	Partially correct	7 ms	256 KB	Output is partially correct
50	Partially correct	7 ms	256 KB	Output is partially correct
51	Partially correct	7 ms	256 KB	Output is partially correct
52	Partially correct	7 ms	384 KB	Output is partially correct
53	Partially correct	7 ms	256 KB	Output is partially correct
54	Partially correct	7 ms	256 KB	Output is partially correct
55	Partially correct	9 ms	256 KB	Output is partially correct
56	Partially correct	7 ms	360 KB	Output is partially correct
57	Partially correct	7 ms	256 KB	Output is partially correct
58	Partially correct	7 ms	256 KB	Output is partially correct
59	Partially correct	7 ms	256 KB	Output is partially correct
60	Partially correct	7 ms	256 KB	Output is partially correct
61	Partially correct	7 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	1 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	384 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	1 ms	256 KB	Output is correct
90	Correct	0 ms	256 KB	Output is correct
91	Correct	0 ms	256 KB	Output is correct