oj.uz

Submission #305183

# Submission time Handle Problem Language Result Execution time Memory
305183 2020-09-22T17:09:55 Z aljasdlas Counting Mushrooms (IOI20_mushrooms) C++14
87.5969 / 100
 10 ms 512 KB 
#include "mushrooms.h"
#include <bits/stdc++.h>
using namespace std;

int count_mushrooms(int n) {
	if(n < 220) {
		int B = 0;
		for(int i = 1; i < n; i++) {
			B += use_machine({0, i});
		}
		return n-B;
	}

	vector<int> perm;
	for(int i = 1; i < n; i++)
		perm.push_back(i);
	
	srand(time(0));

	vector<int> A, B;
	A = {0};
	if(use_machine({0,1})) B.push_back(1);
	else A.push_back(1);
	if(use_machine({0,2})) B.push_back(2);
	else A.push_back(2);

	if(B.size() > A.size()) swap(A,B);

	for(int i = 3; i < n && (A.size()-1)*(A.size()-1) < (n-A.size()-B.size()) && (B.size()-1)*(B.size()-1) < (n-A.size()-B.size()); i+=2) {
		vector<int> cur;
		cur.push_back(A[0]);
		cur.push_back(i);
		cur.push_back(A[1]);
		if(i+1 < n) cur.push_back(i+1);

		// for(auto x: cur) cerr << x << " ";
		// cerr << endl;
		int res = use_machine(cur);

		if(res & 2) B.push_back(i);
		else A.push_back(i);

		if(i+1 < n) {
			if(res & 1) B.push_back(i+1);
			else A.push_back(i+1);
		}
	}

	if(B.size() > A.size()) swap(A,B);

	int countA = 0;
	int countB = 0;
	for(int i = A.size()+B.size(); i < n;) {
		vector<int> cur;
		int j = 0;
		for(j = 0; i+j < n && j < A.size(); j++) {
			cur.push_back(A[j]);
			cur.push_back(i+j);
		}

		// for(auto x: cur) cerr << x << " ";
		// cerr << ": ";
		int res = use_machine(cur);
		countB += (res+1)/2;
		countA += j - ((res+1)/2);

		// cerr << i << ": " << A.size() << " " << res << " " << countA << endl;
		if(res % 2 == 1) {
			B.push_back(cur.back());
			countB--;
		} else {
			A.push_back(cur.back());
			countA--;
		}

		i += j;
		if(B.size() > A.size()) {
			swap(A,B);
			swap(countA, countB);
			// i--;
		}
	}

	if(A[0] == 0) return A.size()+countA;
	else return B.size()+countB;
}

Compilation message

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

Subtask #1
87.5969 / 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 1 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 276 KB Output is correct
7 Correct 7 ms 512 KB Output is correct
8 Correct 7 ms 512 KB Output is correct
9 Correct 9 ms 512 KB Output is correct
10 Correct 7 ms 512 KB Output is correct
11 Partially correct 8 ms 512 KB Output is partially correct
12 Correct 7 ms 512 KB Output is correct
13 Correct 9 ms 512 KB Output is correct
14 Correct 4 ms 384 KB Output is correct
15 Partially correct 7 ms 512 KB Output is partially correct
16 Partially correct 8 ms 512 KB Output is partially correct
17 Correct 4 ms 384 KB Output is correct
18 Correct 7 ms 512 KB Output is correct
19 Partially correct 8 ms 512 KB Output is partially correct
20 Correct 9 ms 512 KB Output is correct
21 Partially correct 7 ms 512 KB Output is partially correct
22 Partially correct 8 ms 512 KB Output is partially correct
23 Correct 7 ms 512 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Partially correct 8 ms 512 KB Output is partially correct
26 Partially correct 8 ms 512 KB Output is partially correct
27 Partially correct 8 ms 504 KB Output is partially correct
28 Partially correct 10 ms 512 KB Output is partially correct
29 Partially correct 8 ms 512 KB Output is partially correct
30 Partially correct 8 ms 512 KB Output is partially correct
31 Partially correct 9 ms 512 KB Output is partially correct
32 Partially correct 7 ms 512 KB Output is partially correct
33 Partially correct 8 ms 512 KB Output is partially correct
34 Partially correct 8 ms 512 KB Output is partially correct
35 Partially correct 8 ms 512 KB Output is partially correct
36 Partially correct 8 ms 512 KB Output is partially correct
37 Partially correct 8 ms 512 KB Output is partially correct
38 Partially correct 8 ms 512 KB Output is partially correct
39 Partially correct 8 ms 512 KB Output is partially correct
40 Partially correct 7 ms 512 KB Output is partially correct
41 Partially correct 8 ms 512 KB Output is partially correct
42 Partially correct 8 ms 512 KB Output is partially correct
43 Partially correct 8 ms 512 KB Output is partially correct
44 Partially correct 7 ms 512 KB Output is partially correct
45 Partially correct 8 ms 512 KB Output is partially correct
46 Partially correct 9 ms 512 KB Output is partially correct
47 Partially correct 7 ms 512 KB Output is partially correct
48 Partially correct 10 ms 512 KB Output is partially correct
49 Partially correct 9 ms 512 KB Output is partially correct
50 Partially correct 7 ms 512 KB Output is partially correct
51 Partially correct 8 ms 512 KB Output is partially correct
52 Partially correct 9 ms 512 KB Output is partially correct
53 Partially correct 8 ms 512 KB Output is partially correct
54 Partially correct 8 ms 512 KB Output is partially correct
55 Partially correct 8 ms 512 KB Output is partially correct
56 Partially correct 8 ms 512 KB Output is partially correct
57 Partially correct 8 ms 512 KB Output is partially correct
58 Partially correct 6 ms 512 KB Output is partially correct
59 Partially correct 8 ms 512 KB Output is partially correct
60 Partially correct 8 ms 512 KB Output is partially correct
61 Partially correct 9 ms 512 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 256 KB Output is correct
69 Correct 0 ms 256 KB Output is correct
70 Correct 1 ms 256 KB Output is correct
71 Correct 0 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 1 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 1 ms 256 KB Output is correct
85 Correct 0 ms 256 KB Output is correct
86 Correct 0 ms 256 KB Output is correct
87 Correct 1 ms 256 KB Output is correct
88 Correct 0 ms 256 KB Output is correct
89 Correct 1 ms 256 KB Output is correct
90 Correct 0 ms 256 KB Output is correct
91 Correct 1 ms 256 KB Output is correct