oj.uz

Submission #813804

# Submission time Handle Problem Language Result Execution time Memory
813804 2023-08-08T03:58:45 Z joonwu04 Counting Mushrooms (IOI20_mushrooms) C++17
92.2449 / 100
 7 ms 340 KB 
#include "mushrooms.h"
#include <vector>
#include <iostream>

using namespace std;


vector<int> a, b;
int ans;

int type3(vector<int> &v);
void type2(int base1, int base2, int isA, int i, int j);
void type1(int i);

int count_mushrooms(int n) {
	if(n==2) {
		return 2-use_machine({0, 1});
	}
	
	//printf("printOK\n");
	
	a.push_back(0);
	type1(1);
	type1(2);
	//printf("pass1\n");
	
	int k=min(n-1, 140);
	k -= k%2==1 ? 1:0;
	// k%2 == 0
	for(int i=3; i<=k-1; i+=2) {
		if(a.size()>=2) {
			type2(a[0], a[1], 1, i, i+1);
		}
		else {
			type2(b[0], b[1], 0, i, i+1);
		}
	}
	//printf("pass2\n");
	
	ans = a.size();
	
	int i=k+1;
	while(i<=n-1) {
		int vSize = min(n-1-i+1, (int)max(a.size(), b.size()));
		
		vector<int> v;
		for(int j=0; j<vSize; j++) {
			v.push_back(i+j);
		}
		
		ans += type3(v);
		
		//printf("%d~%d pass\n", i, i+vSize-1);
		i = i+vSize;
	}
	
	return ans;
}

// type3: knowing v by 1 with how many colors are red.
int type3(vector<int> &v) {
	int isA = a.size() >= b.size() ? 1:0;
	vector<int> &ta = isA ? a:b;
	vector<int> &tb = isA ? b:a;
	
	vector<int> tmp;
	for(int i=0; i<v.size(); i++) {
		tmp.push_back(ta[i]);
		tmp.push_back(v[i]);
	}
	
	int x = use_machine(tmp);
	
	if(x%2 == 0) {
		ta.push_back(v.back());
	}
	else {
		tb.push_back(v.back());
	}
	
	int numA = 0;
	if(x%2 == 0) {
		numA++;
		numA += v.size()-1 - x/2;
	}
	else {
		numA += v.size()-1 - (x-1)/2;
	}
	
	return isA ? numA : v.size()-numA;
}

// type2: knowing 2 by 1 with what color is. And push each of them into red or blue.
void type2(int base1, int base2, int isA, int i, int j) {
	int x = use_machine({base1, i, base2, j});
	
	vector<int> &ta = isA ? a:b;
	vector<int> &tb = isA ? b:a;
	if(x == 0) {
		ta.push_back(i);
		ta.push_back(j);
	}
	else if(x == 1) {
		ta.push_back(i);
		tb.push_back(j);
	}
	else if(x == 2) {
		tb.push_back(i);
		ta.push_back(j);
	}
	else {
		tb.push_back(i);
		tb.push_back(j);
	}
}

// type1: knowing 1 by 1 with what color is. And push it into red or blue.
void type1(int i) {
	if(use_machine({0, i}) == 0) {
		a.push_back(i);
	}
	else {
		b.push_back(i);
	}
}

Compilation message

