Submission #802903

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
802903	2023-08-02T15:43:52 Z	prvocislo	Counting Mushrooms (IOI20_mushrooms)	C++17	80.7143 / 100	8 ms	588 KB

mushrooms

#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <vector>
typedef long long ll;
typedef long double ld;
using namespace std;

int use_machine(vector<int> x);

int count_mushrooms(int n)
{
	int cnt0 = 0; // pocet hribov typu 0 ktore mame
	vector<vector<int> > v(2); // hriby ktorych typ vieme
	v[0].push_back(0);

	vector<int> unk;
	for (int i = 1; i < n; i++) unk.push_back(i);
	random_shuffle(unk.begin(), unk.end());

	while (!unk.empty())
	{
		int id = 0;
		if (v[1].size() > v[0].size()) id = 1;
		vector<int> ask = v[id];
		ask.push_back(unk.back());
		unk.pop_back();
		int all = 0;
		vector<int> nw;
		for (int i = 0; i + 1 < v[id].size(); i++)
		{
			if (unk.empty()) break;
			nw.push_back(unk.back());
			ask.insert(ask.begin() + i * 2 + 1, unk.back());
			unk.pop_back();
			all++;
		}
		int x = use_machine(ask);
		if (x / 2 == 0)
		{
			for (int i : nw) v[id].push_back(i);
		}
		else if (x / 2 == all)
		{
			for (int i : nw) v[id ^ 1].push_back(i);
		}
		else
		{
			if (id == 0) cnt0 += all - (x / 2);
			else cnt0 += x / 2;
		}
		v[id ^ (x & 1)].push_back(ask.back());
	}
	return cnt0 + v[0].size();
}

Compilation message

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

Subtask #1
80.7143 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 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	1 ms	208 KB	Output is correct
5	Correct	1 ms	208 KB	Output is correct
6	Correct	1 ms	208 KB	Output is correct
7	Correct	5 ms	464 KB	Output is correct
8	Correct	5 ms	588 KB	Output is correct
9	Correct	5 ms	464 KB	Output is correct
10	Partially correct	7 ms	464 KB	Output is partially correct
11	Partially correct	6 ms	464 KB	Output is partially correct
12	Partially correct	6 ms	464 KB	Output is partially correct
13	Correct	5 ms	464 KB	Output is correct
14	Correct	3 ms	404 KB	Output is correct
15	Partially correct	8 ms	464 KB	Output is partially correct
16	Partially correct	7 ms	464 KB	Output is partially correct
17	Correct	3 ms	336 KB	Output is correct
18	Correct	5 ms	464 KB	Output is correct
19	Partially correct	6 ms	420 KB	Output is partially correct
20	Partially correct	5 ms	464 KB	Output is partially correct
21	Partially correct	5 ms	464 KB	Output is partially correct
22	Partially correct	6 ms	464 KB	Output is partially correct
23	Correct	6 ms	464 KB	Output is correct
24	Correct	4 ms	336 KB	Output is correct
25	Partially correct	6 ms	464 KB	Output is partially correct
26	Partially correct	7 ms	464 KB	Output is partially correct
27	Partially correct	7 ms	464 KB	Output is partially correct
28	Partially correct	6 ms	464 KB	Output is partially correct
29	Partially correct	5 ms	464 KB	Output is partially correct
30	Partially correct	6 ms	400 KB	Output is partially correct
31	Partially correct	7 ms	464 KB	Output is partially correct
32	Partially correct	6 ms	464 KB	Output is partially correct
33	Partially correct	6 ms	464 KB	Output is partially correct
34	Partially correct	5 ms	480 KB	Output is partially correct
35	Partially correct	6 ms	464 KB	Output is partially correct
36	Partially correct	5 ms	464 KB	Output is partially correct
37	Partially correct	6 ms	464 KB	Output is partially correct
38	Partially correct	6 ms	464 KB	Output is partially correct
39	Partially correct	7 ms	464 KB	Output is partially correct
40	Partially correct	5 ms	464 KB	Output is partially correct
41	Partially correct	6 ms	464 KB	Output is partially correct
42	Partially correct	5 ms	464 KB	Output is partially correct
43	Partially correct	5 ms	464 KB	Output is partially correct
44	Partially correct	6 ms	464 KB	Output is partially correct
45	Partially correct	6 ms	464 KB	Output is partially correct
46	Partially correct	7 ms	464 KB	Output is partially correct
47	Partially correct	7 ms	464 KB	Output is partially correct
48	Partially correct	6 ms	464 KB	Output is partially correct
49	Partially correct	8 ms	464 KB	Output is partially correct
50	Partially correct	6 ms	464 KB	Output is partially correct
51	Partially correct	7 ms	464 KB	Output is partially correct
52	Partially correct	6 ms	464 KB	Output is partially correct
53	Partially correct	5 ms	464 KB	Output is partially correct
54	Partially correct	7 ms	464 KB	Output is partially correct
55	Partially correct	5 ms	464 KB	Output is partially correct
56	Partially correct	6 ms	464 KB	Output is partially correct
57	Partially correct	6 ms	464 KB	Output is partially correct
58	Partially correct	8 ms	464 KB	Output is partially correct
59	Partially correct	6 ms	464 KB	Output is partially correct
60	Partially correct	6 ms	464 KB	Output is partially correct
61	Partially correct	7 ms	464 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	1 ms	208 KB	Output is correct
65	Correct	1 ms	208 KB	Output is correct
66	Correct	1 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	0 ms	208 KB	Output is correct
79	Correct	0 ms	208 KB	Output is correct
80	Correct	1 ms	208 KB	Output is correct
81	Correct	0 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	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	1 ms	208 KB	Output is correct
91	Correct	0 ms	208 KB	Output is correct

Submission #802903

Compilation message

Subtask #1 80.7143 / 100.0

Subtask #1
80.7143 / 100.0