oj.uz

답안 #631727

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
631727 2022-08-18T14:59:55 Z rainboy 드문 곤충 (IOI22_insects) C++17
100 / 100
 58 ms 328 KB 
/* https://ioi2022.id/data/editorial.pdf */
#include "insects.h"

const int N = 2000;

unsigned int X = 12345;

int rand_() {
	return (X *= 3) >> 1;
}

int ii[N]; char type[N];

int min_cardinality(int n) {
	int d = 0;
	for (int i = 0; i < n; i++) {
		move_inside(i), type[i] = 1, d++;
		if (press_button() > 1)
			move_outside(i), type[i] = 0, d--;
	}
	int lower = 1, upper = n / d + 1, k = d;
	while (upper - lower > 1) {
		int c = (lower + upper) / 2, m = 0;
		for (int i = 0; i < n; i++)
			if (type[i] == 0)
				ii[m++] = i;
		for (int h = 0; h < m; h++) {
			int h_ = rand_() % (h + 1), tmp;
			tmp = ii[h], ii[h] = ii[h_], ii[h_] = tmp;
		}
		for (int h = 0; h < m; h++) {
			int i = ii[h];
			move_inside(i), type[i] = -1, k++;
			if (press_button() > c)
				move_outside(i), type[i] = 0, k--;
			else if (k == c * d)
				break;
		}
		if (k == c * d) {
			lower = c;
			for (int i = 0; i < n; i++)
				if (type[i] == -1)
					type[i] = 1;
		} else {
			upper = k / d + 1;
			for (int i = 0; i < n; i++)
				if (type[i] == -1)
					move_outside(i), type[i] = 0, k--;
				else if (type[i] == 0)
					type[i] = -2;
		}
	}
	return lower;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 4 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 4 ms 208 KB Output is correct
9 Correct 5 ms 208 KB Output is correct
10 Correct 4 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 5 ms 208 KB Output is correct
13 Correct 6 ms 208 KB Output is correct
14 Correct 7 ms 208 KB Output is correct
15 Correct 3 ms 208 KB Output is correct
16 Correct 5 ms 208 KB Output is correct
17 Correct 6 ms 208 KB Output is correct
18 Correct 5 ms 208 KB Output is correct
19 Correct 4 ms 208 KB Output is correct
20 Correct 2 ms 208 KB Output is correct
21 Correct 1 ms 208 KB Output is correct
22 Correct 2 ms 208 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 4 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 4 ms 208 KB Output is correct
9 Correct 5 ms 208 KB Output is correct
10 Correct 4 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 5 ms 208 KB Output is correct
13 Correct 6 ms 208 KB Output is correct
14 Correct 7 ms 208 KB Output is correct
15 Correct 3 ms 208 KB Output is correct
16 Correct 5 ms 208 KB Output is correct
17 Correct 6 ms 208 KB Output is correct
18 Correct 5 ms 208 KB Output is correct
19 Correct 4 ms 208 KB Output is correct
20 Correct 2 ms 208 KB Output is correct
21 Correct 1 ms 208 KB Output is correct
22 Correct 2 ms 208 KB Output is correct
23 Correct 18 ms 208 KB Output is correct
24 Correct 8 ms 208 KB Output is correct
25 Correct 28 ms 208 KB Output is correct
26 Correct 28 ms 208 KB Output is correct
27 Correct 27 ms 208 KB Output is correct
28 Correct 8 ms 208 KB Output is correct
29 Correct 20 ms 208 KB Output is correct
30 Correct 23 ms 208 KB Output is correct
31 Correct 19 ms 208 KB Output is correct
32 Correct 25 ms 208 KB Output is correct
33 Correct 23 ms 328 KB Output is correct
34 Correct 24 ms 276 KB Output is correct
35 Correct 17 ms 208 KB Output is correct
36 Correct 23 ms 288 KB Output is correct
37 Correct 28 ms 276 KB Output is correct
38 Correct 21 ms 284 KB Output is correct
39 Correct 21 ms 208 KB Output is correct
40 Correct 14 ms 304 KB Output is correct
41 Correct 10 ms 208 KB Output is correct

Subtask #3
75.0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 23 ms 276 KB Output is correct
8 Correct 22 ms 208 KB Output is correct
9 Correct 46 ms 208 KB Output is correct
10 Correct 48 ms 208 KB Output is correct
11 Correct 32 ms 272 KB Output is correct
12 Correct 29 ms 272 KB Output is correct
13 Correct 46 ms 280 KB Output is correct
14 Correct 51 ms 208 KB Output is correct
15 Correct 39 ms 208 KB Output is correct
16 Correct 29 ms 272 KB Output is correct
17 Correct 38 ms 208 KB Output is correct
18 Correct 46 ms 288 KB Output is correct
19 Correct 37 ms 208 KB Output is correct
20 Correct 39 ms 208 KB Output is correct
21 Correct 55 ms 280 KB Output is correct
22 Correct 41 ms 280 KB Output is correct
23 Correct 22 ms 276 KB Output is correct
24 Correct 29 ms 272 KB Output is correct
25 Correct 15 ms 280 KB Output is correct
26 Correct 17 ms 208 KB Output is correct
27 Correct 36 ms 208 KB Output is correct
28 Correct 28 ms 208 KB Output is correct
29 Correct 38 ms 276 KB Output is correct
30 Correct 39 ms 208 KB Output is correct
31 Correct 36 ms 276 KB Output is correct
32 Correct 55 ms 208 KB Output is correct
33 Correct 50 ms 276 KB Output is correct
34 Correct 40 ms 276 KB Output is correct
35 Correct 29 ms 276 KB Output is correct
36 Correct 42 ms 208 KB Output is correct
37 Correct 27 ms 276 KB Output is correct
38 Correct 51 ms 276 KB Output is correct
39 Correct 50 ms 208 KB Output is correct
40 Correct 58 ms 288 KB Output is correct
41 Correct 47 ms 276 KB Output is correct
42 Correct 42 ms 272 KB Output is correct
43 Correct 14 ms 208 KB Output is correct
44 Correct 41 ms 208 KB Output is correct
45 Correct 17 ms 296 KB Output is correct
46 Correct 25 ms 208 KB Output is correct
47 Correct 14 ms 328 KB Output is correct
48 Correct 25 ms 208 KB Output is correct