답안 #627670

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
627670 2022-08-12T18:17:21 Z sofapuden 드문 곤충 (IOI22_insects) C++17
100 / 100
62 ms 416 KB
#include "insects.h"
#include<bits/stdc++.h>

using namespace std;

int min_cardinality(int n) {
	int am = 1;
	move_inside(0);
	vector<int> st(n,0);
	st[0] = 1;
	int sz = 1;
	for(int i = 1; i < n; ++i){
		move_inside(i);
		if(press_button() != 1)move_outside(i);
		else am++, st[i] = 1, sz++;
	}
	int l = 2, r = n/am, cur = 1;
	int cn = 0;
	while(l <= r){
		cn++;
		int m = (l+r)>>1;
		vector<int> rem;
		if(cn&1){
			for(int i = 0; i < n; ++i){
				if(st[i])continue;
				sz++;
				move_inside(i);
				if(press_button() > m){
					rem.push_back(i);
					sz--;
					move_outside(i);
				}
				if(sz == am*m){
					for(int j = i+1; j < n; ++j){
						if(st[j])continue;
						rem.push_back(j);
					}
					break;
				}
			}
		}
		else{
			for(int i = n-1; ~i; --i){
				if(st[i])continue;
				sz++;
				move_inside(i);
				if(press_button() > m){
					rem.push_back(i);
					sz--;
					move_outside(i);
				}
				if(sz == am*m){
					for(int j = i-1; ~j; --j){
						if(st[j])continue;
						rem.push_back(j);
					}
					break;
				}
			}
		}
		if(sz == am*m){
			for(int i = 0; i < n; ++i)st[i] = 1;
			for(auto x : rem)st[x] = 0;
			cur = m;
			l = m + 1;
		}
		else{
			r = m - 1;
			if(l <= r){
				for(auto x : rem)st[x] = 1;
				for(int i = 0; i < n; ++i){
					if(!st[i]){move_outside(i);sz--;}
				}
			}
		}
	}
	return cur;
}
# 결과 실행 시간 메모리 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 3 ms 208 KB Output is correct
8 Correct 6 ms 208 KB Output is correct
9 Correct 9 ms 208 KB Output is correct
10 Correct 6 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 9 ms 208 KB Output is correct
13 Correct 4 ms 208 KB Output is correct
14 Correct 6 ms 208 KB Output is correct
15 Correct 4 ms 208 KB Output is correct
16 Correct 5 ms 208 KB Output is correct
17 Correct 5 ms 208 KB Output is correct
18 Correct 6 ms 208 KB Output is correct
19 Correct 5 ms 208 KB Output is correct
20 Correct 5 ms 208 KB Output is correct
21 Correct 3 ms 208 KB Output is correct
22 Correct 1 ms 208 KB Output is correct
# 결과 실행 시간 메모리 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 3 ms 208 KB Output is correct
8 Correct 6 ms 208 KB Output is correct
9 Correct 9 ms 208 KB Output is correct
10 Correct 6 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 9 ms 208 KB Output is correct
13 Correct 4 ms 208 KB Output is correct
14 Correct 6 ms 208 KB Output is correct
15 Correct 4 ms 208 KB Output is correct
16 Correct 5 ms 208 KB Output is correct
17 Correct 5 ms 208 KB Output is correct
18 Correct 6 ms 208 KB Output is correct
19 Correct 5 ms 208 KB Output is correct
20 Correct 5 ms 208 KB Output is correct
21 Correct 3 ms 208 KB Output is correct
22 Correct 1 ms 208 KB Output is correct
23 Correct 19 ms 208 KB Output is correct
24 Correct 15 ms 208 KB Output is correct
25 Correct 32 ms 284 KB Output is correct
26 Correct 24 ms 284 KB Output is correct
27 Correct 18 ms 208 KB Output is correct
28 Correct 10 ms 208 KB Output is correct
29 Correct 23 ms 284 KB Output is correct
30 Correct 24 ms 296 KB Output is correct
31 Correct 25 ms 208 KB Output is correct
32 Correct 24 ms 284 KB Output is correct
33 Correct 29 ms 284 KB Output is correct
34 Correct 33 ms 284 KB Output is correct
35 Correct 18 ms 208 KB Output is correct
36 Correct 20 ms 208 KB Output is correct
37 Correct 21 ms 284 KB Output is correct
38 Correct 11 ms 336 KB Output is correct
39 Correct 16 ms 208 KB Output is correct
40 Correct 23 ms 284 KB Output is correct
41 Correct 11 ms 208 KB Output is correct
# 결과 실행 시간 메모리 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 30 ms 208 KB Output is correct
8 Correct 19 ms 208 KB Output is correct
9 Correct 44 ms 284 KB Output is correct
10 Correct 46 ms 208 KB Output is correct
11 Correct 40 ms 300 KB Output is correct
12 Correct 30 ms 300 KB Output is correct
13 Correct 49 ms 208 KB Output is correct
14 Correct 24 ms 296 KB Output is correct
15 Correct 22 ms 288 KB Output is correct
16 Correct 41 ms 208 KB Output is correct
17 Correct 37 ms 288 KB Output is correct
18 Correct 47 ms 208 KB Output is correct
19 Correct 46 ms 288 KB Output is correct
20 Correct 46 ms 284 KB Output is correct
21 Correct 52 ms 416 KB Output is correct
22 Correct 57 ms 288 KB Output is correct
23 Correct 41 ms 208 KB Output is correct
24 Correct 33 ms 284 KB Output is correct
25 Correct 37 ms 288 KB Output is correct
26 Correct 21 ms 208 KB Output is correct
27 Correct 44 ms 292 KB Output is correct
28 Correct 42 ms 208 KB Output is correct
29 Correct 45 ms 292 KB Output is correct
30 Correct 43 ms 288 KB Output is correct
31 Correct 47 ms 300 KB Output is correct
32 Correct 51 ms 328 KB Output is correct
33 Correct 37 ms 208 KB Output is correct
34 Correct 39 ms 416 KB Output is correct
35 Correct 35 ms 288 KB Output is correct
36 Correct 34 ms 304 KB Output is correct
37 Correct 62 ms 296 KB Output is correct
38 Correct 44 ms 208 KB Output is correct
39 Correct 50 ms 208 KB Output is correct
40 Correct 40 ms 284 KB Output is correct
41 Correct 42 ms 288 KB Output is correct
42 Correct 54 ms 208 KB Output is correct
43 Correct 16 ms 288 KB Output is correct
44 Correct 34 ms 284 KB Output is correct
45 Correct 44 ms 292 KB Output is correct
46 Correct 30 ms 292 KB Output is correct
47 Correct 31 ms 288 KB Output is correct
48 Correct 28 ms 208 KB Output is correct