Submission #427519

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
427519	2021-06-14T16:22:44 Z	AugustinasJucas	Counting Mushrooms (IOI20_mushrooms)	C++14	80.1418 / 100	12 ms	456 KB

mushrooms

#include <bits/stdc++.h>
using namespace std;

#include "mushrooms.h"

int count_mushrooms(int n) {
	if(n <= 999){
		int A = 1, B = 0;
		for(int i = 1; i < n; i++){
			int kek = use_machine({0, i});
			if(kek == 0){
				A++;
			}else{
				B++;
			}
		}
		return A;
	}
	int ans = 1e9;
	int kekViename = -1;
	for(int i = 1; i < n; i++){
		int st = 2 * i + (n - 2*i) / (i) + 1; // kuo tiksliau, tuo geriau!
		if(ans > st){
			ans = st;
			kekViename = i;
		}
	}
	kekViename  = 0;
	kekViename = max(kekViename, 2);
	int lastTaken = 0;
	vector<int> A = {0}, B;
	int left = n-1;
	int answ = 1;
	//cout << "ieskosiu pirmuju " << kekViename << " * 2 skaiciu!" << endl;
	for(int i = 1; i <= kekViename * 2; i++){
		int kek = use_machine({0, i});
		if(kek == 0){
			A.push_back(i);
			answ++;
		}else{
			B.push_back(i);
		}
		left--;
		lastTaken = i;
		if((int)A.size() >= kekViename+1 || (int)B.size() >= kekViename+1){
			break;
		}
	}
	//cout << "radau! A: "; for(auto x : A) cout << x<< " ";
	//cout << ". B: "; for(auto x : B) cout << x << " "; cout << endl << endl; 
	while(true){
		if(A.size() > B.size()){
			//cout << "I tarpus desim A " << endl;
			// desim A ir i tarpus kitka
			vector<int> st;
			int ind = 1;
			st.push_back(A[0]);
			for(int i = 0; i < min(left, (int) A.size()-1); i++){
				st.push_back(++lastTaken);
				st.push_back(A[ind++]);
			}
			st.pop_back();
			int visoBuvo = min(left, (int) A.size()-1);
			//cout << "gaunam st: "; for(auto x : st) cout << x << " "; cout << endl;  
			left -= min(left, (int) A.size()-1);
			int rz = use_machine(st);
			//cout << "pridedame " << visoBuvo << " - " << rz << "/2\n\n";
			if(rz & 1){
				B.push_back(st.back());
			}else{
				A.push_back(st.back());
			}
			answ += visoBuvo - (rz/2 + (rz & 1));
		}else{
			vector<int> st;
			int ind = 1;
			st.push_back(B[0]);
			for(int i = 0; i < min(left, (int) B.size()-1); i++){
				st.push_back(++lastTaken);
				st.push_back(B[ind++]);
			}
			st.pop_back();
			left -= min(left, (int) B.size()-1);
			int rz = use_machine(st);
			if(rz & 1){
				A.push_back(st.back());
			}else{
				B.push_back(st.back());
			}
			answ += rz/2 + (rz & 1);
		}
		if(left == 0) break;
	}
 	
	return answ;

}


/*
11
0 0 0 1 1 0 1 1 0 0 1
*/

Subtask #1

80.1418 / 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	256 KB	Output is correct
4	Correct	1 ms	200 KB	Output is correct
5	Correct	4 ms	200 KB	Output is correct
6	Correct	3 ms	200 KB	Output is correct
7	Correct	11 ms	320 KB	Output is correct
8	Correct	7 ms	328 KB	Output is correct
9	Correct	8 ms	328 KB	Output is correct
10	Partially correct	9 ms	328 KB	Output is partially correct
11	Partially correct	10 ms	300 KB	Output is partially correct
12	Partially correct	8 ms	328 KB	Output is partially correct
13	Correct	9 ms	456 KB	Output is correct
14	Correct	4 ms	316 KB	Output is correct
15	Partially correct	9 ms	316 KB	Output is partially correct
16	Partially correct	10 ms	328 KB	Output is partially correct
17	Correct	5 ms	328 KB	Output is correct
18	Correct	8 ms	320 KB	Output is correct
19	Partially correct	9 ms	312 KB	Output is partially correct
20	Partially correct	8 ms	328 KB	Output is partially correct
21	Partially correct	8 ms	332 KB	Output is partially correct
22	Partially correct	9 ms	320 KB	Output is partially correct
23	Partially correct	7 ms	328 KB	Output is partially correct
24	Correct	9 ms	308 KB	Output is correct
25	Partially correct	11 ms	328 KB	Output is partially correct
26	Partially correct	9 ms	304 KB	Output is partially correct
27	Partially correct	11 ms	300 KB	Output is partially correct
28	Partially correct	9 ms	320 KB	Output is partially correct
29	Partially correct	9 ms	304 KB	Output is partially correct
30	Partially correct	9 ms	320 KB	Output is partially correct
31	Partially correct	8 ms	320 KB	Output is partially correct
32	Partially correct	7 ms	320 KB	Output is partially correct
33	Partially correct	9 ms	332 KB	Output is partially correct
34	Partially correct	9 ms	332 KB	Output is partially correct
35	Partially correct	9 ms	332 KB	Output is partially correct
36	Partially correct	10 ms	320 KB	Output is partially correct
37	Partially correct	9 ms	328 KB	Output is partially correct
38	Partially correct	9 ms	300 KB	Output is partially correct
39	Partially correct	8 ms	328 KB	Output is partially correct
40	Partially correct	9 ms	200 KB	Output is partially correct
41	Partially correct	9 ms	320 KB	Output is partially correct
42	Partially correct	9 ms	320 KB	Output is partially correct
43	Partially correct	10 ms	308 KB	Output is partially correct
44	Partially correct	11 ms	316 KB	Output is partially correct
45	Partially correct	9 ms	328 KB	Output is partially correct
46	Partially correct	10 ms	332 KB	Output is partially correct
47	Partially correct	12 ms	316 KB	Output is partially correct
48	Partially correct	11 ms	328 KB	Output is partially correct
49	Partially correct	10 ms	200 KB	Output is partially correct
50	Partially correct	6 ms	340 KB	Output is partially correct
51	Partially correct	7 ms	304 KB	Output is partially correct
52	Partially correct	8 ms	316 KB	Output is partially correct
53	Partially correct	9 ms	304 KB	Output is partially correct
54	Partially correct	9 ms	312 KB	Output is partially correct
55	Partially correct	10 ms	316 KB	Output is partially correct
56	Partially correct	10 ms	200 KB	Output is partially correct
57	Partially correct	9 ms	328 KB	Output is partially correct
58	Partially correct	10 ms	200 KB	Output is partially correct
59	Partially correct	9 ms	328 KB	Output is partially correct
60	Partially correct	7 ms	320 KB	Output is partially correct
61	Partially correct	12 ms	316 KB	Output is partially correct
62	Correct	1 ms	200 KB	Output is correct
63	Correct	0 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	0 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