mushrooms.cpp: In function 'int type3(std::vector<int>&)':
mushrooms.cpp:67:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   67 |  for(int i=0; i<v.size(); i++) {
      |               ~^~~~~~~~~

Subtask #1
92.2449 / 100.0

# 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 300 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 5 ms 208 KB Output is correct
8 Correct 5 ms 208 KB Output is correct
9 Correct 6 ms 312 KB Output is correct
10 Correct 6 ms 320 KB Output is correct
11 Partially correct 6 ms 332 KB Output is partially correct
12 Correct 5 ms 336 KB Output is correct
13 Correct 5 ms 208 KB Output is correct
14 Correct 3 ms 208 KB Output is correct
15 Partially correct 6 ms 328 KB Output is partially correct
16 Partially correct 6 ms 324 KB Output is partially correct
17 Correct 3 ms 208 KB Output is correct
18 Correct 5 ms 208 KB Output is correct
19 Partially correct 6 ms 336 KB Output is partially correct
20 Correct 5 ms 324 KB Output is correct
21 Correct 7 ms 312 KB Output is correct
22 Partially correct 6 ms 336 KB Output is partially correct
23 Correct 6 ms 208 KB Output is correct
24 Correct 4 ms 312 KB Output is correct
25 Partially correct 5 ms 324 KB Output is partially correct
26 Partially correct 7 ms 208 KB Output is partially correct
27 Partially correct 5 ms 324 KB Output is partially correct
28 Partially correct 5 ms 336 KB Output is partially correct
29 Partially correct 5 ms 304 KB Output is partially correct
30 Partially correct 4 ms 336 KB Output is partially correct
31 Partially correct 7 ms 336 KB Output is partially correct
32 Partially correct 5 ms 336 KB Output is partially correct
33 Partially correct 6 ms 336 KB Output is partially correct
34 Partially correct 5 ms 336 KB Output is partially correct
35 Partially correct 7 ms 316 KB Output is partially correct
36 Partially correct 5 ms 208 KB Output is partially correct
37 Partially correct 5 ms 208 KB Output is partially correct
38 Partially correct 6 ms 320 KB Output is partially correct
39 Partially correct 6 ms 336 KB Output is partially correct
40 Partially correct 6 ms 336 KB Output is partially correct
41 Partially correct 6 ms 324 KB Output is partially correct
42 Partially correct 5 ms 312 KB Output is partially correct
43 Partially correct 5 ms 208 KB Output is partially correct
44 Partially correct 5 ms 208 KB Output is partially correct
45 Partially correct 6 ms 208 KB Output is partially correct
46 Partially correct 4 ms 340 KB Output is partially correct
47 Partially correct 6 ms 336 KB Output is partially correct
48 Partially correct 6 ms 328 KB Output is partially correct
49 Partially correct 6 ms 208 KB Output is partially correct
50 Partially correct 5 ms 336 KB Output is partially correct
51 Partially correct 6 ms 208 KB Output is partially correct
52 Partially correct 5 ms 316 KB Output is partially correct
53 Partially correct 5 ms 320 KB Output is partially correct
54 Partially correct 6 ms 336 KB Output is partially correct
55 Partially correct 4 ms 340 KB Output is partially correct
56 Partially correct 6 ms 336 KB Output is partially correct
57 Partially correct 6 ms 308 KB Output is partially correct
58 Partially correct 6 ms 332 KB Output is partially correct
59 Partially correct 6 ms 316 KB Output is partially correct
60 Partially correct 5 ms 336 KB Output is partially correct
61 Partially correct 5 ms 316 KB Output is partially correct
62 Correct 0 ms 208 KB Output is correct
63 Correct 0 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 0 ms 208 KB Output is correct
67 Correct 0 ms 208 KB Output is correct
68 Correct 1 ms 208 KB Output is correct
69 Correct 0 ms 208 KB Output is correct
70 Correct 0 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 0 ms 208 KB Output is correct
74 Correct 0 ms 208 KB Output is correct
75 Correct 0 ms 208 KB Output is correct
76 Correct 0 ms 208 KB Output is correct
77 Correct 0 ms 208 KB Output is correct
78 Correct 1 ms 208 KB Output is correct
79 Correct 0 ms 208 KB Output is correct
80 Correct 0 ms 208 KB Output is correct
81 Correct 0 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 0 ms 208 KB Output is correct
85 Correct 0 ms 208 KB Output is correct
86 Correct 0 ms 208 KB Output is correct
87 Correct 1 ms 208 KB Output is correct
88 Correct 1 ms 208 KB Output is correct
89 Correct 1 ms 208 KB Output is correct
90 Correct 0 ms 208 KB Output is correct
91 Correct 0 ms 208 KB Output is correct