Submission #1060156

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1060156	2024-08-15T11:04:45 Z	AmirAli_H1	Rarest Insects (IOI22_insects)	C++17	96.61 / 100	50 ms	856 KB

insects

// 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, sz, res;
set<int> st; vector<int> ls;
int M[maxn], Mx[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);
	}
}

void cal_sz() {
	sz = 0;
	for (int i = 0; i < n; i++) {
		if (!M[i]) sz++;
	}
}

void checkx(ll R) {
	del_all();
	fill(Mx, Mx + n, 0); int cnt = 0;
	for (int i = 0; i < n; i++) {
		if (M[i]) continue;
		addx(i);
		if (askx() > R) delx(i);
		else {
			Mx[i] = 1; cnt++;
		}
	}
	if (cnt == k * R) {
		res += R;
		for (int i = 0; i < n; i++) {
			if (M[i]) continue;
			if (Mx[i]) M[i] = 1;
		}
	}
	else {
		del_all();
		for (int i = n - 1; i >= 0; i--) {
			if (M[i]) continue;
			if (!Mx[i]) {
				M[i] = 1;
				addx(i);
				if (askx() > 1) delx(i);
			}
		}
		k -= len(st);
		for (int i = n - 1; i >= 0; i--) {
			if (M[i]) continue;
			addx(i);
			if (askx() > 1) M[i] = 1;
			delx(i);
		}
	}
	
	cal_sz();
}

int min_cardinality(int N) {
	n = N; sz = n;
	
	for (int i = 0; i < n; i++) {
		addx(i);
		if (askx() > 1) delx(i);
	}
	for (int j : st) {
		ls.pb(j); M[j] = 1;
	}
	k = len(ls);
	
	res += 1; cal_sz();
	while (sz >= k) {
		int h = (sz / k);
		checkx(max(1, (h * 2) / 5));
	}
	
	return res;
}

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

Subtask #3
71.61 / 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	600 KB	Output is correct
6	Partially correct	0 ms	344 KB	Output is partially correct
7	Partially correct	28 ms	592 KB	Output is partially correct
8	Correct	6 ms	600 KB	Output is correct
9	Partially correct	32 ms	600 KB	Output is partially correct
10	Partially correct	37 ms	600 KB	Output is partially correct
11	Correct	37 ms	440 KB	Output is correct
12	Correct	14 ms	344 KB	Output is correct
13	Correct	26 ms	428 KB	Output is correct
14	Correct	36 ms	440 KB	Output is correct
15	Partially correct	31 ms	344 KB	Output is partially correct
16	Partially correct	49 ms	592 KB	Output is partially correct
17	Partially correct	36 ms	696 KB	Output is partially correct
18	Partially correct	40 ms	440 KB	Output is partially correct
19	Partially correct	43 ms	428 KB	Output is partially correct
20	Partially correct	30 ms	444 KB	Output is partially correct
21	Partially correct	32 ms	696 KB	Output is partially correct
22	Partially correct	34 ms	592 KB	Output is partially correct
23	Correct	25 ms	440 KB	Output is correct
24	Correct	20 ms	344 KB	Output is correct
25	Correct	25 ms	468 KB	Output is correct
26	Correct	11 ms	344 KB	Output is correct
27	Partially correct	36 ms	696 KB	Output is partially correct
28	Partially correct	42 ms	608 KB	Output is partially correct
29	Partially correct	33 ms	344 KB	Output is partially correct
30	Partially correct	50 ms	420 KB	Output is partially correct
31	Partially correct	48 ms	592 KB	Output is partially correct
32	Partially correct	37 ms	688 KB	Output is partially correct
33	Correct	31 ms	592 KB	Output is correct
34	Correct	25 ms	344 KB	Output is correct
35	Partially correct	39 ms	344 KB	Output is partially correct
36	Partially correct	36 ms	452 KB	Output is partially correct
37	Partially correct	27 ms	344 KB	Output is partially correct
38	Partially correct	32 ms	464 KB	Output is partially correct
39	Partially correct	47 ms	620 KB	Output is partially correct
40	Partially correct	40 ms	632 KB	Output is partially correct
41	Partially correct	34 ms	444 KB	Output is partially correct
42	Partially correct	39 ms	416 KB	Output is partially correct
43	Partially correct	6 ms	436 KB	Output is partially correct
44	Partially correct	29 ms	600 KB	Output is partially correct
45	Partially correct	39 ms	428 KB	Output is partially correct
46	Correct	17 ms	484 KB	Output is correct
47	Correct	14 ms	480 KB	Output is correct
48	Correct	15 ms	600 KB	Output is correct

Submission #1060156

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 15.0 / 15.0

Subtask #3 71.61 / 75.0

Subtask #1
10.0 / 10.0

Subtask #2
15.0 / 15.0

Subtask #3
71.61 / 75.0