oj.uz

Submission #624717

# Submission time Handle Problem Language Result Execution time Memory
624717 2022-08-08T16:01:47 Z ollel Counting Mushrooms (IOI20_mushrooms) C++14
92.623 / 100
 11 ms 352 KB 
using namespace std;
#include <bits/stdc++.h>

#include "mushrooms.h"

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long long ll;
typedef vector<bool> vb;
typedef pair<int,int> pii;

#define rep(i,a,b) for(int i = a; i < b; i++)
#define pb push_back

set<int> A, B;
int n;

int nextQuery = 1;
int ans = 1;

void qa() {
	cerr << "a\n";
	vi Q;
	for (auto a : A) {
		Q.pb(a);
		Q.pb(nextQuery);
		nextQuery++;
		if (nextQuery == n) break;
	}

	int x = use_machine(Q);
	int number_queried = Q.size() / 2;
	int bs = x/2 + (x&1);
	ans += number_queried - bs;
	cerr << number_queried << " " << number_queried - bs << endl;
	if (x & 1) B.insert(Q[Q.size() - 1]);
	else A.insert(Q[Q.size() - 1]);
}

void qb() {
	cerr << "b\n";
	vi Q;
	for (auto a : B) {
		Q.pb(a);
		Q.pb(nextQuery);
		nextQuery++;
		if (nextQuery == n) break;
	}

	int x = use_machine(Q);
	int number_queried = Q.size() / 2;
	int as = x/2 + (x&1);
	ans += as;
	cerr << number_queried << " " << as << endl;

	if (x & 1) A.insert(Q[Q.size() - 1]);
	else B.insert(Q[Q.size() - 1]);
}

void make_query() {
	if (A.size() > B.size()) qa();
	else qb();
}

void make_2_query() {
	if (nextQuery >= n - 1) return;
	vi Q;
	int x1 = nextQuery;
	int x2 = nextQuery+1;
	nextQuery += 2;
	if (A.size() >= 2) {
		auto ai = A.begin();
		int a1 = *ai;
		ai++;
		int a2 = *ai;
		Q = {a1, x1, a2, x2};
	} else {
		auto bi = B.begin();
		int b1 = *bi;
		bi++;
		int b2 = *bi;
		Q = {b1, x1, b2, x2};
	}
	int res = use_machine(Q);
	if (A.size() >= 2) {
		if (res == 0) {
			A.insert(x1);
			A.insert(x2);
			ans+=2;
		} else if (res == 1) {
			A.insert(x1);
			B.insert(x2);
			ans++;
		} else if (res == 2) {
			B.insert(x1);
			A.insert(x2);
			ans++;
		} else {
			B.insert(x1);
			B.insert(x2);
		}
	} else {
		if (res == 0) {
			B.insert(x1);
			B.insert(x2);
		} else if (res == 1) {
			B.insert(x1);
			A.insert(x2);
			ans++;
		} else if (res == 2) {
			A.insert(x1);
			B.insert(x2);
			ans++;
		} else {
			A.insert(x1);
			A.insert(x2);
			ans+=2;

		}
	}
}

void printSets() {
	cout << "A: "; for (auto a:A) cout << a << " "; cout << endl;
	cout << "B: "; for (auto b:B) cout << b << " "; cout << endl << endl;
}


int count_mushrooms(int N) {
	n = N;
	A.insert(0);


	rep(i,0,2) if (nextQuery != n) make_query();
	int MAGIC_NUMBER = 73;
	rep(i,0,MAGIC_NUMBER) {
		if (nextQuery > n - 2) break;
		make_2_query();
	}

	while (nextQuery != n) make_query();
	return ans;
}

Subtask #1
92.623 / 100.0

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