oj.uz

답안 #1024651

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1024651 2024-07-16T08:53:34 Z vjudge1 드문 곤충 (IOI22_insects) C++17
98.24 / 100
 50 ms 948 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
pair<int, int> pii;

const int maxn = 1e5 + 100;

int n, d;
int used[maxn];
int f[maxn];
int mx[maxn];
int mn[maxn];

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

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

int min_cardinality(int N){
	d = 0; n = N;
	for(int i = N - 1; i >= 0; i--){
		add(i); mn[i] = n;
		if(press_button() == 1) f[i] = 1, d++;
		else del(i);
	} clear();
	int ans = n / d, x = 0;
	for(int l = 1, r = n / d - 1; l <= r;){
		int mid = (l + r) >> 1;
		if(x < mid){
			for(int i = 0; i < n; i++){
				if(used[i] || mx[i] > mid) continue;
				add(i);
				if(press_button() > mid){
					mx[i] = mid + 1;
					del(i);
				} else mn[i] = min(mn[i], mid);
			}
		} else if(x > mid){
			for(int i = n - 1; i >= 0; i--){
				if(!used[i] || mn[i] <= mid) continue;
				if(press_button() <= mid) break;
				del(i);
			}
			for(int i = 0; i < n; i++){
				if(used[i] || mx[i] > mid) continue;
				add(i);
				if(press_button() > mid){
					mx[i] = mid + 1;
					del(i);
				} else mn[i] = min(mn[i], mid);
			}
		} x = mid;
		bool ok = 0;
		for(int i = 0; i < n; i++){
			if(used[i] && f[i]) ok = 1;
		}
		if(!ok) l = mid + 1;
		else r = mid - 1, ans = mid;
	}
	return ans;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 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 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 4 ms 344 KB Output is correct
7 Correct 2 ms 344 KB Output is correct
8 Correct 5 ms 344 KB Output is correct
9 Correct 4 ms 344 KB Output is correct
10 Correct 4 ms 596 KB Output is correct
11 Correct 2 ms 344 KB Output is correct
12 Correct 4 ms 460 KB Output is correct
13 Correct 3 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 3 ms 344 KB Output is correct
17 Correct 5 ms 452 KB Output is correct
18 Correct 4 ms 456 KB Output is correct
19 Correct 3 ms 452 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

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 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 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 4 ms 344 KB Output is correct
7 Correct 2 ms 344 KB Output is correct
8 Correct 5 ms 344 KB Output is correct
9 Correct 4 ms 344 KB Output is correct
10 Correct 4 ms 596 KB Output is correct
11 Correct 2 ms 344 KB Output is correct
12 Correct 4 ms 460 KB Output is correct
13 Correct 3 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 3 ms 344 KB Output is correct
17 Correct 5 ms 452 KB Output is correct
18 Correct 4 ms 456 KB Output is correct
19 Correct 3 ms 452 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 18 ms 344 KB Output is correct
24 Correct 4 ms 712 KB Output is correct
25 Correct 15 ms 452 KB Output is correct
26 Correct 17 ms 344 KB Output is correct
27 Correct 24 ms 456 KB Output is correct
28 Correct 5 ms 600 KB Output is correct
29 Correct 15 ms 460 KB Output is correct
30 Correct 17 ms 600 KB Output is correct
31 Correct 23 ms 452 KB Output is correct
32 Correct 18 ms 592 KB Output is correct
33 Correct 19 ms 600 KB Output is correct
34 Correct 20 ms 344 KB Output is correct
35 Correct 18 ms 448 KB Output is correct
36 Correct 18 ms 460 KB Output is correct
37 Correct 23 ms 600 KB Output is correct
38 Correct 9 ms 344 KB Output is correct
39 Correct 14 ms 460 KB Output is correct
40 Correct 10 ms 452 KB Output is correct
41 Correct 5 ms 368 KB Output is correct

Subtask #3
73.24 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 0 ms 344 KB Output is correct
7 Correct 37 ms 464 KB Output is correct
8 Correct 11 ms 460 KB Output is correct
9 Partially correct 30 ms 452 KB Output is partially correct
10 Partially correct 29 ms 608 KB Output is partially correct
11 Correct 24 ms 612 KB Output is correct
12 Correct 19 ms 588 KB Output is correct
13 Correct 45 ms 344 KB Output is correct
14 Partially correct 31 ms 460 KB Output is partially correct
15 Partially correct 38 ms 344 KB Output is partially correct
16 Partially correct 37 ms 460 KB Output is partially correct
17 Partially correct 39 ms 604 KB Output is partially correct
18 Partially correct 44 ms 592 KB Output is partially correct
19 Partially correct 28 ms 344 KB Output is partially correct
20 Partially correct 47 ms 460 KB Output is partially correct
21 Partially correct 37 ms 948 KB Output is partially correct
22 Partially correct 38 ms 600 KB Output is partially correct
23 Partially correct 30 ms 596 KB Output is partially correct
24 Correct 31 ms 344 KB Output is correct
25 Correct 19 ms 344 KB Output is correct
26 Correct 10 ms 600 KB Output is correct
27 Partially correct 36 ms 592 KB Output is partially correct
28 Partially correct 35 ms 344 KB Output is partially correct
29 Partially correct 28 ms 696 KB Output is partially correct
30 Partially correct 42 ms 600 KB Output is partially correct
31 Correct 40 ms 464 KB Output is correct
32 Partially correct 47 ms 344 KB Output is partially correct
33 Correct 35 ms 344 KB Output is correct
34 Correct 31 ms 708 KB Output is correct
35 Partially correct 31 ms 712 KB Output is partially correct
36 Partially correct 38 ms 600 KB Output is partially correct
37 Correct 29 ms 592 KB Output is correct
38 Correct 32 ms 600 KB Output is correct
39 Correct 37 ms 712 KB Output is correct
40 Correct 38 ms 600 KB Output is correct
41 Partially correct 28 ms 448 KB Output is partially correct
42 Partially correct 46 ms 716 KB Output is partially correct
43 Correct 9 ms 600 KB Output is correct
44 Correct 35 ms 464 KB Output is correct
45 Correct 50 ms 456 KB Output is correct
46 Correct 14 ms 716 KB Output is correct
47 Correct 23 ms 692 KB Output is correct
48 Correct 28 ms 452 KB Output is correct