oj.uz

Submission #307410

# Submission time Handle Problem Language Result Execution time Memory
307410 2020-09-28T04:47:39 Z arthur_nascimento Counting Mushrooms (IOI20_mushrooms) C++14
92.623 / 100
 9 ms 512 KB 
#include "mushrooms.h"
#define pb push_back
using namespace std;

const int C = 159;

int count_mushrooms(int n) {
	vector<int> A,B;
	A.pb(0);

	for(int i=1;i<min(3,n);i++){
		vector<int> v;
		v.pb(0);
		v.pb(i);
		int x = use_machine(v);
		if(x) B.pb(i);
		else A.pb(i);
	}

	int ua = 1;
	if(B.size() > A.size()) ua = 0;
	
	int nx = 3;
	for(int i=3;i<min(C,n-2);i+=2){
		if(ua){
			vector<int> v = {A[0],i,A[1],i+1};
			int x = use_machine(v);
			if(x >= 2)
				B.pb(i);
			else
				A.pb(i);
			if(x%2 == 1)
				B.pb(i+1);
			else
				A.pb(i+1);
		}	
		else {
			vector<int> v = {B[0],i,B[1],i+1};
			int x = use_machine(v);
			if(x >= 2)
				A.pb(i);
			else
				B.pb(i);
			if(x%2 == 1)
				A.pb(i+1);
			else
				B.pb(i+1);
		}
		nx = i+2;
	}


	int ans = A.size();

	int eff = 0;
	for(int i=nx;i<n;){

		int t = max(A.size(), B.size());
		int use = 0;
		if(B.size() > A.size()) use = 1;

		vector<int> vec = A;
		if(use) vec = B;
	
		vector<int> v;
		int spec = -1;
		eff = 0;
		for(int j=0;j<t;j++){
			v.pb(vec[j]);
			if(j < t-1 && i+j < n) v.pb(i+j), eff++;
			if(j == t-1 && i+j < n){
				v.pb(i+j);
				spec = i+j;
			}	
		}
		int x = use_machine(v);
		//printf("ff %d\n",eff);
		if(use) ans += x/2;
		else ans += eff - (x/2);

		if(spec+1){
			if(x%2 != use){
				B.pb(spec);
			}
			else {
				A.pb(spec);
				ans++;
			}
		}

		i += t-1;
		if(spec+1) i++;
		
	}
	return ans;
}

Subtask #1
92.623 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 8 ms 256 KB Output is correct
8 Correct 8 ms 256 KB Output is correct
9 Correct 7 ms 256 KB Output is correct
10 Correct 9 ms 256 KB Output is correct
11 Partially correct 7 ms 256 KB Output is partially correct
12 Correct 9 ms 256 KB Output is correct
13 Correct 7 ms 256 KB Output is correct
14 Correct 4 ms 256 KB Output is correct
15 Partially correct 8 ms 256 KB Output is partially correct
16 Partially correct 7 ms 256 KB Output is partially correct
17 Correct 4 ms 256 KB Output is correct
18 Correct 8 ms 256 KB Output is correct
19 Partially correct 7 ms 256 KB Output is partially correct
20 Correct 7 ms 256 KB Output is correct
21 Correct 9 ms 256 KB Output is correct
22 Partially correct 9 ms 256 KB Output is partially correct
23 Correct 7 ms 256 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Partially correct 8 ms 256 KB Output is partially correct
26 Partially correct 8 ms 256 KB Output is partially correct
27 Partially correct 7 ms 256 KB Output is partially correct
28 Partially correct 7 ms 256 KB Output is partially correct
29 Partially correct 6 ms 368 KB Output is partially correct
30 Partially correct 7 ms 256 KB Output is partially correct
31 Partially correct 7 ms 256 KB Output is partially correct
32 Partially correct 7 ms 256 KB Output is partially correct
33 Partially correct 7 ms 256 KB Output is partially correct
34 Partially correct 7 ms 384 KB Output is partially correct
35 Partially correct 7 ms 512 KB Output is partially correct
36 Partially correct 7 ms 256 KB Output is partially correct
37 Partially correct 7 ms 256 KB Output is partially correct
38 Partially correct 7 ms 256 KB Output is partially correct
39 Partially correct 7 ms 256 KB Output is partially correct
40 Partially correct 7 ms 256 KB Output is partially correct
41 Partially correct 8 ms 256 KB Output is partially correct
42 Partially correct 7 ms 256 KB Output is partially correct
43 Partially correct 9 ms 256 KB Output is partially correct
44 Partially correct 9 ms 256 KB Output is partially correct
45 Partially correct 7 ms 256 KB Output is partially correct
46 Partially correct 7 ms 256 KB Output is partially correct
47 Partially correct 8 ms 256 KB Output is partially correct
48 Partially correct 7 ms 256 KB Output is partially correct
49 Partially correct 8 ms 256 KB Output is partially correct
50 Partially correct 8 ms 256 KB Output is partially correct
51 Partially correct 8 ms 256 KB Output is partially correct
52 Partially correct 7 ms 256 KB Output is partially correct
53 Partially correct 7 ms 256 KB Output is partially correct
54 Partially correct 8 ms 256 KB Output is partially correct
55 Partially correct 7 ms 256 KB Output is partially correct
56 Partially correct 9 ms 256 KB Output is partially correct
57 Partially correct 9 ms 256 KB Output is partially correct
58 Partially correct 6 ms 388 KB Output is partially correct
59 Partially correct 8 ms 256 KB Output is partially correct
60 Partially correct 9 ms 256 KB Output is partially correct
61 Partially correct 8 ms 256 KB Output is partially correct
62 Correct 0 ms 256 KB Output is correct
63 Correct 0 ms 256 KB Output is correct
64 Correct 0 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 0 ms 384 KB Output is correct
69 Correct 0 ms 256 KB Output is correct
70 Correct 0 ms 256 KB Output is correct
71 Correct 1 ms 256 KB Output is correct
72 Correct 0 ms 256 KB Output is correct
73 Correct 0 ms 256 KB Output is correct
74 Correct 0 ms 256 KB Output is correct
75 Correct 0 ms 256 KB Output is correct
76 Correct 1 ms 256 KB Output is correct
77 Correct 0 ms 256 KB Output is correct
78 Correct 0 ms 256 KB Output is correct
79 Correct 0 ms 256 KB Output is correct
80 Correct 0 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 0 ms 256 KB Output is correct
88 Correct 0 ms 256 KB Output is correct
89 Correct 0 ms 256 KB Output is correct
90 Correct 0 ms 256 KB Output is correct
91 Correct 1 ms 256 KB Output is correct