Submission #959390

# Submission time Handle Problem Language Result Execution time Memory
959390 2024-04-08T06:41:12 Z The_Samurai Counting Mushrooms (IOI20_mushrooms) C++17
26.7139 / 100
10 ms 712 KB
#include "mushrooms.h"
#include "bits/stdc++.h"
using namespace std;
 
int count_mushrooms(int n) {
	vector<int> zeros = {0};
	const int cnt = 46, b = 700;
	for (int l = 1, r = b; l < n and zeros.size() < cnt; l += b, r += b) {
		r = min(r, n - 1);
		vector<int> v = {0};
		for (int i = l; i <= r; i++) v.emplace_back(i);
		int x = use_machine(v);
		if (x == 0) {
			for (int i = l; i <= r; i++) zeros.emplace_back(i);
			continue;
		}
		if (x == 1) {
			for (int i = l; i <= r; i++) {
				if (use_machine({0, i})) break;
				zeros.emplace_back(i);
			}
			continue;
		}
		while (zeros.size() < cnt) {
			if (zeros.back() + 1 > r) break;
			int lx = max(l, zeros.back() + 1), rx = r, best = -1;
			int start = max(l, zeros.back() + 1);
			bool found = false;
			if (use_machine({0, lx}) == 0) {
				zeros.emplace_back(lx);
				continue;
			}
			lx++;
			// cout << lx << ' ' << rx << endl;
			while (lx <= rx) {
				int mid = (lx + rx) >> 1;
				v = {0};
				for (int i = start; i <= mid; i++) v.emplace_back(i);
				x = use_machine(v);
				// cout << '\t' << mid << ' ' << x << endl;
				if (x >= 2) {
					rx = mid - 1;
					best = mid;
				} else if (x == 0) {
					for (int i = start; i <= mid; i++) zeros.emplace_back(i);
					found = true;
					break;
				} else {
					lx = mid + 1;
				}
			}
			if (found) continue;
			if (best == -1) break;
			zeros.emplace_back(best);
		}
	}
	// for (int x: zeros) cout << x << ' ';
	// cout << endl;
	if (zeros.size() < cnt) return zeros.size();
	vector<int> unused;
	for (int i = zeros.back() + 1; i < n; i++) unused.emplace_back(i);
	int ans = zeros.size();
	while (!unused.empty()) {
		int ln = min(unused.size(), zeros.size());
		vector<int> v;
		for (int i = 0; i < ln; i++) {
			v.emplace_back(zeros[i]);
			v.emplace_back(unused.back());
			unused.pop_back();
		}
		ans += ln - (use_machine(v) + 1) / 2;
	}
	return ans;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Partially correct 2 ms 444 KB Output is partially correct
6 Partially correct 3 ms 460 KB Output is partially correct
7 Correct 3 ms 672 KB Output is correct
8 Partially correct 6 ms 460 KB Output is partially correct
9 Partially correct 6 ms 464 KB Output is partially correct
10 Partially correct 8 ms 452 KB Output is partially correct
11 Partially correct 8 ms 496 KB Output is partially correct
12 Partially correct 8 ms 460 KB Output is partially correct
13 Partially correct 8 ms 476 KB Output is partially correct
14 Partially correct 5 ms 556 KB Output is partially correct
15 Partially correct 8 ms 456 KB Output is partially correct
16 Partially correct 8 ms 452 KB Output is partially correct
17 Partially correct 6 ms 564 KB Output is partially correct
18 Partially correct 10 ms 472 KB Output is partially correct
19 Partially correct 8 ms 456 KB Output is partially correct
20 Partially correct 6 ms 452 KB Output is partially correct
21 Partially correct 9 ms 460 KB Output is partially correct
22 Partially correct 7 ms 704 KB Output is partially correct
23 Partially correct 6 ms 452 KB Output is partially correct
24 Partially correct 5 ms 560 KB Output is partially correct
25 Partially correct 8 ms 456 KB Output is partially correct
26 Partially correct 9 ms 452 KB Output is partially correct
27 Partially correct 7 ms 460 KB Output is partially correct
28 Partially correct 9 ms 712 KB Output is partially correct
29 Partially correct 9 ms 452 KB Output is partially correct
30 Partially correct 9 ms 588 KB Output is partially correct
31 Partially correct 7 ms 460 KB Output is partially correct
32 Partially correct 7 ms 460 KB Output is partially correct
33 Partially correct 9 ms 464 KB Output is partially correct
34 Partially correct 9 ms 452 KB Output is partially correct
35 Partially correct 7 ms 456 KB Output is partially correct
36 Partially correct 7 ms 456 KB Output is partially correct
37 Partially correct 9 ms 460 KB Output is partially correct
38 Partially correct 8 ms 460 KB Output is partially correct
39 Partially correct 7 ms 456 KB Output is partially correct
40 Partially correct 7 ms 452 KB Output is partially correct
41 Partially correct 8 ms 460 KB Output is partially correct
42 Partially correct 9 ms 452 KB Output is partially correct
43 Partially correct 8 ms 460 KB Output is partially correct
44 Partially correct 8 ms 456 KB Output is partially correct
45 Partially correct 7 ms 452 KB Output is partially correct
46 Partially correct 7 ms 460 KB Output is partially correct
47 Partially correct 6 ms 460 KB Output is partially correct
48 Partially correct 8 ms 456 KB Output is partially correct
49 Partially correct 8 ms 460 KB Output is partially correct
50 Partially correct 10 ms 612 KB Output is partially correct
51 Partially correct 9 ms 584 KB Output is partially correct
52 Partially correct 9 ms 456 KB Output is partially correct
53 Partially correct 8 ms 452 KB Output is partially correct
54 Partially correct 10 ms 456 KB Output is partially correct
55 Partially correct 8 ms 460 KB Output is partially correct
56 Partially correct 8 ms 456 KB Output is partially correct
57 Partially correct 8 ms 600 KB Output is partially correct
58 Partially correct 9 ms 452 KB Output is partially correct
59 Partially correct 8 ms 456 KB Output is partially correct
60 Partially correct 7 ms 708 KB Output is partially correct
61 Partially correct 7 ms 452 KB Output is partially correct
62 Correct 1 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 1 ms 344 KB Output is correct
66 Correct 0 ms 344 KB Output is correct
67 Correct 1 ms 344 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 1 ms 344 KB Output is correct
74 Correct 1 ms 344 KB Output is correct
75 Correct 0 ms 344 KB Output is correct
76 Correct 1 ms 344 KB Output is correct
77 Correct 1 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 1 ms 344 KB Output is correct
82 Correct 0 ms 344 KB Output is correct
83 Correct 1 ms 344 KB Output is correct
84 Correct 0 ms 344 KB Output is correct
85 Correct 1 ms 344 KB Output is correct
86 Correct 1 ms 344 KB Output is correct
87 Correct 1 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