Submission #346232

# Submission time Handle Problem Language Result Execution time Memory
346232 2021-01-09T07:38:52 Z Chayanin_K Counting Mushrooms (IOI20_mushrooms) C++14
92.623 / 100
12 ms 492 KB
#include "mushrooms.h"
#include <bits/stdc++.h>
 
using namespace std;
 
/// 0 = Type A, 1 = Type B

vector <int> vec[2]; 
 
int count_mushrooms(int n) 
{
	if(n<3){
		return 2-use_machine({0, 1});
	}
	else{
		vec[0].push_back(0);
		vec[use_machine({0, 1})].push_back(1);
		vec[use_machine({0, 2})].push_back(2);
		int cnta = vec[0].size();
		for(int i = 3; i < n; ){
			int use;/// use A or B

			if(vec[0].size() >= vec[1].size())
				use = 0;
			else 
				use = 1;

			vector <int> query;

			int l;

			if(vec[use].size() > 85) 
				l = n; /// GATHER MORE MUSHROOMS
			else 
				l = min(n, i + 2);

			for(auto it = vec[use].begin(); i < l && it!=vec[use].end(); i++, it++){
				query.push_back(*it);
				query.push_back(i);
			}

			int ans = use_machine(query);

			if(query.size()==4){
				if(ans>1) 
					vec[!use].push_back(query[1]);
				else
					vec[use].push_back(query[1]);
			}
			if(ans%2==0)
				vec[use].push_back(i-1); // last one is same
			else
				vec[!use].push_back(i-1); // last one is NOT same
			if(use==0) 
				cnta += (query.size() - ans) / 2;
			else 
				cnta += (ans + 1) / 2;
		}
		return cnta;
	}
}
# Verdict Execution time Memory Grader output
1 Correct 0 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 1 ms 364 KB Output is correct
6 Correct 3 ms 364 KB Output is correct
7 Correct 7 ms 364 KB Output is correct
8 Correct 7 ms 364 KB Output is correct
9 Correct 8 ms 364 KB Output is correct
10 Correct 9 ms 364 KB Output is correct
11 Partially correct 7 ms 364 KB Output is partially correct
12 Correct 7 ms 364 KB Output is correct
13 Correct 7 ms 364 KB Output is correct
14 Correct 5 ms 364 KB Output is correct
15 Partially correct 8 ms 364 KB Output is partially correct
16 Partially correct 7 ms 364 KB Output is partially correct
17 Correct 4 ms 364 KB Output is correct
18 Correct 8 ms 364 KB Output is correct
19 Partially correct 8 ms 364 KB Output is partially correct
20 Correct 7 ms 364 KB Output is correct
21 Correct 7 ms 364 KB Output is correct
22 Partially correct 8 ms 364 KB Output is partially correct
23 Correct 7 ms 364 KB Output is correct
24 Correct 5 ms 364 KB Output is correct
25 Partially correct 8 ms 364 KB Output is partially correct
26 Partially correct 7 ms 408 KB Output is partially correct
27 Partially correct 9 ms 384 KB Output is partially correct
28 Partially correct 7 ms 364 KB Output is partially correct
29 Partially correct 7 ms 364 KB Output is partially correct
30 Partially correct 8 ms 364 KB Output is partially correct
31 Partially correct 7 ms 364 KB Output is partially correct
32 Partially correct 7 ms 364 KB Output is partially correct
33 Partially correct 7 ms 364 KB Output is partially correct
34 Partially correct 7 ms 492 KB Output is partially correct
35 Partially correct 7 ms 364 KB Output is partially correct
36 Partially correct 7 ms 364 KB Output is partially correct
37 Partially correct 8 ms 364 KB Output is partially correct
38 Partially correct 7 ms 364 KB Output is partially correct
39 Partially correct 7 ms 364 KB Output is partially correct
40 Partially correct 8 ms 364 KB Output is partially correct
41 Partially correct 7 ms 364 KB Output is partially correct
42 Partially correct 7 ms 364 KB Output is partially correct
43 Partially correct 8 ms 364 KB Output is partially correct
44 Partially correct 7 ms 364 KB Output is partially correct
45 Partially correct 10 ms 492 KB Output is partially correct
46 Partially correct 7 ms 364 KB Output is partially correct
47 Partially correct 7 ms 364 KB Output is partially correct
48 Partially correct 8 ms 364 KB Output is partially correct
49 Partially correct 9 ms 364 KB Output is partially correct
50 Partially correct 7 ms 364 KB Output is partially correct
51 Partially correct 8 ms 364 KB Output is partially correct
52 Partially correct 9 ms 364 KB Output is partially correct
53 Partially correct 9 ms 364 KB Output is partially correct
54 Partially correct 9 ms 364 KB Output is partially correct
55 Partially correct 9 ms 364 KB Output is partially correct
56 Partially correct 12 ms 396 KB Output is partially correct
57 Partially correct 7 ms 364 KB Output is partially correct
58 Partially correct 7 ms 364 KB Output is partially correct
59 Partially correct 9 ms 364 KB Output is partially correct
60 Partially correct 7 ms 364 KB Output is partially correct
61 Partially correct 8 ms 396 KB Output is partially correct
62 Correct 1 ms 364 KB Output is correct
63 Correct 0 ms 364 KB Output is correct
64 Correct 0 ms 364 KB Output is correct
65 Correct 1 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 0 ms 364 KB Output is correct
69 Correct 0 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 364 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 0 ms 364 KB Output is correct
84 Correct 1 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 364 KB Output is correct
89 Correct 1 ms 364 KB Output is correct
90 Correct 1 ms 364 KB Output is correct
91 Correct 0 ms 364 KB Output is correct