Submission #828367

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
828367	2023-08-17T08:57:32 Z	tomruk	Counting Mushrooms (IOI20_mushrooms)	C++17	92.623 / 100	7 ms	440 KB

mushrooms

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

int count_mushrooms(int n) {
	vector<int> a = {0},b;
	int last = 1;
	while(last < n && max(a.size(),b.size()) < 90){
		if(last  + 1 == n || max(a.size(),b.size()) == 1){
			int num = use_machine({0,last});
			if(num == 0)
				a.push_back(last);
			else b.push_back(last);
			last++;
		}
		else{
			if(a.size() > b.size()){
				int num = use_machine({last,a[0],last+1,a[1]});
				if(num & 1){
					b.push_back(last);
				}
				else a.push_back(last);
				if(num & 2){
					b.push_back(last + 1);
				}
				else a.push_back(last + 1);
				last+=2;
			}
			else{
				int num = use_machine({last,b[0],last+1,b[1]});
				if(num & 1){
					a.push_back(last);
				}
				else b.push_back(last);
				if(num & 2){
					a.push_back(last + 1);
				}
				else b.push_back(last + 1);
				last+=2;
			}
		}
	}
	int ca = 0,cb = 0;
	while(last < n){
		if(a.size() > b.size()){
			int cnt = 0;
			vector<int> ask;
			while(cnt < a.size() && last < n){
				ask.push_back(last);
				ask.push_back(a[cnt]);
				cnt++;
				last++;
			}
			int num = use_machine(ask);
			ca += cnt;
			ca -= num/2;
			ca -= num&1;
			if(num & 1){
				b.push_back(last - cnt);
			}
			else{
				a.push_back(last - cnt);
				ca--;
			}
		}
		else{
			int cnt = 0;
			vector<int> ask;
			while(cnt < b.size() && last < n){
				ask.push_back(last);
				ask.push_back(b[cnt]);
				cnt++;
				last++;
			}
			int num = use_machine(ask);
			ca += num/2;
			ca += num&1;
			if(num & 1){
				a.push_back(last - cnt);
				ca--;
			}
			else b.push_back(last - cnt);
		}
	}
	return a.size() + ca;
}

Compilation message

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:48:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |    while(cnt < a.size() && last < n){
      |          ~~~~^~~~~~~~~~
mushrooms.cpp:69:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |    while(cnt < b.size() && last < n){
      |          ~~~~^~~~~~~~~~
mushrooms.cpp:43:13: warning: unused variable 'cb' [-Wunused-variable]
   43 |  int ca = 0,cb = 0;
      |             ^~

Subtask #1

92.623 / 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	0 ms	208 KB	Output is correct
5	Correct	1 ms	308 KB	Output is correct
6	Correct	1 ms	208 KB	Output is correct
7	Correct	5 ms	320 KB	Output is correct
8	Correct	6 ms	208 KB	Output is correct
9	Correct	4 ms	208 KB	Output is correct
10	Correct	6 ms	208 KB	Output is correct
11	Partially correct	7 ms	208 KB	Output is partially correct
12	Correct	7 ms	208 KB	Output is correct
13	Correct	5 ms	208 KB	Output is correct
14	Correct	4 ms	208 KB	Output is correct
15	Partially correct	5 ms	208 KB	Output is partially correct
16	Partially correct	5 ms	308 KB	Output is partially correct
17	Correct	3 ms	308 KB	Output is correct
18	Correct	6 ms	208 KB	Output is correct
19	Partially correct	5 ms	312 KB	Output is partially correct
20	Correct	6 ms	312 KB	Output is correct
21	Correct	6 ms	208 KB	Output is correct
22	Partially correct	6 ms	324 KB	Output is partially correct
23	Correct	5 ms	208 KB	Output is correct
24	Correct	3 ms	208 KB	Output is correct
25	Partially correct	5 ms	320 KB	Output is partially correct
26	Partially correct	5 ms	208 KB	Output is partially correct
27	Partially correct	6 ms	320 KB	Output is partially correct
28	Partially correct	5 ms	328 KB	Output is partially correct
29	Partially correct	5 ms	312 KB	Output is partially correct
30	Partially correct	6 ms	308 KB	Output is partially correct
31	Partially correct	4 ms	320 KB	Output is partially correct
32	Partially correct	5 ms	316 KB	Output is partially correct
33	Partially correct	5 ms	344 KB	Output is partially correct
34	Partially correct	5 ms	208 KB	Output is partially correct
35	Partially correct	5 ms	320 KB	Output is partially correct
36	Partially correct	5 ms	208 KB	Output is partially correct
37	Partially correct	5 ms	328 KB	Output is partially correct
38	Partially correct	5 ms	208 KB	Output is partially correct
39	Partially correct	7 ms	324 KB	Output is partially correct
40	Partially correct	5 ms	336 KB	Output is partially correct
41	Partially correct	5 ms	208 KB	Output is partially correct
42	Partially correct	5 ms	316 KB	Output is partially correct
43	Partially correct	6 ms	440 KB	Output is partially correct
44	Partially correct	5 ms	208 KB	Output is partially correct
45	Partially correct	6 ms	316 KB	Output is partially correct
46	Partially correct	5 ms	208 KB	Output is partially correct
47	Partially correct	6 ms	308 KB	Output is partially correct
48	Partially correct	6 ms	320 KB	Output is partially correct
49	Partially correct	7 ms	312 KB	Output is partially correct
50	Partially correct	6 ms	320 KB	Output is partially correct
51	Partially correct	6 ms	208 KB	Output is partially correct
52	Partially correct	5 ms	208 KB	Output is partially correct
53	Partially correct	6 ms	208 KB	Output is partially correct
54	Partially correct	5 ms	312 KB	Output is partially correct
55	Partially correct	5 ms	304 KB	Output is partially correct
56	Partially correct	6 ms	208 KB	Output is partially correct
57	Partially correct	6 ms	208 KB	Output is partially correct
58	Partially correct	5 ms	208 KB	Output is partially correct
59	Partially correct	5 ms	208 KB	Output is partially correct
60	Partially correct	5 ms	304 KB	Output is partially correct
61	Partially correct	5 ms	304 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	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	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	1 ms	208 KB	Output is correct