Submission #824259

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
824259	2023-08-13T22:07:20 Z	thimote75	Counting Mushrooms (IOI20_mushrooms)	C++14	79.8587 / 100	7 ms	316 KB

mushrooms

#include "mushrooms.h"

#include <bits/stdc++.h>

using namespace std;

using idata = vector<int>;

const int QK = 273;

int count_mushrooms(int n) {
	idata Av = { 0 };
	idata Bv = { };

	if (n < QK) {
		for (int i = 1; i < n; i ++) {
			int res = use_machine({ 0, i });
			if (res) Bv.push_back(i);
			else Av.push_back(i);
		}

		return Av.size();
	}

	if (use_machine({ 0, 1 }) == 0) Av.push_back(1);
	else Bv.push_back(1);

	if (use_machine({ 0, 2 }) == 0) Av.push_back(2);
	else Bv.push_back(2);
	
	if (Av.size() >= 2) {
		for (int i = 3; i < QK; i += 2) {
			int res = use_machine({ i, 0, i + 1, Av[1] });

			if (res & 1) Bv.push_back(i);
			else Av.push_back(i);

			if (res & 2) Bv.push_back(i + 1);
			else Av.push_back(i + 1);
		}
	} else {
		for (int i = 3; i < QK; i += 2) {
			int res = use_machine({ i, Bv[0], i + 1, Bv[1] });

			if (res & 1) Av.push_back(i);
			else Bv.push_back(i);

			if (res & 2) Av.push_back(i + 1);
			else Bv.push_back(i + 1);
		}
	}

	int offset     = 0;
	int multiplier = 1;
	
	if (Bv.size() > Av.size()) {
		Bv.swap(Av);
		offset = n;
		multiplier = -1;
	}

	int total = Av.size();

	for (int i = QK; i < n; i += Av.size() - 1) {
		idata templ;

		int cnt = 0;
		for (int j = 0; j < Av.size() - 1; j ++) {
			templ.push_back(Av[j]);

			if (i + j >= n) continue ;

			cnt ++;
			templ.push_back(i + j);
		}
		templ.push_back(Av[Av.size() - 1]);

		int res = use_machine(templ);

		int c0 = (cnt) - (res >> 1);
		total += c0;
	}

	return offset + multiplier * total;
}

Compilation message

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

Subtask #1
79.8587 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	208 KB	Output is correct
2	Correct	0 ms	208 KB	Output is correct
3	Correct	0 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	2 ms	208 KB	Output is correct
7	Correct	4 ms	308 KB	Output is correct
8	Correct	5 ms	208 KB	Output is correct
9	Correct	5 ms	208 KB	Output is correct
10	Partially correct	7 ms	208 KB	Output is partially correct
11	Partially correct	5 ms	208 KB	Output is partially correct
12	Partially correct	5 ms	208 KB	Output is partially correct
13	Correct	5 ms	208 KB	Output is correct
14	Correct	3 ms	208 KB	Output is correct
15	Partially correct	6 ms	208 KB	Output is partially correct
16	Partially correct	5 ms	308 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	208 KB	Output is partially correct
20	Partially correct	5 ms	208 KB	Output is partially correct
21	Partially correct	5 ms	208 KB	Output is partially correct
22	Partially correct	5 ms	208 KB	Output is partially correct
23	Partially correct	5 ms	208 KB	Output is partially correct
24	Correct	4 ms	208 KB	Output is correct
25	Partially correct	6 ms	304 KB	Output is partially correct
26	Partially correct	6 ms	208 KB	Output is partially correct
27	Partially correct	5 ms	208 KB	Output is partially correct
28	Partially correct	5 ms	208 KB	Output is partially correct
29	Partially correct	6 ms	308 KB	Output is partially correct
30	Partially correct	6 ms	208 KB	Output is partially correct
31	Partially correct	6 ms	208 KB	Output is partially correct
32	Partially correct	5 ms	208 KB	Output is partially correct
33	Partially correct	5 ms	208 KB	Output is partially correct
34	Partially correct	6 ms	308 KB	Output is partially correct
35	Partially correct	7 ms	208 KB	Output is partially correct
36	Partially correct	5 ms	208 KB	Output is partially correct
37	Partially correct	6 ms	308 KB	Output is partially correct
38	Partially correct	5 ms	304 KB	Output is partially correct
39	Partially correct	5 ms	208 KB	Output is partially correct
40	Partially correct	5 ms	208 KB	Output is partially correct
41	Partially correct	7 ms	208 KB	Output is partially correct
42	Partially correct	6 ms	308 KB	Output is partially correct
43	Partially correct	4 ms	208 KB	Output is partially correct
44	Partially correct	7 ms	208 KB	Output is partially correct
45	Partially correct	6 ms	208 KB	Output is partially correct
46	Partially correct	4 ms	316 KB	Output is partially correct
47	Partially correct	6 ms	208 KB	Output is partially correct
48	Partially correct	7 ms	208 KB	Output is partially correct
49	Partially correct	6 ms	208 KB	Output is partially correct
50	Partially correct	7 ms	208 KB	Output is partially correct
51	Partially correct	5 ms	208 KB	Output is partially correct
52	Partially correct	5 ms	208 KB	Output is partially correct
53	Partially correct	6 ms	312 KB	Output is partially correct
54	Partially correct	5 ms	208 KB	Output is partially correct
55	Partially correct	6 ms	208 KB	Output is partially correct
56	Partially correct	6 ms	208 KB	Output is partially correct
57	Partially correct	5 ms	208 KB	Output is partially correct
58	Partially correct	5 ms	208 KB	Output is partially correct
59	Partially correct	6 ms	208 KB	Output is partially correct
60	Partially correct	4 ms	208 KB	Output is partially correct
61	Partially correct	6 ms	208 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	0 ms	208 KB	Output is correct
69	Correct	0 ms	208 KB	Output is correct
70	Correct	0 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	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	0 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	0 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	0 ms	208 KB	Output is correct
91	Correct	0 ms	208 KB	Output is correct

Submission #824259

Compilation message

Subtask #1 79.8587 / 100.0

Subtask #1
79.8587 / 100.0