Submission #331913

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
331913	2020-11-30T16:51:33 Z	pggp	Counting Mushrooms (IOI20_mushrooms)	C++14	79.8587 / 100	12 ms	388 KB

mushrooms

#include <bits/stdc++.h>
#include "mushrooms.h"

using namespace std;


vector < bool > mushrooms;

int use_machine(vector < int > x);

int c;

int count_mushrooms(int n){
	int num = 282;
	int ans = 1;
	if(n < num){
		for (int i = 1; i < n; ++i)
		{
			vector < int > v;
			v.push_back(0);
			v.push_back(i);
			ans += 1 - use_machine(v);
		}
		return ans;
	}

	vector < int > A_pos;
	vector < int > B_pos;

	for (int i = 1; i < 4; ++i)
	{
		vector < int > v;
		v.push_back(0);
		v.push_back(i);
		int t = use_machine(v);
		if(t){
			B_pos.push_back(i);
		}
		else{
			A_pos.push_back(i);
		}
	}

	if(A_pos.size() > 1){
		for (int i = 4; i < num; i += 2)
		{
			vector < int > v;
			v.push_back(0);
			v.push_back(i);
			v.push_back(A_pos[0]);
			v.push_back(i + 1);
			int t = use_machine(v);
			if(t == 0){
				A_pos.push_back(i);
				A_pos.push_back(i + 1);
			}
			if(t == 1){
				A_pos.push_back(i);
				B_pos.push_back(i + 1);
			}
			if(t == 2){
				A_pos.push_back(i + 1);
				B_pos.push_back(i);
			}

			if(t == 3){
				B_pos.push_back(i);
				B_pos.push_back(i + 1);
			}
		}
	}
	else{
		//cout << "xxx" << endl;
		for (int i = 4; i < num; i += 2)
		{
			vector < int > v;
			v.push_back(0);
			v.push_back(B_pos[0]);
			v.push_back(i);
			v.push_back(B_pos[1]);
			v.push_back(i + 1);
			int t = use_machine(v);
			if(t == 1){
				B_pos.push_back(i);
				B_pos.push_back(i + 1);
			}
			if(t == 2){
				B_pos.push_back(i);
				A_pos.push_back(i + 1);
			}
			if(t == 3){
				B_pos.push_back(i + 1);
				A_pos.push_back(i);
			}

			if(t == 4){
				A_pos.push_back(i);
				A_pos.push_back(i + 1);
			}
		}
	}

	/*cout << "A_pos " << endl;
	for (int i = 0; i < A_pos.size(); ++i)
	{
		cout << A_pos[i] << " ";
	}
	cout << endl;

	cout << "B_pos " << endl;
	for (int i = 0; i < A_pos.size(); ++i)
	{
		cout << B_pos[i] << " ";
	}
	cout << endl;*/

	int cur = num;
	if(A_pos.size() > B_pos.size()){
		while(cur < n){
			int in_heap = 0;
			vector < int > v;
			v.push_back(0);
			for(int i = 1; i < A_pos.size() - 1; i++){
				v.push_back(cur);
				in_heap++;
				v.push_back(A_pos[i]);
				cur++;	
				if(cur == n){
					break;
				}	
			}
			v.push_back(A_pos[A_pos.size() - 1]);

			int resp = use_machine(v);
			ans += in_heap - resp/2;
		}
	}
	else{
		while(cur < n){
			vector < int > v;
			v.push_back(0);
			v.push_back(B_pos[0]);
			for(int i = 1; i < B_pos.size(); i++){
				v.push_back(cur);
				v.push_back(B_pos[i]);
				cur++;	
				if(cur == n){
					break;
				}	
			}
			int resp = use_machine(v);
			ans += (resp-1)/2;
		}
	}
	
	return ans + A_pos.size();
}

Compilation message

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

Subtask #1

