oj.uz

Submission #423562

# Submission time Handle Problem Language Result Execution time Memory
423562 2021-06-11T09:27:49 Z Mazaalai Counting Mushrooms (IOI20_mushrooms) C++14
92.623 / 100
 11 ms 556 KB 
#include "mushrooms.h"
#include <bits/stdc++.h>
using namespace std;
int count_mushrooms(int n) {
    int opt = 1e9, k = 80;
	vector <int> a(1, 0), b;
	{
		int res = use_machine({0, 1});
		if (res == 0) a.push_back(1);
		else b.push_back(1);
	}
	if (n == 2) return a.size();
	{ 
		int res = use_machine({0, 2});
		if (res == 0) a.push_back(2);
		else b.push_back(2);
	}
	int idx = 3;
	while (idx+1 < n && a.size() < k && b.size() < k) {
		// cout << "OPEN\n";
		int x, y;
		if (a.size() >= 2) {
			x = a[0], y = a[1];
		} else {
			x = b[0], y = b[1];
		}
		int val = use_machine({idx, x, idx+1, y});
		if (a.size() >= 2) {
			if (val == 0) {
				a.push_back(idx);
				a.push_back(idx+1);
			}
			if (val == 1) {
				b.push_back(idx);
				a.push_back(idx+1);
			}
			if (val == 2) {
				a.push_back(idx);
				b.push_back(idx+1);
			}
			if (val == 3) {
				b.push_back(idx);
				b.push_back(idx+1);
			}
		} else {
			if (val == 0) {
				b.push_back(idx);
				b.push_back(idx+1);
			}
			if (val == 1) {
				a.push_back(idx);
				b.push_back(idx+1);
			}
			if (val == 2) {
				b.push_back(idx);
				a.push_back(idx+1);
			}
			if (val == 3) {
				a.push_back(idx);
				a.push_back(idx+1);
			}
		}
		idx+=2;
	}
	int ans = a.size();
	while(idx < n) {
		k = max(a.size(), b.size());
		bool O = a.size() >= b.size();
		int st = idx, end = min(n-1, idx + k - 1);
		int len = end - st + 1;
		vector <int> tmp;
		for (int i = 0; i < len; i++) {
			tmp.push_back(i + st);
			if (O)
				tmp.push_back(a[i]);
			else
				tmp.push_back(b[i]);
		}
		int k = use_machine(tmp), k1 = k;
		k = ((k&1)+k)/2;
		if (O) ans += len - k;
		else ans += k;
		
		if (k1 & 1) {
			if (O) b.push_back(idx);
			else {
				a.push_back(idx);
			}
		} else {
			if (!O) b.push_back(idx);
			else {
				a.push_back(idx);
			}
		}
		idx += len;
	}
	return ans;
}

Compilation message

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:19:31: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   19 |  while (idx+1 < n && a.size() < k && b.size() < k) {
      |                      ~~~~~~~~~^~~
mushrooms.cpp:19:47: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   19 |  while (idx+1 < n && a.size() < k && b.size() < k) {
      |                                      ~~~~~~~~~^~~
mushrooms.cpp:5:9: warning: unused variable 'opt' [-Wunused-variable]
    5 |     int opt = 1e9, k = 80;
      |         ^~~

Subtask #1
92.623 / 100.0

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