oj.uz

Submission #606465

# Submission time Handle Problem Language Result Execution time Memory
606465 2022-07-26T06:48:10 Z Tigryonochekk Counting Mushrooms (IOI20_mushrooms) C++17
92.623 / 100
 10 ms 356 KB 
#include <iostream>
#include "mushrooms.h"
#include <vector>
#define ll long long
using namespace std;

int n;
vector<int> a = { 0 }, b;
int ans = 1;

void findA(int p, int q, int i) {
	int u = use_machine({ p, i, q, i + 1 });
	if (u == 0) {
		a.push_back(i);
		a.push_back(i + 1);
		ans += 2;
	}
	else if (u == 1) {
		a.push_back(i);
		b.push_back(i + 1);
		ans++;
	}
	else if (u == 2) {
		b.push_back(i);
		a.push_back(i + 1);
		ans++;
	}
	else {
		b.push_back(i);
		b.push_back(i + 1);
	}
}

void findB(int p, int q, int i) {
	int u = use_machine({ p, i, q, i + 1 });
	if (u == 0) {
		b.push_back(i);
		b.push_back(i + 1);
	}
	else if (u == 1) {
		b.push_back(i);
		a.push_back(i + 1);
		ans++;
	}
	else if (u == 2) {
		a.push_back(i);
		b.push_back(i + 1);
		ans++;
	}
	else {
		a.push_back(i);
		a.push_back(i + 1);
		ans += 2;
	}
}

void execA(int s, int t) {
	if (s == t) return;
	vector<int> m;
	int j = 0;
	for (int i = s; i < t; i++) {
		m.push_back(a[j]);
		m.push_back(i);
		j++;
	}
	int u = use_machine(m);
	if (u % 2 == 1) {
		b.push_back(m.back());
	}
	else {
		a.push_back(m.back());
		ans++;
	}
	u -= (u % 2); // verjin@ hanum enq
	ans += t - s - 1 - u / 2;
}

void execB(int s, int t) {
	if (s == t) return;
	vector<int> m;
	int j = 0;
	for (int i = s; i < t; i++) {
		m.push_back(b[j]);
		m.push_back(i);
		j++;
	}
	int u = use_machine(m);
	if (u % 2 == 0) {
		b.push_back(m.back());
	}
	else {
		a.push_back(m.back());
		ans++;
	}
	u -= (u % 2); // verjin@ hanum enq
	ans += u / 2;
}

int count_mushrooms(int nigga) {
	n = nigga;
	if (n <= 450) {
		for (int i = 1; i < n - 1; i += 2) {
			ans += 2 - use_machine({ i, 0, i + 1 });
		}
		if (n % 2 == 0) {
			ans += 1 - use_machine({ n - 1, 0 });
		}
		return ans;
	}
	int x = 165;
	if (!use_machine({ 0, 1 })) {
		a.push_back(1);
		ans++;
	}
	else {
		b.push_back(1);
	}
	if (!use_machine({ 0, 2 })) {
		a.push_back(2);
		ans++;
	}
	else {
		b.push_back(2);
	}
	if (a.size() >= 2) {
		for (int i = 3; i < x; i += 2) {
			findA(a[0], a[1], i);
		}
	}
	else {
		for (int i = 3; i < x; i += 2) {
			findB(b[0], b[1], i);
		}
	}
	//cout << ans << endl;
	int s = x;
	while (s < n) {
		if (a.size() >= b.size()) {
			int t = min(n, s + (int)a.size());
			execA(s, t);
			//cout << " a " << s << " " << t << " " << ans << endl;
			s = t;
		}
		else {
			int t = min(n, s + (int)b.size());
			execB(s, t);
			//cout << " b " << s << " " << t << " " << ans << endl;
			s = t;
		}
	}
	return ans;
}

/*
12 
0 1 0 1 1 0 0 0 1 1 1 1 

11 
0 1 1 1 1 1 0 0 1 0 0

11 
0 0 0 1 1 0 0 0 1 1 0

*/

Subtask #1
92.623 / 100.0

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