oj.uz

Submission #1035388

# Submission time Handle Problem Language Result Execution time Memory
1035388 2024-07-26T10:10:05 Z Gray Counting Mushrooms (IOI20_mushrooms) C++17
75.5853 / 100
 6 ms 600 KB 
#include "mushrooms.h"

#define ff first
#define ss second
#define ll int
#define ln "\n"

using namespace std;

int qry=200;

int count_mushrooms(int n) {
	std::vector<int> query;
	vector<int> as, bs;
	as.push_back(0);

	for (ll i=1; i<=min(2, n-1); i++){
		query = {0, int(i)};
		ll ret = use_machine(query);
		if (ret==0) as.push_back(i);
		else bs.push_back(i);
	}
	for (ll i=3; i<min(qry+1, n); i+=2){
		if (i+1<min(qry+1, n)){
			if (as.size()>bs.size()){
				query = {i, as[0], i+1, as[1]};
				ll ret = use_machine(query);
				if (ret==0){
					as.push_back(i);
					as.push_back(i+1);
				}else if (ret==1){
					as.push_back(i+1);
					bs.push_back(i);
				}else if (ret==2){
					as.push_back(i);
					bs.push_back(i+1);
				}else{
					bs.push_back(i);
					bs.push_back(i+1);
				}
			}else{
				query = {i, bs[0], i+1, bs[1]};
				ll ret = use_machine(query);
				if (ret==0){
					bs.push_back(i);
					bs.push_back(i+1);
				}else if (ret==1){
					bs.push_back(i+1);
					as.push_back(i);
				}else if (ret==2){
					bs.push_back(i);
					as.push_back(i+1);
				}else{
					as.push_back(i);
					as.push_back(i+1);
				}
			}
		}else{
			query = {0, (int)i};
			ll ret = use_machine(query);
			if (ret==0) as.push_back(i);
			else bs.push_back(i);
		}
	}
	


	ll ans=(ll)as.size();
	if (as.size()>bs.size()){
		for (ll i=min(qry+1, n); i<n; i+=as.size()-1){
			query.clear();
			for (ll j=0; j<(ll)as.size()-1 and i+j<n; j++){
				query.push_back(as[j]);
				query.push_back(i+j);
			}
			query.push_back(as.back());
			ll ret = use_machine(query)/2ll;
			ans+=(query.size()-1)/2-ret;
		}
	}else{
		for (ll i=min(qry+1, n); i<n; i+=bs.size()-1){
			query.clear();
			for (ll j=0; j<(ll)bs.size()-1 and i+j<n; j++){
				query.push_back(bs[j]);
				query.push_back(i+j);
			}
			query.push_back(bs.back());
			ll ret = use_machine(query)/2ll;
			ans+=ret;
		}
	}
	return ans;
}

Subtask #1
75.5853 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 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 600 KB Output is correct
7 Correct 3 ms 344 KB Output is correct
8 Correct 3 ms 344 KB Output is correct
9 Correct 3 ms 344 KB Output is correct
10 Partially correct 6 ms 344 KB Output is partially correct
11 Partially correct 3 ms 368 KB Output is partially correct
12 Partially correct 5 ms 344 KB Output is partially correct
13 Correct 3 ms 344 KB Output is correct
14 Correct 2 ms 344 KB Output is correct
15 Partially correct 3 ms 344 KB Output is partially correct
16 Partially correct 4 ms 344 KB Output is partially correct
17 Correct 2 ms 344 KB Output is correct
18 Correct 3 ms 344 KB Output is correct
19 Partially correct 4 ms 344 KB Output is partially correct
20 Partially correct 3 ms 344 KB Output is partially correct
21 Partially correct 3 ms 344 KB Output is partially correct
22 Partially correct 4 ms 344 KB Output is partially correct
23 Partially correct 3 ms 344 KB Output is partially correct
24 Correct 2 ms 344 KB Output is correct
25 Partially correct 4 ms 600 KB Output is partially correct
26 Partially correct 3 ms 344 KB Output is partially correct
27 Partially correct 3 ms 344 KB Output is partially correct
28 Partially correct 3 ms 600 KB Output is partially correct
29 Partially correct 5 ms 344 KB Output is partially correct
30 Partially correct 3 ms 344 KB Output is partially correct
31 Partially correct 4 ms 344 KB Output is partially correct
32 Partially correct 3 ms 344 KB Output is partially correct
33 Partially correct 3 ms 344 KB Output is partially correct
34 Partially correct 3 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 428 KB Output is partially correct
39 Partially correct 3 ms 344 KB Output is partially correct
40 Partially correct 3 ms 344 KB Output is partially correct
41 Partially correct 3 ms 344 KB Output is partially correct
42 Partially correct 3 ms 344 KB Output is partially correct
43 Partially correct 3 ms 344 KB Output is partially correct
44 Partially correct 4 ms 600 KB Output is partially correct
45 Partially correct 4 ms 428 KB Output is partially correct
46 Partially correct 3 ms 344 KB Output is partially correct
47 Partially correct 3 ms 344 KB Output is partially correct
48 Partially correct 4 ms 344 KB Output is partially correct
49 Partially correct 3 ms 344 KB Output is partially correct
50 Partially correct 3 ms 344 KB Output is partially correct
51 Partially correct 3 ms 344 KB Output is partially correct
52 Partially correct 3 ms 344 KB Output is partially correct
53 Partially correct 3 ms 344 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 3 ms 344 KB Output is partially correct
58 Partially correct 3 ms 344 KB Output is partially correct
59 Partially correct 3 ms 344 KB Output is partially correct
60 Partially correct 3 ms 344 KB Output is partially correct
61 Partially correct 6 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 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 368 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 1 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