oj.uz

Submission #1060008

# Submission time Handle Problem Language Result Execution time Memory
1060008 2024-08-15T10:01:42 Z AmirAli_H1 Rarest Insects (IOI22_insects) C++17
70 / 100
 97 ms 984 KB 
// In the name of Allah

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

typedef		long long			ll;
typedef		pair<int, int>		pii;
typedef		pair<ll, ll>		pll;

#define		endl				'\n'
#define		sep					' '
#define		F					first
#define		S					second
#define		Mp					make_pair
#define		pb					push_back
#define		all(x)				(x).begin(),(x).end()
#define		len(x)				((ll) (x).size())

const int maxn = 2000 + 4;

int n, k;
set<int> st; int res;
vector<int> ls; int cnt[maxn];
int M[maxn], val[maxn];

void addx(int j) {
	st.insert(j); move_inside(j);
}

void delx(int j) {
	st.erase(j); move_outside(j);
}

int askx() {
	return press_button();
}

void del_all() {
	while (!st.empty()) {
		int j = *st.begin();
		delx(j);
	}
}

bool checkx(ll x) {
	del_all();
	for (int i = 0; i < n; i++) {
		addx(i);
		if (askx() > x) delx(i);
	}
	return (len(st) == k * x);
}

int solve1(int R) {
	int l = 1, r = R + 1;
	while (r - l > 1) {
		int mid = (l + r) / 2;
		if (checkx(mid)) l = mid;
		else r = mid;
	}
	return l;
}

int solve2(int R) {
	for (int j = __lg(R); j >= 0; j--) {
		del_all();
		for (int i = 0; i < k; i++) {
			if (i & (1 << j)) addx(ls[i]);
		}
		for (int i = 0; i < n; i++) {
			if (M[i]) continue;
			addx(i);
			if (askx() == 2) val[i] += (1 << j);
			delx(i);
		}
	}
	for (int i = 0; i < n; i++) cnt[val[i]]++;
	
	int mn = n;
	for (int i = 0; i < n; i++) mn = min(mn, cnt[val[i]]);
	return mn;
}

int min_cardinality(int N) {
	n = N;
	
	for (int i = 0; i < n; i++) {
		addx(i);
		if (askx() >= 2) delx(i);
	}
	for (int j : st) ls.pb(j);
	k = len(ls);
	
	for (int j = 0; j < k; j++) {
		val[ls[j]] = j; M[ls[j]] = 1;
	}
	
	del_all();
	if ((n / k) <= k) return solve1(n / k);
	else return solve2(k);
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 2 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 5 ms 344 KB Output is correct
9 Correct 7 ms 600 KB Output is correct
10 Correct 3 ms 600 KB Output is correct
11 Correct 1 ms 436 KB Output is correct
12 Correct 2 ms 444 KB Output is correct
13 Correct 4 ms 344 KB Output is correct
14 Correct 5 ms 344 KB Output is correct
15 Correct 4 ms 344 KB Output is correct
16 Correct 4 ms 444 KB Output is correct
17 Correct 4 ms 344 KB Output is correct
18 Correct 7 ms 344 KB Output is correct
19 Correct 4 ms 344 KB Output is correct
20 Correct 3 ms 600 KB Output is correct
21 Correct 2 ms 700 KB Output is correct
22 Correct 1 ms 344 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 2 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 5 ms 344 KB Output is correct
9 Correct 7 ms 600 KB Output is correct
10 Correct 3 ms 600 KB Output is correct
11 Correct 1 ms 436 KB Output is correct
12 Correct 2 ms 444 KB Output is correct
13 Correct 4 ms 344 KB Output is correct
14 Correct 5 ms 344 KB Output is correct
15 Correct 4 ms 344 KB Output is correct
16 Correct 4 ms 444 KB Output is correct
17 Correct 4 ms 344 KB Output is correct
18 Correct 7 ms 344 KB Output is correct
19 Correct 4 ms 344 KB Output is correct
20 Correct 3 ms 600 KB Output is correct
21 Correct 2 ms 700 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 11 ms 684 KB Output is correct
24 Correct 3 ms 344 KB Output is correct
25 Correct 26 ms 600 KB Output is correct
26 Correct 32 ms 600 KB Output is correct
27 Correct 17 ms 440 KB Output is correct
28 Correct 4 ms 456 KB Output is correct
29 Correct 19 ms 592 KB Output is correct
30 Correct 39 ms 420 KB Output is correct
31 Correct 16 ms 600 KB Output is correct
32 Correct 19 ms 600 KB Output is correct
33 Correct 15 ms 344 KB Output is correct
34 Correct 21 ms 436 KB Output is correct
35 Correct 22 ms 420 KB Output is correct
36 Correct 29 ms 676 KB Output is correct
37 Correct 24 ms 344 KB Output is correct
38 Correct 17 ms 600 KB Output is correct
39 Correct 13 ms 600 KB Output is correct
40 Correct 11 ms 600 KB Output is correct
41 Correct 5 ms 344 KB Output is correct

Subtask #3
45.0 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 23 ms 672 KB Output is correct
8 Correct 11 ms 592 KB Output is correct
9 Partially correct 83 ms 848 KB Output is partially correct
10 Partially correct 72 ms 600 KB Output is partially correct
11 Correct 21 ms 344 KB Output is correct
12 Correct 18 ms 588 KB Output is correct
13 Partially correct 43 ms 432 KB Output is partially correct
14 Partially correct 82 ms 432 KB Output is partially correct
15 Partially correct 48 ms 432 KB Output is partially correct
16 Partially correct 58 ms 424 KB Output is partially correct
17 Partially correct 50 ms 340 KB Output is partially correct
18 Partially correct 65 ms 672 KB Output is partially correct
19 Partially correct 55 ms 588 KB Output is partially correct
20 Partially correct 73 ms 432 KB Output is partially correct
21 Partially correct 65 ms 592 KB Output is partially correct
22 Partially correct 70 ms 344 KB Output is partially correct
23 Partially correct 40 ms 696 KB Output is partially correct
24 Correct 30 ms 592 KB Output is correct
25 Correct 21 ms 700 KB Output is correct
26 Correct 13 ms 600 KB Output is correct
27 Partially correct 69 ms 712 KB Output is partially correct
28 Partially correct 73 ms 660 KB Output is partially correct
29 Partially correct 66 ms 424 KB Output is partially correct
30 Partially correct 73 ms 436 KB Output is partially correct
31 Partially correct 79 ms 712 KB Output is partially correct
32 Partially correct 69 ms 964 KB Output is partially correct
33 Partially correct 62 ms 672 KB Output is partially correct
34 Partially correct 53 ms 472 KB Output is partially correct
35 Partially correct 75 ms 984 KB Output is partially correct
36 Partially correct 97 ms 952 KB Output is partially correct
37 Partially correct 52 ms 592 KB Output is partially correct
38 Partially correct 77 ms 716 KB Output is partially correct
39 Partially correct 58 ms 848 KB Output is partially correct
40 Partially correct 55 ms 900 KB Output is partially correct
41 Partially correct 97 ms 720 KB Output is partially correct
42 Partially correct 68 ms 344 KB Output is partially correct
43 Partially correct 8 ms 344 KB Output is partially correct
44 Partially correct 32 ms 344 KB Output is partially correct
45 Correct 31 ms 344 KB Output is correct
46 Correct 21 ms 700 KB Output is correct
47 Correct 17 ms 720 KB Output is correct
48 Correct 23 ms 700 KB Output is correct