oj.uz

Submission #1079730

# Submission time Handle Problem Language Result Execution time Memory
1079730 2024-08-28T23:22:14 Z ArthuroWich Counting Mushrooms (IOI20_mushrooms) C++17
92.623 / 100
 6 ms 600 KB 
#include "mushrooms.h"
#include<bits/stdc++.h>
using namespace std;
int count_mushrooms(int n) {
	int ans = 0, m = min(75, n);
	if (n <= 400) {
		for (int i = 1; i+1 < n; i += 2) {
			ans += use_machine({i, 0, i+1});
		}
		if (n % 2 == 0) {
			ans += use_machine({0, n-1});
		}
		return n-ans;
	}
	int as = 0, bs = 0;
	vector<int> a, b, st;
	a.push_back(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() == 2) {
		swap(a, b);
	}
	for (int i = n-1; i >= 3; i--) {
		st.push_back(i);
	}
	for (int i = 0; i < m; i++) {
		int f1 = st.back(), f2;
		st.pop_back();
		f2 = st.back();
		st.pop_back();
		int v = use_machine({f1, a[0], f2, a[1]});
		if (v == 0) {
			a.push_back(f1);
			a.push_back(f2);
		} else if (v == 1) {
			b.push_back(f1);
			a.push_back(f2);
		} else if (v == 2) {
			a.push_back(f1);
			b.push_back(f2);
		} else {
			b.push_back(f1);
			b.push_back(f2);
		}
	}
	if (b.size() > a.size()) {
		swap(a, b);
	}
	as = a.size();
	bs = b.size();
	while(!st.empty()) {
		int va = 0, vb = 0, vn = 0, v;
		vector<int> query;
		for (int i = 0; i < a.size() && !st.empty(); i++) {
			query.push_back(st.back());
			st.pop_back();
			query.push_back(a[i]);
			vn++;
		}
		v = use_machine(query);
		vb = (v+1)/2;
		va = vn-vb;
		as += va;
		bs += vb;
		if (v & 1) {
			b.push_back(query[0]);
		} else {
			a.push_back(query[0]);
		}
		if (b.size() > a.size()) {
			swap(as, bs);
			swap(a, b);
		}
	}
	if (count(b.begin(), b.end(), 0)) {
		swap(as, bs);
	}
	return as;
}

Compilation message

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

Subtask #1
92.623 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 3 ms 600 KB Output is correct
8 Correct 4 ms 600 KB Output is correct
9 Correct 5 ms 600 KB Output is correct
10 Correct 3 ms 600 KB Output is correct
11 Partially correct 4 ms 600 KB Output is partially correct
12 Correct 3 ms 600 KB Output is correct
13 Correct 3 ms 600 KB Output is correct
14 Correct 2 ms 344 KB Output is correct
15 Partially correct 3 ms 600 KB Output is partially correct
16 Partially correct 4 ms 600 KB Output is partially correct
17 Correct 3 ms 344 KB Output is correct
18 Correct 5 ms 600 KB Output is correct
19 Partially correct 5 ms 600 KB Output is partially correct
20 Correct 3 ms 600 KB Output is correct
21 Correct 3 ms 600 KB Output is correct
22 Partially correct 3 ms 600 KB Output is partially correct
23 Correct 4 ms 600 KB Output is correct
24 Correct 3 ms 560 KB Output is correct
25 Partially correct 6 ms 600 KB Output is partially correct
26 Partially correct 4 ms 600 KB Output is partially correct
27 Partially correct 6 ms 600 KB Output is partially correct
28 Partially correct 4 ms 600 KB Output is partially correct
29 Partially correct 4 ms 444 KB Output is partially correct
30 Partially correct 4 ms 600 KB Output is partially correct
31 Partially correct 4 ms 600 KB Output is partially correct
32 Partially correct 4 ms 600 KB Output is partially correct
33 Partially correct 4 ms 600 KB Output is partially correct
34 Partially correct 3 ms 600 KB Output is partially correct
35 Partially correct 3 ms 600 KB Output is partially correct
36 Partially correct 3 ms 600 KB Output is partially correct
37 Partially correct 4 ms 600 KB Output is partially correct
38 Partially correct 5 ms 600 KB Output is partially correct
39 Partially correct 4 ms 600 KB Output is partially correct
40 Partially correct 3 ms 600 KB Output is partially correct
41 Partially correct 3 ms 600 KB Output is partially correct
42 Partially correct 6 ms 600 KB Output is partially correct
43 Partially correct 4 ms 600 KB Output is partially correct
44 Partially correct 4 ms 600 KB Output is partially correct
45 Partially correct 3 ms 600 KB Output is partially correct
46 Partially correct 4 ms 600 KB Output is partially correct
47 Partially correct 3 ms 600 KB Output is partially correct
48 Partially correct 5 ms 600 KB Output is partially correct
49 Partially correct 3 ms 600 KB Output is partially correct
50 Partially correct 4 ms 600 KB Output is partially correct
51 Partially correct 3 ms 600 KB Output is partially correct
52 Partially correct 4 ms 600 KB Output is partially correct
53 Partially correct 3 ms 600 KB Output is partially correct
54 Partially correct 3 ms 600 KB Output is partially correct
55 Partially correct 4 ms 600 KB Output is partially correct
56 Partially correct 4 ms 600 KB Output is partially correct
57 Partially correct 3 ms 600 KB Output is partially correct
58 Partially correct 3 ms 600 KB Output is partially correct
59 Partially correct 3 ms 600 KB Output is partially correct
60 Partially correct 3 ms 600 KB Output is partially correct
61 Partially correct 4 ms 600 KB Output is partially correct
62 Correct 0 ms 344 KB Output is correct
63 Correct 1 ms 344 KB Output is correct
64 Correct 0 ms 344 KB Output is correct
65 Correct 0 ms 344 KB Output is correct
66 Correct 0 ms 344 KB Output is correct
67 Correct 0 ms 344 KB Output is correct
68 Correct 0 ms 344 KB Output is correct
69 Correct 1 ms 344 KB Output is correct
70 Correct 0 ms 344 KB Output is correct
71 Correct 0 ms 596 KB Output is correct
72 Correct 0 ms 344 KB Output is correct
73 Correct 0 ms 344 KB Output is correct
74 Correct 0 ms 344 KB Output is correct
75 Correct 0 ms 344 KB Output is correct
76 Correct 0 ms 344 KB Output is correct
77 Correct 0 ms 344 KB Output is correct
78 Correct 0 ms 344 KB Output is correct
79 Correct 0 ms 344 KB Output is correct
80 Correct 0 ms 344 KB Output is correct
81 Correct 0 ms 344 KB Output is correct
82 Correct 0 ms 344 KB Output is correct
83 Correct 1 ms 344 KB Output is correct
84 Correct 1 ms 344 KB Output is correct
85 Correct 1 ms 344 KB Output is correct
86 Correct 0 ms 344 KB Output is correct
87 Correct 1 ms 344 KB Output is correct
88 Correct 0 ms 344 KB Output is correct
89 Correct 0 ms 344 KB Output is correct
90 Correct 0 ms 344 KB Output is correct
91 Correct 1 ms 344 KB Output is correct