oj.uz

Submission #1033358

# Submission time Handle Problem Language Result Execution time Memory
1033358 2024-07-24T17:15:25 Z happy_node Counting Mushrooms (IOI20_mushrooms) C++17
90.7631 / 100
 6 ms 1124 KB 
#include "mushrooms.h"
#include <bits/stdc++.h>
using namespace std;

const int B=50;

int count_mushrooms(int N) {
	vector<int> posA, posB;
	posA.push_back(0);
 	
 	if(use_machine({0,1})==0) posA.push_back(1);
 	else posB.push_back(1);

 	if(N>2) {
 		if(use_machine({0,2})==0) posA.push_back(2);
 		else posB.push_back(2);
 	} else {
 		return posA.size();
 	}

	for(int i=3;i+1<min(N,2*B);i+=2) {
		if(posA.size()>=2) {
			vector<int> qry={posA[0],i,posA[1],i+1};
			int res=use_machine(qry);
			if(res==0) {
				posA.push_back(i);
				posA.push_back(i+1);
			} else if(res==1) {
				posA.push_back(i);
				posB.push_back(i+1);
			} else if(res==2) {
				posB.push_back(i);
				posA.push_back(i+1);
			} else {
				posB.push_back(i);
				posB.push_back(i+1);
			}
		} else {
			vector<int> qry={posB[0],i,posB[1],i+1};
			int res=use_machine(qry);
			if(res==0) {
				posB.push_back(i);
				posB.push_back(i+1);
			} else if(res==1) {
				posB.push_back(i);
				posA.push_back(i+1);
			} else if(res==2) {
				posA.push_back(i);
				posB.push_back(i+1);
			} else {
				posA.push_back(i);
				posA.push_back(i+1);
			}
		}

	}

	if((min(N,2*B)-1)&1) {
		if(use_machine({0,min(N,2*B)-1})==0) posA.push_back(min(N,2*B)-1);
		else posB.push_back(min(N,2*B)-1);
	}

	int ans=posA.size();

	for(int i=2*B;i<N;i++) {
		if(posA.size()>posB.size()) {
			int s=posA.size();
			vector<int> qry;
			for(int j=i;j<min(N,i+s);j++) {
				qry.push_back(posA[j-i]);
				qry.push_back(j);
			}	

			int w=use_machine(qry);
			if(w&1) posB.push_back(qry.back());
			else posA.push_back(qry.back());

			w=(w+1)/2;
			ans+=(qry.size()/2-w);
			i+=s-1;
		} else {
			int s=posB.size();
			vector<int> qry;
			for(int j=i;j<min(N,i+s);j++) {
				qry.push_back(posB[j-i]);
				qry.push_back(j);
			}	

			int w=use_machine(qry);
			if(w&1) posA.push_back(qry.back());
			else posB.push_back(qry.back());

			w=(w+1)/2;
			ans+=w;
			i+=s-1;
		}
	}
 
	return ans;
}

Subtask #1
90.7631 / 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 344 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 Correct 3 ms 344 KB Output is correct
11 Partially correct 4 ms 344 KB Output is partially correct
12 Correct 5 ms 344 KB Output is correct
13 Correct 3 ms 344 KB Output is correct
14 Correct 2 ms 344 KB Output is correct
15 Partially correct 4 ms 464 KB Output is partially correct
16 Partially correct 5 ms 464 KB Output is partially correct
17 Correct 2 ms 444 KB Output is correct
18 Correct 3 ms 344 KB Output is correct
19 Partially correct 3 ms 344 KB Output is partially correct
20 Correct 3 ms 344 KB Output is correct
21 Correct 3 ms 464 KB Output is correct
22 Partially correct 4 ms 344 KB Output is partially correct
23 Correct 3 ms 344 KB Output is correct
24 Correct 2 ms 344 KB Output is correct
25 Partially correct 6 ms 600 KB Output is partially correct
26 Partially correct 5 ms 344 KB Output is partially correct
27 Partially correct 4 ms 456 KB Output is partially correct
28 Partially correct 4 ms 600 KB Output is partially correct
29 Partially correct 5 ms 448 KB Output is partially correct
30 Partially correct 3 ms 600 KB Output is partially correct
31 Partially correct 3 ms 600 KB Output is partially correct
32 Partially correct 6 ms 476 KB Output is partially correct
33 Partially correct 3 ms 716 KB Output is partially correct
34 Partially correct 4 ms 344 KB Output is partially correct
35 Partially correct 4 ms 344 KB Output is partially correct
36 Partially correct 6 ms 472 KB Output is partially correct
37 Partially correct 4 ms 344 KB Output is partially correct
38 Partially correct 5 ms 344 KB Output is partially correct
39 Partially correct 3 ms 344 KB Output is partially correct
40 Partially correct 4 ms 344 KB Output is partially correct
41 Partially correct 4 ms 472 KB Output is partially correct
42 Partially correct 3 ms 344 KB Output is partially correct
43 Partially correct 4 ms 344 KB Output is partially correct
44 Partially correct 3 ms 344 KB Output is partially correct
45 Partially correct 5 ms 344 KB Output is partially correct
46 Partially correct 3 ms 600 KB Output is partially correct
47 Partially correct 6 ms 1124 KB Output is partially correct
48 Partially correct 3 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 456 KB Output is partially correct
53 Partially correct 4 ms 344 KB Output is partially correct
54 Partially correct 3 ms 344 KB Output is partially correct
55 Partially correct 3 ms 448 KB Output is partially correct
56 Partially correct 4 ms 600 KB Output is partially correct
57 Partially correct 4 ms 344 KB Output is partially correct
58 Partially correct 4 ms 444 KB Output is partially correct
59 Partially correct 4 ms 476 KB Output is partially correct
60 Partially correct 3 ms 600 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 1 ms 344 KB Output is correct
65 Correct 0 ms 344 KB Output is correct
66 Correct 1 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 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 1 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 0 ms 344 KB Output is correct
89 Correct 1 ms 344 KB Output is correct
90 Correct 1 ms 344 KB Output is correct
91 Correct 0 ms 344 KB Output is correct