oj.uz

Submission #306145

# Submission time Handle Problem Language Result Execution time Memory
306145 2020-09-24T16:14:40 Z lolicon Counting Mushrooms (IOI20_mushrooms) C++14
10 / 100
 259 ms 572 KB 
#include <bits/stdc++.h>
#include "mushrooms.h"
using namespace std;

int count_mushrooms(int n) {
	int cnt = 0;
	if(n <= 200) {
		int ret = 1;
		vector<int> m(2);
		for(int i = 1; i < n; i++) {
			m[1] = i;
			if(use_machine(m) == 0) ret++; 
		}
		return ret;	
	}
	int k = min((int)sqrt(n), 2);

	
	vector<int> arr(n, 0);
	for(int i = 1; i < 2 * k; i++) {
		vector<int> m;
		m.push_back(0);
		m.push_back(i);
		if(use_machine(m)) {
			arr[i] = 1; cnt++;
		}
	} 
	int ret = 2 * k - cnt;
	if(cnt >= k) { // 1 is more
		vector<int> keep;
		for(int i = 0; i < 2 * k; i++) {
			if(arr[i] == 1) keep.push_back(i);
		}
		int block = (int)keep.size() - 1;
		assert(block > 0);
		for(int i = 2 * k; i < n; i += block) {
			vector<int> ask;
			ask.push_back(keep[0]);
			for(int j = 0, k = 1; j + i < n && j < block; j++) {
				ask.push_back(j + i);
				ask.push_back(keep[k]); k++;
			}
			ret += use_machine(ask) / 2;
		}
	}
	else { // 0 is more
		vector<int> keep;
		for(int i = 0; i < 2 * k; i++) {
			if(arr[i] == 0) keep.push_back(i);
		}
		int block = (int)keep.size() - 1;
		assert(block > 0);
		for(int i = 2 * k; i < n; i += block) {
			vector<int> ask;
			ask.push_back(0);
			for(int j = 0, k = 1; j + i < n && j < block; j++) {
				ask.push_back(j + i);
				ask.push_back(keep[k]); k++;
			}
			ret += ((int)ask.size() / 2) - use_machine(ask) / 2;
		}
	}
	// [0, 2 * k)
	return ret;
}

Subtask #1
10.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Partially correct 15 ms 256 KB Output is partially correct
7 Partially correct 55 ms 384 KB Output is partially correct
8 Partially correct 68 ms 384 KB Output is partially correct
9 Partially correct 102 ms 384 KB Output is partially correct
10 Partially correct 217 ms 384 KB Output is partially correct
11 Partially correct 90 ms 384 KB Output is partially correct
12 Partially correct 109 ms 448 KB Output is partially correct
13 Partially correct 128 ms 384 KB Output is partially correct
14 Partially correct 44 ms 384 KB Output is partially correct
15 Partially correct 197 ms 504 KB Output is partially correct
16 Partially correct 102 ms 384 KB Output is partially correct
17 Partially correct 128 ms 384 KB Output is partially correct
18 Partially correct 95 ms 384 KB Output is partially correct
19 Partially correct 88 ms 460 KB Output is partially correct
20 Partially correct 70 ms 504 KB Output is partially correct
21 Partially correct 99 ms 504 KB Output is partially correct
22 Partially correct 100 ms 448 KB Output is partially correct
23 Partially correct 202 ms 448 KB Output is partially correct
24 Partially correct 56 ms 384 KB Output is partially correct
25 Partially correct 179 ms 444 KB Output is partially correct
26 Partially correct 202 ms 384 KB Output is partially correct
27 Partially correct 182 ms 504 KB Output is partially correct
28 Partially correct 212 ms 448 KB Output is partially correct
29 Partially correct 170 ms 444 KB Output is partially correct
30 Partially correct 164 ms 444 KB Output is partially correct
31 Partially correct 211 ms 448 KB Output is partially correct
32 Partially correct 204 ms 444 KB Output is partially correct
33 Partially correct 190 ms 504 KB Output is partially correct
34 Partially correct 162 ms 504 KB Output is partially correct
35 Partially correct 187 ms 384 KB Output is partially correct
36 Partially correct 185 ms 504 KB Output is partially correct
37 Partially correct 173 ms 504 KB Output is partially correct
38 Partially correct 191 ms 384 KB Output is partially correct
39 Partially correct 213 ms 448 KB Output is partially correct
40 Partially correct 183 ms 384 KB Output is partially correct
41 Partially correct 186 ms 452 KB Output is partially correct
42 Partially correct 222 ms 384 KB Output is partially correct
43 Partially correct 259 ms 448 KB Output is partially correct
44 Partially correct 182 ms 384 KB Output is partially correct
45 Partially correct 243 ms 504 KB Output is partially correct
46 Partially correct 211 ms 504 KB Output is partially correct
47 Partially correct 127 ms 384 KB Output is partially correct
48 Partially correct 257 ms 384 KB Output is partially correct
49 Partially correct 136 ms 384 KB Output is partially correct
50 Partially correct 194 ms 384 KB Output is partially correct
51 Partially correct 134 ms 384 KB Output is partially correct
52 Partially correct 190 ms 384 KB Output is partially correct
53 Partially correct 167 ms 572 KB Output is partially correct
54 Partially correct 201 ms 504 KB Output is partially correct
55 Partially correct 164 ms 444 KB Output is partially correct
56 Partially correct 164 ms 504 KB Output is partially correct
57 Partially correct 148 ms 448 KB Output is partially correct
58 Partially correct 207 ms 384 KB Output is partially correct
59 Partially correct 179 ms 444 KB Output is partially correct
60 Partially correct 200 ms 504 KB Output is partially correct
61 Partially correct 192 ms 384 KB Output is partially correct
62 Correct 1 ms 256 KB Output is correct
63 Correct 0 ms 256 KB Output is correct
64 Correct 1 ms 256 KB Output is correct
65 Correct 0 ms 256 KB Output is correct
66 Correct 1 ms 256 KB Output is correct
67 Correct 0 ms 256 KB Output is correct
68 Correct 1 ms 256 KB Output is correct
69 Correct 1 ms 256 KB Output is correct
70 Correct 1 ms 256 KB Output is correct
71 Correct 1 ms 256 KB Output is correct
72 Correct 1 ms 256 KB Output is correct
73 Correct 0 ms 256 KB Output is correct
74 Correct 1 ms 256 KB Output is correct
75 Correct 1 ms 256 KB Output is correct
76 Correct 1 ms 256 KB Output is correct
77 Correct 1 ms 256 KB Output is correct
78 Correct 1 ms 256 KB Output is correct
79 Correct 1 ms 256 KB Output is correct
80 Correct 1 ms 256 KB Output is correct
81 Correct 0 ms 256 KB Output is correct
82 Correct 0 ms 256 KB Output is correct
83 Correct 0 ms 256 KB Output is correct
84 Correct 0 ms 256 KB Output is correct
85 Correct 0 ms 256 KB Output is correct
86 Correct 1 ms 256 KB Output is correct
87 Correct 1 ms 256 KB Output is correct
88 Correct 1 ms 256 KB Output is correct
89 Correct 0 ms 256 KB Output is correct
90 Correct 1 ms 256 KB Output is correct
91 Correct 1 ms 256 KB Output is correct