Submission #622771

# Submission time Handle Problem Language Result Execution time Memory
622771 2022-08-04T14:19:20 Z erekle Counting Mushrooms (IOI20_mushrooms) C++17
87.5969 / 100
17 ms 336 KB
#include "mushrooms.h"
#include <bits/stdc++.h>

using namespace std;

int count_mushrooms(int n) {
	int s = 141; // sqrt(20000)
	// ADD RANDOM_SHUFFLE LATER
	
	// find first 2s values pairwise
	vector<int> id[2]; // A, B
	id[0].push_back(0);
	vector<int> m;
	int last = min(2*s, n);
	for (int i = 1; i < last; ) {
		if (i+1 < last && (id[0].size() >= 2 || id[1].size() >= 2)) {
			int same = 0;
			if (id[0].size() < 2) same = 1;

			m = {id[same][0], i, id[same][1], i+1};
			int x = use_machine(m);
			if (x & 1) id[1-same].push_back(i+1);
			else id[same].push_back(i+1);
			if (x & 2) id[1-same].push_back(i);
			else id[same].push_back(i);
			i += 2;
		} else {
			m = {0, i};
			if (use_machine(m)) id[1].push_back(i);
			else id[0].push_back(i);
			i++;
		}
	}

	// find the rest of the values as blocks of s
	int A = id[0].size();
	for (int i = last; i < n; ) {
		int big = (id[1].size() > id[0].size() ? 1 : 0);
		int cnt = min((int)id[big].size(), n-i);
		m.clear();
		for (int j = 0; j < cnt; ++j) {
			m.push_back(i+j);
			m.push_back(id[big][j]);
		}
		int x = use_machine(m);
		if (x & 1) {
			id[1-big].push_back(i);
			++x;
		} else id[big].push_back(i);
		x /= 2;
		if (big == 0) x = cnt-x;
		A += x;
		i += cnt;
	}
	return A;
}
# 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 208 KB Output is correct
6 Correct 3 ms 208 KB Output is correct
7 Correct 6 ms 208 KB Output is correct
8 Correct 8 ms 208 KB Output is correct
9 Correct 8 ms 308 KB Output is correct
10 Partially correct 9 ms 208 KB Output is partially correct
11 Partially correct 8 ms 208 KB Output is partially correct
12 Partially correct 6 ms 208 KB Output is partially correct
13 Correct 6 ms 208 KB Output is correct
14 Correct 5 ms 304 KB Output is correct
15 Partially correct 6 ms 208 KB Output is partially correct
16 Partially correct 8 ms 208 KB Output is partially correct
17 Correct 4 ms 208 KB Output is correct
18 Correct 6 ms 208 KB Output is correct
19 Partially correct 6 ms 208 KB Output is partially correct
20 Partially correct 8 ms 208 KB Output is partially correct
21 Partially correct 9 ms 308 KB Output is partially correct
22 Partially correct 6 ms 208 KB Output is partially correct
23 Correct 8 ms 208 KB Output is correct
24 Correct 5 ms 336 KB Output is correct
25 Partially correct 7 ms 208 KB Output is partially correct
26 Partially correct 8 ms 208 KB Output is partially correct
27 Partially correct 8 ms 208 KB Output is partially correct
28 Partially correct 6 ms 208 KB Output is partially correct
29 Partially correct 17 ms 208 KB Output is partially correct
30 Partially correct 5 ms 316 KB Output is partially correct
31 Partially correct 8 ms 312 KB Output is partially correct
32 Partially correct 9 ms 208 KB Output is partially correct
33 Partially correct 8 ms 208 KB Output is partially correct
34 Partially correct 7 ms 208 KB Output is partially correct
35 Partially correct 6 ms 208 KB Output is partially correct
36 Partially correct 6 ms 312 KB Output is partially correct
37 Partially correct 6 ms 316 KB Output is partially correct
38 Partially correct 6 ms 208 KB Output is partially correct
39 Partially correct 9 ms 208 KB Output is partially correct
40 Partially correct 6 ms 208 KB Output is partially correct
41 Partially correct 8 ms 208 KB Output is partially correct
42 Partially correct 9 ms 312 KB Output is partially correct
43 Partially correct 8 ms 312 KB Output is partially correct
44 Partially correct 5 ms 308 KB Output is partially correct
45 Partially correct 5 ms 312 KB Output is partially correct
46 Partially correct 8 ms 308 KB Output is partially correct
47 Partially correct 8 ms 208 KB Output is partially correct
48 Partially correct 6 ms 208 KB Output is partially correct
49 Partially correct 8 ms 208 KB Output is partially correct
50 Partially correct 6 ms 208 KB Output is partially correct
51 Partially correct 7 ms 208 KB Output is partially correct
52 Partially correct 9 ms 208 KB Output is partially correct
53 Partially correct 10 ms 208 KB Output is partially correct
54 Partially correct 7 ms 208 KB Output is partially correct
55 Partially correct 6 ms 308 KB Output is partially correct
56 Partially correct 9 ms 208 KB Output is partially correct
57 Partially correct 7 ms 208 KB Output is partially correct
58 Partially correct 6 ms 208 KB Output is partially correct
59 Partially correct 10 ms 208 KB Output is partially correct
60 Partially correct 8 ms 308 KB Output is partially correct
61 Partially correct 7 ms 308 KB Output is partially correct
62 Correct 2 ms 208 KB Output is correct
63 Correct 1 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 1 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 1 ms 208 KB Output is correct
74 Correct 0 ms 208 KB Output is correct
75 Correct 1 ms 228 KB Output is correct
76 Correct 0 ms 208 KB Output is correct
77 Correct 1 ms 208 KB Output is correct
78 Correct 1 ms 256 KB Output is correct
79 Correct 0 ms 208 KB Output is correct
80 Correct 0 ms 208 KB Output is correct
81 Correct 1 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 1 ms 208 KB Output is correct
85 Correct 1 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 1 ms 208 KB Output is correct
91 Correct 0 ms 208 KB Output is correct