oj.uz

답안 #727270

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
727270 2023-04-20T10:39:39 Z vjudge1 드문 곤충 (IOI22_insects) C++17
100 / 100
 66 ms 424 KB 
#pragma GCC optimize("O3")
#include "insects.h"
#include <bits/stdc++.h>
using namespace std;
//g++ -std=c++17 insects.cpp stub.cpp
int D, N;
const int MAX = 3000;
int mark[MAX], inside[MAX];
vector<int> p;
int cnt = 0;
bool check(int m){
	for(auto i : p){
		if(cnt == m * D) break;
		if(mark[i]) continue;
		move_inside(i);
		if(press_button() > m){
			move_outside(i);
		}else{
			cnt++;
			inside[i] = 1;
		}
	}
	if(cnt == m * D){
		for(int i = 0; i < N; i++) if(inside[i]) mark[i] = 1;
		return false;
	}
	for(int i = 0; i < N; i++){
		if(!inside[i]) mark[i] = 1;
		else if(!mark[i]){
			move_outside(i);
			inside[i] = 0;
			cnt--;
		}
	}
	return true;
}
int min_cardinality(int n) {
	N = n;
	p.resize(N);
	for(int i = 0; i < N; i++) p[i] = i;
	random_shuffle(p.begin(), p.end());
	for(int i = 0; i < N; i++){
		move_inside(i);
		if(press_button() > 1){
			move_outside(i);
		}else{
			cnt++;
			inside[i] = 1;
			mark[i] = 1;
		}
	}
	D = cnt;

	int l = 1, r = N / D;
	while(l <= r){
		int m = (l + r) / 2;
		if(check(m)) r = m - 1;
		else l = m + 1;
	}
	return r;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 1 ms 308 KB Output is correct
5 Correct 1 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 5 ms 208 KB Output is correct
9 Correct 6 ms 208 KB Output is correct
10 Correct 5 ms 208 KB Output is correct
11 Correct 4 ms 208 KB Output is correct
12 Correct 5 ms 208 KB Output is correct
13 Correct 4 ms 208 KB Output is correct
14 Correct 5 ms 208 KB Output is correct
15 Correct 4 ms 208 KB Output is correct
16 Correct 4 ms 208 KB Output is correct
17 Correct 6 ms 208 KB Output is correct
18 Correct 7 ms 208 KB Output is correct
19 Correct 5 ms 208 KB Output is correct
20 Correct 3 ms 308 KB Output is correct
21 Correct 3 ms 208 KB Output is correct
22 Correct 3 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 1 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 1 ms 308 KB Output is correct
5 Correct 1 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 5 ms 208 KB Output is correct
9 Correct 6 ms 208 KB Output is correct
10 Correct 5 ms 208 KB Output is correct
11 Correct 4 ms 208 KB Output is correct
12 Correct 5 ms 208 KB Output is correct
13 Correct 4 ms 208 KB Output is correct
14 Correct 5 ms 208 KB Output is correct
15 Correct 4 ms 208 KB Output is correct
16 Correct 4 ms 208 KB Output is correct
17 Correct 6 ms 208 KB Output is correct
18 Correct 7 ms 208 KB Output is correct
19 Correct 5 ms 208 KB Output is correct
20 Correct 3 ms 308 KB Output is correct
21 Correct 3 ms 208 KB Output is correct
22 Correct 3 ms 208 KB Output is correct
23 Correct 21 ms 288 KB Output is correct
24 Correct 10 ms 208 KB Output is correct
25 Correct 25 ms 292 KB Output is correct
26 Correct 29 ms 208 KB Output is correct
27 Correct 24 ms 316 KB Output is correct
28 Correct 8 ms 316 KB Output is correct
29 Correct 20 ms 208 KB Output is correct
30 Correct 24 ms 208 KB Output is correct
31 Correct 22 ms 208 KB Output is correct
32 Correct 20 ms 208 KB Output is correct
33 Correct 33 ms 312 KB Output is correct
34 Correct 22 ms 208 KB Output is correct
35 Correct 24 ms 304 KB Output is correct
36 Correct 27 ms 304 KB Output is correct
37 Correct 12 ms 208 KB Output is correct
38 Correct 23 ms 296 KB Output is correct
39 Correct 21 ms 208 KB Output is correct
40 Correct 13 ms 316 KB Output is correct
41 Correct 8 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 300 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 1 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 29 ms 292 KB Output is correct
8 Correct 19 ms 208 KB Output is correct
9 Correct 30 ms 304 KB Output is correct
10 Correct 55 ms 208 KB Output is correct
11 Correct 46 ms 300 KB Output is correct
12 Correct 27 ms 312 KB Output is correct
13 Correct 50 ms 304 KB Output is correct
14 Correct 42 ms 304 KB Output is correct
15 Correct 41 ms 308 KB Output is correct
16 Correct 48 ms 308 KB Output is correct
17 Correct 48 ms 208 KB Output is correct
18 Correct 48 ms 308 KB Output is correct
19 Correct 51 ms 296 KB Output is correct
20 Correct 27 ms 296 KB Output is correct
21 Correct 49 ms 312 KB Output is correct
22 Correct 39 ms 312 KB Output is correct
23 Correct 59 ms 320 KB Output is correct
24 Correct 37 ms 308 KB Output is correct
25 Correct 36 ms 312 KB Output is correct
26 Correct 14 ms 208 KB Output is correct
27 Correct 50 ms 304 KB Output is correct
28 Correct 44 ms 296 KB Output is correct
29 Correct 44 ms 308 KB Output is correct
30 Correct 30 ms 300 KB Output is correct
31 Correct 50 ms 316 KB Output is correct
32 Correct 54 ms 308 KB Output is correct
33 Correct 52 ms 292 KB Output is correct
34 Correct 24 ms 304 KB Output is correct
35 Correct 42 ms 308 KB Output is correct
36 Correct 26 ms 304 KB Output is correct
37 Correct 50 ms 296 KB Output is correct
38 Correct 48 ms 304 KB Output is correct
39 Correct 36 ms 424 KB Output is correct
40 Correct 66 ms 304 KB Output is correct
41 Correct 57 ms 300 KB Output is correct
42 Correct 46 ms 312 KB Output is correct
43 Correct 17 ms 308 KB Output is correct
44 Correct 35 ms 320 KB Output is correct
45 Correct 27 ms 304 KB Output is correct
46 Correct 33 ms 304 KB Output is correct
47 Correct 32 ms 208 KB Output is correct
48 Correct 17 ms 308 KB Output is correct