oj.uz

Submission #1042807

# Submission time Handle Problem Language Result Execution time Memory
1042807 2024-08-03T11:52:47 Z AmirAli_H1 Counting Mushrooms (IOI20_mushrooms) C++17
92.623 / 100
 5 ms 740 KB 
// In the name of Allah

#include <bits/stdc++.h>
#include "mushrooms.h"
using namespace std;

typedef		long long int			ll;
typedef		long double				ld;
typedef		pair<int, int>			pii;
typedef		pair<ll, ll>			pll;
typedef		complex<ld>				cld;

#define		all(x)					(x).begin(),(x).end()
#define		len(x)					((ll) (x).size())
#define		F						first
#define		S						second
#define		pb						push_back
#define		sep						' '
#define		endl					'\n'
#define		Mp						make_pair
#define		kill(x)					cout << x << '\n', exit(0)
#define		set_dec(x)				cout << fixed << setprecision(x);
#define		file_io(x,y)			freopen(x, "r", stdin); freopen(y, "w", stdout);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int maxn = 20000 + 4;
const int M = 76;
vector<int> ls[2], lsx;
int col[maxn];

int count_mushrooms(int n) {
	int i = 0, T = 0;
	while (i < n) {
		if (i + 1 >= n || max(len(ls[0]), len(ls[1])) <= 1) {
			if (i == 0) col[i] = 0;
			else if (use_machine({0, i}) == 1) col[i] = 1;
			else col[i] = 0;
			T = 1;
		}
		else {
			int R = 0;
			if (len(ls[1]) >= len(ls[0])) R = 1;
			int x = use_machine({ls[R][0], i, ls[R][1], i + 1});
			if (x == 0) col[i] = col[i + 1] = R;
			else if (x == 1) {
				col[i] = R; col[i + 1] = 1 - R;
			}
			else if (x == 2) {
				col[i] = 1 - R; col[i + 1] = R;
			}
			else col[i] = col[i + 1] = 1 - R;
			T = 2;
		}
		while (T--) {
			ls[col[i]].pb(i); i++;
		}
		if (max(len(ls[0]), len(ls[1])) >= M) break;
	}
	
	int res = len(ls[0]);
	if (n <= i) return res;
	
	while (i < n) {
		int R = 0; lsx.clear();
		if (len(ls[1]) >= len(ls[0])) R = 1;
		int mx = max(len(ls[0]), len(ls[1]));
		for (int j = i; j < min(n, i + mx); j++) {
			lsx.pb(ls[R][j - i]); lsx.pb(j);
		}
		int x = use_machine(lsx);
		
		int t1 = (x + 1) / 2, t2 = (min(n, i + mx) - i) - t1;
		if (R == 1) res += t1;
		else res += t2;
		
		int j = min(n, i + mx) - 1;
		if (x % 2 == 1) col[j] = 1 - R;
		else col[j] = R;
		ls[col[j]].pb(j); i += mx;
	}
	return res;
}

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 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 3 ms 344 KB Output is correct
8 Correct 3 ms 344 KB Output is correct
9 Correct 5 ms 740 KB Output is correct
10 Correct 3 ms 544 KB Output is correct
11 Partially correct 3 ms 344 KB Output is partially correct
12 Correct 3 ms 344 KB Output is correct
13 Correct 5 ms 528 KB Output is correct
14 Correct 2 ms 344 KB Output is correct
15 Partially correct 4 ms 600 KB Output is partially correct
16 Partially correct 3 ms 344 KB Output is partially correct
17 Correct 2 ms 492 KB Output is correct
18 Correct 3 ms 344 KB Output is correct
19 Partially correct 5 ms 540 KB Output is partially correct
20 Correct 2 ms 344 KB Output is correct
21 Correct 3 ms 344 KB Output is correct
22 Partially correct 3 ms 480 KB Output is partially correct
23 Correct 3 ms 512 KB Output is correct
24 Correct 2 ms 340 KB Output is correct
25 Partially correct 3 ms 344 KB Output is partially correct
26 Partially correct 3 ms 484 KB Output is partially correct
27 Partially correct 3 ms 344 KB Output is partially correct
28 Partially correct 3 ms 472 KB Output is partially correct
29 Partially correct 4 ms 532 KB Output is partially correct
30 Partially correct 3 ms 344 KB Output is partially correct
31 Partially correct 3 ms 492 KB Output is partially correct
32 Partially correct 3 ms 344 KB Output is partially correct
33 Partially correct 3 ms 344 KB Output is partially correct
34 Partially correct 3 ms 344 KB Output is partially correct
35 Partially correct 3 ms 344 KB Output is partially correct
36 Partially correct 4 ms 724 KB Output is partially correct
37 Partially correct 3 ms 344 KB Output is partially correct
38 Partially correct 3 ms 516 KB Output is partially correct
39 Partially correct 3 ms 344 KB Output is partially correct
40 Partially correct 3 ms 344 KB Output is partially correct
41 Partially correct 3 ms 488 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 3 ms 344 KB Output is partially correct
45 Partially correct 3 ms 344 KB Output is partially correct
46 Partially correct 3 ms 344 KB Output is partially correct
47 Partially correct 3 ms 468 KB Output is partially correct
48 Partially correct 5 ms 344 KB Output is partially correct
49 Partially correct 3 ms 344 KB Output is partially correct
50 Partially correct 4 ms 548 KB Output is partially correct
51 Partially correct 5 ms 344 KB Output is partially correct
52 Partially correct 3 ms 344 KB Output is partially correct
53 Partially correct 3 ms 500 KB Output is partially correct
54 Partially correct 3 ms 344 KB Output is partially correct
55 Partially correct 2 ms 344 KB Output is partially correct
56 Partially correct 3 ms 344 KB Output is partially correct
57 Partially correct 2 ms 344 KB Output is partially correct
58 Partially correct 3 ms 344 KB Output is partially correct
59 Partially correct 3 ms 344 KB Output is partially correct
60 Partially correct 3 ms 476 KB Output is partially correct
61 Partially correct 4 ms 344 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 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 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 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 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 0 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