79.8587 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	2 ms	364 KB	Output is correct
6	Correct	2 ms	364 KB	Output is correct
7	Correct	7 ms	384 KB	Output is correct
8	Correct	9 ms	364 KB	Output is correct
9	Correct	7 ms	364 KB	Output is correct
10	Partially correct	7 ms	364 KB	Output is partially correct
11	Partially correct	8 ms	364 KB	Output is partially correct
12	Partially correct	10 ms	364 KB	Output is partially correct
13	Correct	11 ms	364 KB	Output is correct
14	Correct	4 ms	364 KB	Output is correct
15	Partially correct	12 ms	364 KB	Output is partially correct
16	Partially correct	8 ms	364 KB	Output is partially correct
17	Correct	6 ms	364 KB	Output is correct
18	Correct	9 ms	364 KB	Output is correct
19	Partially correct	10 ms	364 KB	Output is partially correct
20	Partially correct	7 ms	364 KB	Output is partially correct
21	Partially correct	7 ms	364 KB	Output is partially correct
22	Partially correct	8 ms	384 KB	Output is partially correct
23	Partially correct	8 ms	364 KB	Output is partially correct
24	Correct	5 ms	364 KB	Output is correct
25	Partially correct	8 ms	364 KB	Output is partially correct
26	Partially correct	6 ms	388 KB	Output is partially correct
27	Partially correct	7 ms	388 KB	Output is partially correct
28	Partially correct	9 ms	364 KB	Output is partially correct
29	Partially correct	7 ms	388 KB	Output is partially correct
30	Partially correct	7 ms	364 KB	Output is partially correct
31	Partially correct	9 ms	364 KB	Output is partially correct
32	Partially correct	9 ms	364 KB	Output is partially correct
33	Partially correct	10 ms	364 KB	Output is partially correct
34	Partially correct	9 ms	364 KB	Output is partially correct
35	Partially correct	11 ms	364 KB	Output is partially correct
36	Partially correct	9 ms	364 KB	Output is partially correct
37	Partially correct	10 ms	364 KB	Output is partially correct
38	Partially correct	7 ms	388 KB	Output is partially correct
39	Partially correct	8 ms	364 KB	Output is partially correct
40	Partially correct	8 ms	364 KB	Output is partially correct
41	Partially correct	9 ms	364 KB	Output is partially correct
42	Partially correct	8 ms	364 KB	Output is partially correct
43	Partially correct	8 ms	364 KB	Output is partially correct
44	Partially correct	8 ms	364 KB	Output is partially correct
45	Partially correct	9 ms	364 KB	Output is partially correct
46	Partially correct	8 ms	364 KB	Output is partially correct
47	Partially correct	9 ms	364 KB	Output is partially correct
48	Partially correct	8 ms	364 KB	Output is partially correct
49	Partially correct	8 ms	364 KB	Output is partially correct
50	Partially correct	9 ms	364 KB	Output is partially correct
51	Partially correct	9 ms	364 KB	Output is partially correct
52	Partially correct	8 ms	364 KB	Output is partially correct
53	Partially correct	10 ms	364 KB	Output is partially correct
54	Partially correct	9 ms	364 KB	Output is partially correct
55	Partially correct	8 ms	364 KB	Output is partially correct
56	Partially correct	9 ms	364 KB	Output is partially correct
57	Partially correct	8 ms	364 KB	Output is partially correct
58	Partially correct	7 ms	388 KB	Output is partially correct
59	Partially correct	9 ms	364 KB	Output is partially correct
60	Partially correct	10 ms	364 KB	Output is partially correct
61	Partially correct	9 ms	364 KB	Output is partially correct
62	Correct	1 ms	364 KB	Output is correct
63	Correct	1 ms	364 KB	Output is correct
64	Correct	1 ms	364 KB	Output is correct
65	Correct	0 ms	364 KB	Output is correct
66	Correct	1 ms	364 KB	Output is correct
67	Correct	1 ms	364 KB	Output is correct
68	Correct	1 ms	364 KB	Output is correct
69	Correct	1 ms	364 KB	Output is correct
70	Correct	1 ms	364 KB	Output is correct
71	Correct	1 ms	364 KB	Output is correct
72	Correct	1 ms	364 KB	Output is correct
73	Correct	1 ms	384 KB	Output is correct
74	Correct	1 ms	364 KB	Output is correct
75	Correct	1 ms	364 KB	Output is correct
76	Correct	1 ms	364 KB	Output is correct
77	Correct	1 ms	364 KB	Output is correct
78	Correct	1 ms	364 KB	Output is correct
79	Correct	1 ms	364 KB	Output is correct
80	Correct	1 ms	364 KB	Output is correct
81	Correct	1 ms	364 KB	Output is correct
82	Correct	1 ms	364 KB	Output is correct
83	Correct	1 ms	364 KB	Output is correct
84	Correct	0 ms	364 KB	Output is correct
85	Correct	1 ms	364 KB	Output is correct
86	Correct	1 ms	364 KB	Output is correct
87	Correct	1 ms	364 KB	Output is correct
88	Correct	1 ms	384 KB	Output is correct
89	Correct	1 ms	384 KB	Output is correct
90	Correct	1 ms	364 KB	Output is correct
91	Correct	1 ms	364 KB	Output is correct