Submission #602068

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
602068	2022-07-22T14:28:21 Z	FatihSolak	Counting Mushrooms (IOI20_mushrooms)	C++17	92.623 / 100	10 ms	340 KB

mushrooms

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

int count_mushrooms(int n){
	vector<int> a,b;
	a.push_back(0);
	int point  = 1;
	int cur = 0;
	while(cur < 75 && n-point > max(a.size(),b.size()) ){
		if(max(a.size(),b.size()) == 1){
			if(use_machine({0,point})){
				b.push_back(point);
			}
			else a.push_back(point);
			point++;
		}
		else{
			if(a.size() > b.size()){
				vector<int> ask;
				ask.push_back(a[0]);
				ask.push_back(point++);
				ask.push_back(a[1]);
				ask.push_back(point++);
				int val = use_machine(ask);
				if(val < 2){
					a.push_back(ask[1]);
				}
				else{
					b.push_back(ask[1]);
				}
				if(val % 2 == 0){
					a.push_back(ask[3]);
				}
				else{
					b.push_back(ask[3]);
				}
			}
			else{
				vector<int> ask;
				ask.push_back(b[0]);
				ask.push_back(point++);
				ask.push_back(b[1]);
				ask.push_back(point++);
				int val = use_machine(ask);
				if(val < 2){
					b.push_back(ask[1]);
				}
				else{
					a.push_back(ask[1]);
				}
				if(val % 2 == 0){
					b.push_back(ask[3]);
				}
				else{
					a.push_back(ask[3]);
				}
			}
		}
		cur++;
	}
	int ret = a.size();
	while(point < n){
		int asz = a.size();
		int bsz = b.size();
		if(asz > bsz){
			vector<int> nums;
			int cnt = 0;
			for(int j = point;j<min(n,point + asz);j++){
				nums.push_back(a[cnt++]);
				nums.push_back(j);
			}
			int sz = nums.size()/2;
			int val = use_machine(nums);
			point += asz;
			if(val&1){
				b.push_back(point-1);
			}
			else a.push_back(point-1);
			ret += sz - (val + 1)/2;
		}
		else{
			vector<int> nums;
			int cnt = 0;
			for(int j = point;j<min(n,point + bsz);j++){
				nums.push_back(b[cnt++]);
				nums.push_back(j);
			}
			int sz = nums.size()/2;
			int val = use_machine(nums);
			point += bsz;
			if(val&1){
				a.push_back(point-1);
			}
			else b.push_back(point-1);
			ret += (val + 1)/2;
		}
	}
	return ret;
}

Compilation message

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:11:28: warning: comparison of integer expressions of different signedness: 'int' and 'const long unsigned int' [-Wsign-compare]
   11 |  while(cur < 75 && n-point > max(a.size(),b.size()) ){
      |                    ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
mushrooms.cpp:90:8: warning: unused variable 'sz' [-Wunused-variable]
   90 |    int sz = nums.size()/2;
      |        ^~

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