답안 #1025321

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1025321 2024-07-16T19:54:06 Z Issa 드문 곤충 (IOI22_insects) C++17
99.99 / 100
36 ms 600 KB
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
pair<int, int> pii;

const int maxn = 1e5 + 100;

int n, d, sz;
int used[maxn];
int f[maxn];
int p[maxn];

void move_inside(int i);
void move_outside(int i);
int press_button();

void add(int i){
	sz++;
	used[i] = 1;
	move_inside(i);
}
void del(int i){
	sz--;
	used[i] = 0;
	move_outside(i);
}
void clear(){
	for(int i = 1; i <= n; i++){
		if(used[i]) del(i);
	}
}

bool ok(int k){
	bool res = 0;
	for(int i = 0; i < n; i++){
		if(used[p[i]]) continue;
		add(p[i]);
		if(press_button() > k){
			del(p[i]);
		} else{
			if(sz >= d * k){
				res = 1;
				break;
			}
		}
	}
	if(res){
		for(int i = 0; i < n; i++){
			if(used[p[i]]) used[p[i]] = 2;
		}
	} else{
		for(int i = 0; i < n; i++){
			if(used[p[i]] == 1){
				del(p[i]);
			} else if(used[p[i]] == 0){
				used[p[i]] = 2;
			}
		}
	}
	return res;
}

int min_cardinality(int N){
	d = 0; n = N;
	srand(time(0));
	for(int i = 0; i < n; i++){
		p[i] = i;
	}
	random_shuffle(p, p + n);
	for(int i = N - 1; i >= 0; i--){
		add(p[i]);
		if(press_button() == 1) d++;
		else del(p[i]);
	} clear();
	int ans = 1;
	for(int l = 2, r = n / d; l <= r;){
		int mid = (l + r) >> 1;
		if(!ok(mid)) r = mid - 1;
		else l = mid + 1, ans = mid;
	}
	return ans;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 368 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 2 ms 344 KB Output is correct
8 Correct 3 ms 344 KB Output is correct
9 Correct 3 ms 344 KB Output is correct
10 Correct 3 ms 340 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 3 ms 344 KB Output is correct
13 Correct 3 ms 344 KB Output is correct
14 Correct 4 ms 344 KB Output is correct
15 Correct 3 ms 344 KB Output is correct
16 Correct 2 ms 344 KB Output is correct
17 Correct 3 ms 344 KB Output is correct
18 Correct 3 ms 344 KB Output is correct
19 Correct 2 ms 344 KB Output is correct
20 Correct 3 ms 344 KB Output is correct
21 Correct 3 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 368 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 2 ms 344 KB Output is correct
8 Correct 3 ms 344 KB Output is correct
9 Correct 3 ms 344 KB Output is correct
10 Correct 3 ms 340 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 3 ms 344 KB Output is correct
13 Correct 3 ms 344 KB Output is correct
14 Correct 4 ms 344 KB Output is correct
15 Correct 3 ms 344 KB Output is correct
16 Correct 2 ms 344 KB Output is correct
17 Correct 3 ms 344 KB Output is correct
18 Correct 3 ms 344 KB Output is correct
19 Correct 2 ms 344 KB Output is correct
20 Correct 3 ms 344 KB Output is correct
21 Correct 3 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 10 ms 344 KB Output is correct
24 Correct 3 ms 344 KB Output is correct
25 Correct 7 ms 344 KB Output is correct
26 Correct 13 ms 344 KB Output is correct
27 Correct 15 ms 344 KB Output is correct
28 Correct 5 ms 344 KB Output is correct
29 Correct 14 ms 344 KB Output is correct
30 Correct 15 ms 344 KB Output is correct
31 Correct 12 ms 344 KB Output is correct
32 Correct 11 ms 344 KB Output is correct
33 Correct 13 ms 344 KB Output is correct
34 Correct 14 ms 340 KB Output is correct
35 Correct 18 ms 344 KB Output is correct
36 Correct 13 ms 344 KB Output is correct
37 Correct 9 ms 344 KB Output is correct
38 Correct 9 ms 344 KB Output is correct
39 Correct 8 ms 356 KB Output is correct
40 Correct 11 ms 344 KB Output is correct
41 Correct 4 ms 344 KB Output is correct
# 결과 실행 시간 메모리 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 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 16 ms 344 KB Output is correct
8 Correct 9 ms 468 KB Output is correct
9 Correct 27 ms 344 KB Output is correct
10 Correct 33 ms 344 KB Output is correct
11 Correct 36 ms 592 KB Output is correct
12 Correct 24 ms 464 KB Output is correct
13 Correct 24 ms 344 KB Output is correct
14 Correct 21 ms 344 KB Output is correct
15 Correct 24 ms 344 KB Output is correct
16 Correct 20 ms 344 KB Output is correct
17 Correct 24 ms 344 KB Output is correct
18 Correct 19 ms 344 KB Output is correct
19 Correct 23 ms 344 KB Output is correct
20 Correct 26 ms 344 KB Output is correct
21 Correct 25 ms 456 KB Output is correct
22 Partially correct 21 ms 444 KB Output is partially correct
23 Correct 31 ms 444 KB Output is correct
24 Correct 29 ms 344 KB Output is correct
25 Correct 22 ms 440 KB Output is correct
26 Correct 8 ms 344 KB Output is correct
27 Correct 19 ms 344 KB Output is correct
28 Correct 24 ms 344 KB Output is correct
29 Correct 27 ms 344 KB Output is correct
30 Correct 26 ms 344 KB Output is correct
31 Correct 31 ms 344 KB Output is correct
32 Correct 26 ms 344 KB Output is correct
33 Correct 28 ms 344 KB Output is correct
34 Correct 31 ms 344 KB Output is correct
35 Correct 21 ms 344 KB Output is correct
36 Correct 16 ms 344 KB Output is correct
37 Correct 17 ms 344 KB Output is correct
38 Correct 30 ms 344 KB Output is correct
39 Correct 27 ms 344 KB Output is correct
40 Correct 28 ms 344 KB Output is correct
41 Correct 22 ms 344 KB Output is correct
42 Correct 33 ms 344 KB Output is correct
43 Correct 11 ms 344 KB Output is correct
44 Correct 28 ms 344 KB Output is correct
45 Correct 15 ms 344 KB Output is correct
46 Correct 23 ms 448 KB Output is correct
47 Correct 23 ms 344 KB Output is correct
48 Correct 13 ms 600 KB Output is correct