Submission #433106

# Submission time Handle Problem Language Result Execution time Memory
433106 2021-06-18T20:54:52 Z peuch Counting Mushrooms (IOI20_mushrooms) C++17
25 / 100
154 ms 792 KB
#include "mushrooms.h"
#include<bits/stdc++.h>
using namespace std;

int count_mushrooms(int n) {
	
	vector<int> ans (n);
	vector<int> marc (n);
	marc[0] = 1;
	ans[0] = 1;
	
	vector<int> ask;
	for(int i = 0; i < n; i++)
		ask.push_back(i);
	
	int val = use_machine(ask);
	marc[n - 1] = 1;
	ans[n - 1] = val % 2 == 0;
	
	int a = 0;
	if(val == 0) return n;
	else if(val == 1){
		ask.clear();
		ask.push_back(0);
		ask.push_back(1);
		if(use_machine(ask) == 1) return 1;
		a = 1;
		marc[1] = 1;
		ans[1] = 1;
	}
	else if(val % 2 == 0) a = n - 1;
	else{
		int ini = 1, fim = n - 1;
		while(ini != fim){
			int mid = (ini + fim) >> 1;
			ask.clear();
			ask.push_back(0);
			for(int i = ini; i <= mid; i++)
				ask.push_back(i);
			int aux = use_machine(ask);
			marc[mid] = 1;
			ans[mid] = aux % 2 == 0;
			if(aux % 2 == 0){
				a = mid;
				break;
			}
			if(aux == val) fim = mid - 1;
			else ini = mid + 1, val -= aux;
		}
		if(a == 0) return 1;
	}
	queue<int> fila;
	for(int i = 0; i < n; i++){
		if(marc[i]) continue;
		fila.push(i);
	}
	
	while(fila.size() > 1){
		int c = fila.front();
		fila.pop();
		int d = fila.front();
		fila.pop();
		vector<int> ask2 (4);
		ask2[0] = 0;
		ask2[1] = c;
		ask2[2] = a;
		ask2[3] = d;
		int aux = use_machine(ask2);
		if(aux == 0){
			ans[c] = 1;
			ans[d] = 1;
		}
		else if(aux == 1){
			ans[c] = 1;
			ans[d] = 0;
		}
		else if(aux == 2){
			ans[c] = 0;
			ans[d] = 1;
		}
		else if(aux == 3){
			ans[c] = 0;
			ans[d] = 0;
		}
	}
	if(!fila.empty()){
		int c = fila.front();
		fila.pop();
		vector<int> ask2 (2);
		ask2[0] = 0;
		ask2[1] = c;
		int aux = use_machine(ask2);
		if(aux == 0) ans[c] = 1;
		if(aux == 1) ans[c] = 0;
	}
	
	int ret = 0;
	for(int i = 0; i < n; i++)
		ret += ans[i];
	
	return ret;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 1 ms 200 KB Output is correct
5 Correct 1 ms 200 KB Output is correct
6 Partially correct 10 ms 328 KB Output is partially correct
7 Partially correct 93 ms 712 KB Output is partially correct
8 Partially correct 93 ms 584 KB Output is partially correct
9 Partially correct 88 ms 712 KB Output is partially correct
10 Partially correct 74 ms 680 KB Output is partially correct
11 Partially correct 82 ms 712 KB Output is partially correct
12 Partially correct 102 ms 712 KB Output is partially correct
13 Partially correct 85 ms 712 KB Output is partially correct
14 Partially correct 53 ms 456 KB Output is partially correct
15 Partially correct 104 ms 712 KB Output is partially correct
16 Partially correct 95 ms 712 KB Output is partially correct
17 Partially correct 47 ms 456 KB Output is partially correct
18 Partially correct 81 ms 676 KB Output is partially correct
19 Partially correct 70 ms 724 KB Output is partially correct
20 Partially correct 92 ms 712 KB Output is partially correct
21 Partially correct 57 ms 712 KB Output is partially correct
22 Partially correct 103 ms 712 KB Output is partially correct
23 Partially correct 118 ms 712 KB Output is partially correct
24 Partially correct 50 ms 456 KB Output is partially correct
25 Partially correct 88 ms 584 KB Output is partially correct
26 Partially correct 56 ms 680 KB Output is partially correct
27 Partially correct 106 ms 712 KB Output is partially correct
28 Partially correct 89 ms 712 KB Output is partially correct
29 Partially correct 62 ms 584 KB Output is partially correct
30 Partially correct 92 ms 676 KB Output is partially correct
31 Partially correct 125 ms 712 KB Output is partially correct
32 Partially correct 95 ms 712 KB Output is partially correct
33 Partially correct 102 ms 712 KB Output is partially correct
34 Partially correct 87 ms 712 KB Output is partially correct
35 Partially correct 97 ms 584 KB Output is partially correct
36 Partially correct 96 ms 712 KB Output is partially correct
37 Partially correct 94 ms 712 KB Output is partially correct
38 Partially correct 104 ms 712 KB Output is partially correct
39 Partially correct 82 ms 664 KB Output is partially correct
40 Partially correct 116 ms 704 KB Output is partially correct
41 Partially correct 77 ms 712 KB Output is partially correct
42 Partially correct 79 ms 712 KB Output is partially correct
43 Partially correct 109 ms 584 KB Output is partially correct
44 Partially correct 88 ms 712 KB Output is partially correct
45 Partially correct 81 ms 712 KB Output is partially correct
46 Partially correct 128 ms 712 KB Output is partially correct
47 Partially correct 90 ms 712 KB Output is partially correct
48 Partially correct 82 ms 584 KB Output is partially correct
49 Partially correct 154 ms 676 KB Output is partially correct
50 Partially correct 98 ms 584 KB Output is partially correct
51 Partially correct 112 ms 712 KB Output is partially correct
52 Partially correct 100 ms 712 KB Output is partially correct
53 Partially correct 94 ms 712 KB Output is partially correct
54 Partially correct 66 ms 712 KB Output is partially correct
55 Partially correct 102 ms 716 KB Output is partially correct
56 Partially correct 94 ms 712 KB Output is partially correct
57 Partially correct 95 ms 680 KB Output is partially correct
58 Partially correct 95 ms 792 KB Output is partially correct
59 Partially correct 93 ms 712 KB Output is partially correct
60 Partially correct 91 ms 712 KB Output is partially correct
61 Partially correct 106 ms 676 KB Output is partially correct
62 Correct 0 ms 200 KB Output is correct
63 Correct 1 ms 200 KB Output is correct
64 Correct 1 ms 200 KB Output is correct
65 Correct 0 ms 200 KB Output is correct
66 Correct 1 ms 200 KB Output is correct
67 Correct 1 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 0 ms 200 KB Output is correct
71 Correct 1 ms 200 KB Output is correct
72 Correct 0 ms 200 KB Output is correct
73 Correct 0 ms 200 KB Output is correct
74 Correct 0 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 0 ms 200 KB Output is correct
80 Correct 1 ms 200 KB Output is correct
81 Correct 0 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 0 ms 200 KB Output is correct
87 Correct 0 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 0 ms 200 KB Output is correct