oj.uz

Submission #624889

# Submission time Handle Problem Language Result Execution time Memory
624889 2022-08-09T00:47:10 Z cfalas Counting Mushrooms (IOI20_mushrooms) C++17
92.623 / 100
 8 ms 452 KB 
#include "mushrooms.h"
#include <bits/stdc++.h>
using namespace std;
 
 
int count_mushrooms(int n) {
	vector<int> arr[2];
	bool B = 1;
 
	int i,k,x;
	const int init = 150;
	
	vector<int> temp;
	temp.push_back(0);
	arr[0].push_back(0);
 
	int res = 0;
 
	for(i=1;i<=min(n-1,2);i++){
		temp.push_back(i);
		x = use_machine(temp);
		temp.pop_back();
 
		arr[x].push_back(i);
	}
 
	temp.pop_back();
 
	if(arr[0].size() > arr[1].size())
		B = 0;
	
	//assert(arr[B].size() >= 2);
	temp.push_back(arr[B][0]);
	temp.push_back(-1);
	if(arr[B].size() > 1){
		temp.push_back(arr[B][1]);
	}
	temp.push_back(-1);
 
	for(k=3;k<=min(n-2,init-1);k+=2){
		temp[1] = k;
		temp[3] = k+1;
		x = use_machine(temp);
 
		if(x >= 2){
			/// middle one is different
			arr[B^1].push_back(k);
		}
		else{
			arr[B].push_back(k);
		}
 
		if(x % 2){
			/// right one is diff
			arr[B^1].push_back(k+1);
		}
		else{
			arr[B].push_back(k+1);
		}
	}
	if(n%2 == 0 && k == n-1 && n != 2){
		temp = {0,n-1};
		x = use_machine(temp);
		if(!x)res++;
	}
 
	k = init + 1;
	res += arr[0].size();
	while(k<n){
		temp.clear();
		B = 1;
		if(arr[0].size() > arr[1].size())
			B = 0;
		for(i=0;i<arr[B].size() && k < n;i++){
			temp.push_back(arr[B][i]);
			temp.push_back(k);
			k++;
		}
 
		x = use_machine(temp);
		int diff = x/2;
 
		if(x%2){
			diff++;
			arr[B^1].push_back(temp.back());
		}
 
        else{
          arr[B].push_back(temp.back());
}
		if(B)
			res += diff;
		else
			res += temp.size()/2 - diff;
 
	}
 
	return res;
}

Compilation message

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

Subtask #1
92.623 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 2 ms 312 KB Output is correct
7 Correct 8 ms 208 KB Output is correct
8 Correct 7 ms 208 KB Output is correct
9 Correct 5 ms 208 KB Output is correct
10 Correct 7 ms 260 KB Output is correct
11 Partially correct 6 ms 336 KB Output is partially correct
12 Correct 7 ms 208 KB Output is correct
13 Correct 7 ms 208 KB Output is correct
14 Correct 4 ms 208 KB Output is correct
15 Partially correct 6 ms 308 KB Output is partially correct
16 Partially correct 8 ms 256 KB Output is partially correct
17 Correct 3 ms 312 KB Output is correct
18 Correct 6 ms 208 KB Output is correct
19 Partially correct 7 ms 208 KB Output is partially correct
20 Correct 4 ms 324 KB Output is correct
21 Correct 7 ms 208 KB Output is correct
22 Partially correct 5 ms 332 KB Output is partially correct
23 Correct 5 ms 316 KB Output is correct
24 Correct 4 ms 336 KB Output is correct
25 Partially correct 6 ms 312 KB Output is partially correct
26 Partially correct 6 ms 208 KB Output is partially correct
27 Partially correct 8 ms 316 KB Output is partially correct
28 Partially correct 7 ms 316 KB Output is partially correct
29 Partially correct 5 ms 336 KB Output is partially correct
30 Partially correct 8 ms 336 KB Output is partially correct
31 Partially correct 6 ms 320 KB Output is partially correct
32 Partially correct 8 ms 452 KB Output is partially correct
33 Partially correct 8 ms 332 KB Output is partially correct
34 Partially correct 6 ms 208 KB Output is partially correct
35 Partially correct 4 ms 332 KB Output is partially correct
36 Partially correct 6 ms 208 KB Output is partially correct
37 Partially correct 6 ms 320 KB Output is partially correct
38 Partially correct 6 ms 308 KB Output is partially correct
39 Partially correct 5 ms 332 KB Output is partially correct
40 Partially correct 4 ms 332 KB Output is partially correct
41 Partially correct 5 ms 208 KB Output is partially correct
42 Partially correct 8 ms 208 KB Output is partially correct
43 Partially correct 6 ms 328 KB Output is partially correct
44 Partially correct 8 ms 436 KB Output is partially correct
45 Partially correct 6 ms 208 KB Output is partially correct
46 Partially correct 6 ms 304 KB Output is partially correct
47 Partially correct 8 ms 316 KB Output is partially correct
48 Partially correct 8 ms 332 KB Output is partially correct
49 Partially correct 6 ms 304 KB Output is partially correct
50 Partially correct 6 ms 324 KB Output is partially correct
51 Partially correct 6 ms 208 KB Output is partially correct
52 Partially correct 5 ms 328 KB Output is partially correct
53 Partially correct 6 ms 316 KB Output is partially correct
54 Partially correct 6 ms 328 KB Output is partially correct
55 Partially correct 7 ms 336 KB Output is partially correct
56 Partially correct 6 ms 316 KB Output is partially correct
57 Partially correct 5 ms 208 KB Output is partially correct
58 Partially correct 5 ms 328 KB Output is partially correct
59 Partially correct 6 ms 312 KB Output is partially correct
60 Partially correct 8 ms 328 KB Output is partially correct
61 Partially correct 6 ms 328 KB Output is partially correct
62 Correct 1 ms 212 KB Output is correct
63 Correct 0 ms 212 KB Output is correct
64 Correct 0 ms 212 KB Output is correct
65 Correct 0 ms 212 KB Output is correct
66 Correct 0 ms 208 KB Output is correct
67 Correct 0 ms 208 KB Output is correct
68 Correct 0 ms 208 KB Output is correct
69 Correct 0 ms 208 KB Output is correct
70 Correct 1 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 1 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 0 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 0 ms 208 KB Output is correct
88 Correct 0 ms 208 KB Output is correct
89 Correct 1 ms 208 KB Output is correct
90 Correct 1 ms 208 KB Output is correct
91 Correct 0 ms 208 KB Output is correct