답안 #696838

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
696838	2023-02-07T11:26:12 Z	esomer	버섯 세기 (IOI20_mushrooms)	C++17	92.623 / 100	10 ms	464 KB

mushrooms

#include<bits/stdc++.h>
#include "mushrooms.h"
 
using namespace std;
 
#define endl "\n"
 
typedef long long int ll;

const int MOD = 1e9 + 7;

//~ int use_machine(vector<int> x){
	//~ cout << "Ask: ";
	//~ for(int v : x) cout << v << " "; cout << endl;
	//~ int rep; cin >> rep;
	//~ return rep;
//~ }


int use_machine(vector<int> x);

int count_mushrooms(int n){
	//Initially ask 73 questions.
	vector<int> a = {0};
	vector<int> b;
	int ans = 1;
	int rep = use_machine({0, 1}); 
	if(rep == 1){
		b.push_back(1);
	}else {a.push_back(1); ans++;}
	if(n == 2) return ans;
	rep = use_machine({0, 2}); 
	if(rep == 1){
		b.push_back(2);
	}else {a.push_back(2); ans++;}
	int left = 72;
	int curr = 3;
	while(left > 0 && curr < n){
		if(curr == n - 1){
			rep = use_machine({0, curr});
			if(rep == 0) ans++;
			return ans;
		}
		if((int)a.size() >= 2){
			rep = use_machine({0, curr, a[1], curr + 1});
			if(rep >= 2) b.push_back(curr);
			else {a.push_back(curr); ans++;}
			if(rep % 2 == 1) b.push_back(curr + 1);
			else {a.push_back(curr + 1); ans++;}
		}else{
			rep = use_machine({b[0], curr, b[1], curr + 1});
			if(rep < 2) b.push_back(curr);
			else {a.push_back(curr); ans++;}
			if(rep % 2 == 0) b.push_back(curr + 1);
			else {a.push_back(curr + 1); ans++;}
		}
		curr += 2;
		left--;
	}
	while(curr < n){
		if((int)a.size() < (int)b.size()){
			vector<int> v;
			for(int x : b){
				v.push_back(x);
				v.push_back(curr);
				curr++;
				if(curr == n) break;
			}
			rep = use_machine(v);
			ans += rep / 2;
			if(rep % 2 == 1) {ans++; a.push_back(v.back());}
			else b.push_back(v.back());
		}else{
			vector<int> v;
			int asked = 0;
			for(int x : a){
				v.push_back(x);
				v.push_back(curr);
				curr++;
				asked++;
				if(curr == n) break;  
			}
			rep = use_machine(v);
			ans += asked - rep / 2;
			if(rep % 2 == 1) {ans--; b.push_back(v.back());}
			else a.push_back(v.back());
		}
	}
	return ans;
}

//~ int main(){
	//~ int n; cin >> n;
	//~ cout << count_mushrooms(n) << endl;
//~ }

Subtask #1

92.623 / 100.0

#	결과	실행 시간	메모리	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	208 KB	Output is correct
6	Correct	3 ms	208 KB	Output is correct
7	Correct	6 ms	208 KB	Output is correct
8	Correct	7 ms	208 KB	Output is correct
9	Correct	6 ms	208 KB	Output is correct
10	Correct	7 ms	308 KB	Output is correct
11	Partially correct	6 ms	208 KB	Output is partially correct
12	Correct	5 ms	208 KB	Output is correct
13	Correct	5 ms	208 KB	Output is correct
14	Correct	4 ms	332 KB	Output is correct
15	Partially correct	8 ms	308 KB	Output is partially correct
16	Partially correct	8 ms	208 KB	Output is partially correct
17	Correct	3 ms	208 KB	Output is correct
18	Correct	7 ms	308 KB	Output is correct
19	Partially correct	5 ms	336 KB	Output is partially correct
20	Correct	7 ms	208 KB	Output is correct
21	Correct	6 ms	316 KB	Output is correct
22	Partially correct	5 ms	316 KB	Output is partially correct
23	Correct	6 ms	208 KB	Output is correct
24	Correct	3 ms	208 KB	Output is correct
25	Partially correct	6 ms	208 KB	Output is partially correct
26	Partially correct	8 ms	320 KB	Output is partially correct
27	Partially correct	6 ms	320 KB	Output is partially correct
28	Partially correct	6 ms	320 KB	Output is partially correct
29	Partially correct	7 ms	336 KB	Output is partially correct
30	Partially correct	5 ms	208 KB	Output is partially correct
31	Partially correct	8 ms	208 KB	Output is partially correct
32	Partially correct	10 ms	324 KB	Output is partially correct
33	Partially correct	6 ms	336 KB	Output is partially correct
34	Partially correct	6 ms	208 KB	Output is partially correct
35	Partially correct	7 ms	336 KB	Output is partially correct
36	Partially correct	6 ms	208 KB	Output is partially correct
37	Partially correct	6 ms	336 KB	Output is partially correct
38	Partially correct	7 ms	328 KB	Output is partially correct
39	Partially correct	5 ms	336 KB	Output is partially correct
40	Partially correct	6 ms	316 KB	Output is partially correct
41	Partially correct	6 ms	336 KB	Output is partially correct
42	Partially correct	6 ms	320 KB	Output is partially correct
43	Partially correct	8 ms	316 KB	Output is partially correct
44	Partially correct	6 ms	324 KB	Output is partially correct
45	Partially correct	6 ms	320 KB	Output is partially correct
46	Partially correct	7 ms	208 KB	Output is partially correct
47	Partially correct	5 ms	336 KB	Output is partially correct
48	Partially correct	9 ms	328 KB	Output is partially correct
49	Partially correct	8 ms	328 KB	Output is partially correct
50	Partially correct	5 ms	332 KB	Output is partially correct
51	Partially correct	6 ms	324 KB	Output is partially correct
52	Partially correct	5 ms	208 KB	Output is partially correct
53	Partially correct	6 ms	308 KB	Output is partially correct
54	Partially correct	8 ms	208 KB	Output is partially correct
55	Partially correct	6 ms	340 KB	Output is partially correct
56	Partially correct	6 ms	312 KB	Output is partially correct
57	Partially correct	8 ms	464 KB	Output is partially correct
58	Partially correct	6 ms	320 KB	Output is partially correct
59	Partially correct	6 ms	208 KB	Output is partially correct
60	Partially correct	6 ms	336 KB	Output is partially correct
61	Partially correct	5 ms	340 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	1 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	1 ms	208 KB	Output is correct
85	Correct	0 ms	208 KB	Output is correct
86	Correct	1 ms	208 KB	Output is correct
87	Correct	0 ms	208 KB	Output is correct
88	Correct	0 ms	208 KB	Output is correct
89	Correct	0 ms	208 KB	Output is correct
90	Correct	0 ms	208 KB	Output is correct
91	Correct	0 ms	208 KB	Output is correct