Submission #1052229

# Submission time Handle Problem Language Result Execution time Memory
1052229 2024-08-10T12:36:22 Z MercubytheFirst Counting Mushrooms (IOI20_mushrooms) C++17
56.927 / 100
6 ms 600 KB
#include "mushrooms.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;


template <typename T>
ostream& operator<<(ostream& os, const vector<T>& VEC) {
	os << "[";
	for(const auto& X : VEC) {
		os << X << " ";
	}
	os << "]";
	return os;
}

constexpr int block = 100;
int count_mushrooms(int n) {
	vector<vector<int> > g(2);
	g[0].push_back(0);
	int cur = 1;
	while(max(g[0].size(), g[1].size()) < block and cur < n) {
		g[use_machine({0, cur})].push_back(cur);
		cur++;
	}
	const int b = (g[0].size() >= g[1].size() ? 0 : 1);
	// cout << "chose : " << b << endl;
	assert(g[b].size() == block or cur >= n);
	int ans = g[0].size();
	while(cur < n) {
		vector<int> query;
		for(int i = 0; i < block and cur < n; ++i) {
			query.push_back(g[b][i]);
			query.push_back(cur);
			cur += 1;
		}
		int x = use_machine(query);
		// cout << x << " : " << query << endl;
		if(b == 0) {
			ans += (query.size() / 2u) - x/2 - x%2;
		}
		else {
			ans += x/2 + x%2;
		}
	}
	return ans;
}

/*
8
0 1 2 3 4 5 6 7 8 9 
A B B A B A A A
0 1 1 0 1 0 0 0 0 1 1 0 1 0 

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