oj.uz

Submission #1047564

# Submission time Handle Problem Language Result Execution time Memory
1047564 2024-08-07T14:04:22 Z DorostWef Counting Mushrooms (IOI20_mushrooms) C++17
92.623 / 100
 6 ms 600 KB 
#include "mushrooms.h"
#include <bits/stdc++.h>

using namespace std;
const int K = 75;

int count_mushrooms(int n) {
	vector <int> a;
	for (int i = 1; i < n; i++)
		a.push_back(i);
	mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
	shuffle(a.begin(), a.end(), rng);
	int ans = 1;
	vector <int> A = {0}, B;
	while (!a.empty()) {
		vector <int> v;
		int mx = max ((int)A.size(), (int)B.size());
		if (mx == 1 || (int)A.size() + (int)B.size() >= K * 2 || (int)a.size() < 2) {
			if ((int)A.size() >= (int)B.size()) {
				int t = 0;
				for (int i = 0; i < (int) A.size() && !a.empty(); i++) {
					t++;
					v.push_back(a.back());
					v.push_back(A[i]);
					a.pop_back();
				}
				int k = use_machine (v);
				if (k % 2)
					B.push_back(v[0]);
				else
					A.push_back(v[0]);
				k = t - ((k + 1) / 2);
				ans += k;
			} else {
				int t = 0;
				for (int i = 0; i < (int) B.size() && !a.empty(); i++) {
					t++;
					v.push_back(a.back());
					v.push_back(B[i]);
					a.pop_back();
				}
				int k = use_machine (v);
				if (k % 2)
					A.push_back(v[0]);
				else
					B.push_back(v[0]);
				k = ((k + 1) / 2);
				ans += k;
			}
		} else {
			int sz = (int)a.size();
			if ((int)A.size() >= 2) {
				int k = use_machine ({A[0], a[sz - 2], A[1], a[sz - 1]});
				if (k >= 2) {
					B.push_back(a[sz - 2]);
				} else {
					ans++;
					A.push_back(a[sz - 2]);
				}
				if (k % 2 == 0) {
					A.push_back(a[sz - 1]);
					ans++;
				} else {
					B.push_back(a[sz - 1]);
				}
			} else {
				int k = use_machine ({B[0], a[sz - 2], B[1], a[sz - 1]});
				if (k >= 2) {
					A.push_back(a[sz - 2]);
					ans++;
				} else {
					B.push_back(a[sz - 2]);
				}
				if (k % 2 == 0) {
					B.push_back(a[sz - 1]);
				} else {
					ans++;
					A.push_back(a[sz - 1]);
				}
			}
			a.pop_back();
			a.pop_back();
		}
	}
	return ans;
}

Subtask #1
92.623 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 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 5 ms 600 KB Output is correct
8 Correct 3 ms 600 KB Output is correct
9 Correct 4 ms 600 KB Output is correct
10 Correct 4 ms 600 KB Output is correct
11 Partially correct 4 ms 600 KB Output is partially correct
12 Correct 4 ms 600 KB Output is correct
13 Correct 5 ms 600 KB Output is correct
14 Correct 2 ms 600 KB Output is correct
15 Partially correct 5 ms 600 KB Output is partially correct
16 Partially correct 3 ms 600 KB Output is partially correct
17 Correct 2 ms 552 KB Output is correct
18 Correct 3 ms 600 KB Output is correct
19 Partially correct 3 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 2 ms 344 KB Output is correct
25 Partially correct 3 ms 600 KB Output is partially correct
26 Partially correct 3 ms 600 KB Output is partially correct
27 Partially correct 4 ms 600 KB Output is partially correct
28 Partially correct 3 ms 600 KB Output is partially correct
29 Partially correct 4 ms 600 KB Output is partially correct
30 Partially correct 5 ms 600 KB Output is partially correct
31 Partially correct 5 ms 600 KB Output is partially correct
32 Partially correct 6 ms 600 KB Output is partially correct
33 Partially correct 5 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 3 ms 600 KB Output is partially correct
38 Partially correct 5 ms 600 KB Output is partially correct
39 Partially correct 5 ms 600 KB Output is partially correct
40 Partially correct 4 ms 600 KB Output is partially correct
41 Partially correct 3 ms 600 KB Output is partially correct
42 Partially correct 3 ms 600 KB Output is partially correct
43 Partially correct 3 ms 600 KB Output is partially correct
44 Partially correct 4 ms 600 KB Output is partially correct
45 Partially correct 5 ms 600 KB Output is partially correct
46 Partially correct 3 ms 600 KB Output is partially correct
47 Partially correct 3 ms 600 KB Output is partially correct
48 Partially correct 3 ms 600 KB Output is partially correct
49 Partially correct 3 ms 600 KB Output is partially correct
50 Partially correct 3 ms 600 KB Output is partially correct
51 Partially correct 4 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 5 ms 600 KB Output is partially correct
56 Partially correct 3 ms 600 KB Output is partially correct
57 Partially correct 4 ms 600 KB Output is partially correct
58 Partially correct 3 ms 600 KB Output is partially correct
59 Partially correct 4 ms 600 KB Output is partially correct
60 Partially correct 5 ms 600 KB Output is partially correct
61 Partially correct 3 ms 600 KB Output is partially correct
62 Correct 0 ms 344 KB Output is correct
63 Correct 0 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 1 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 0 ms 344 KB Output is correct
70 Correct 0 ms 344 KB Output is correct
71 Correct 0 ms 344 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 1 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 0 ms 344 KB Output is correct
84 Correct 0 ms 344 KB Output is correct
85 Correct 0 ms 344 KB Output is correct
86 Correct 1 ms 344 KB Output is correct
87 Correct 0 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 0 ms 344 KB Output is correct