oj.uz

Submission #430478

# Submission time Handle Problem Language Result Execution time Memory
430478 2021-06-16T14:27:43 Z amoo_safar Counting Mushrooms (IOI20_mushrooms) C++17
92.623 / 100
 11 ms 432 KB 
#include "mushrooms.h"
#include <bits/stdc++.h>

#define F first
#define S second
#define pb push_back
#define all(x) x.begin(), x.end()

using namespace std;


int count_mushrooms(int n) {
	if(n == 2)
		return 2 - use_machine({0, 1});

	vector<int> A[2];
	A[0].pb(0);

	int res = use_machine({0, 1});
	int x = 2;

	if(res){
		A[1].pb(1);
		res = use_machine({0, 2});
		x = 3;
		if(res) A[1].pb(2);
		else A[0].pb(2);
	} else A[0].pb(1);
	
	vector<int> rem;
	int lim = 69;
	for(int _ = 0; _ < lim; _ ++){
		if(x + 1 >= n) break;
		int id = 1;
		if(A[0].size() >= A[1].size()) id = 0;
		int r1 = x, r2 = x + 1; x += 2;
		res = use_machine({ r1, A[id][0], r2, A[id][1]});
		A[id ^ (res & 1)].pb(r1);
		A[id ^ (res >>1)].pb(r2);
	}
	vector<int> c(2, 0);

	while(x < n){
		int id = 1;
		if(A[0].size() >= A[1].size()) id = 0;
		int mx = A[id].size();
		int dl = min(mx, n - x);
		vector<int> ASK;
		for(int j = 0; j < dl; j++){
			ASK.pb(x + j);
			ASK.pb(A[id][j]);
		}
		res = use_machine(ASK);
		int mid = dl - 1;
		A[id ^ (res & 1)].pb(x);
		c[id ^ 1] += res / 2;
		c[id] += (mid - (res / 2)); 
		x += dl;
	}
	return c[0] + A[0].size();
}

Subtask #1
92.623 / 100.0

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