oj.uz

답안 #627658

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
627658 2022-08-12T18:12:48 Z sofapuden 드문 곤충 (IOI22_insects) C++17
100 / 100
 74 ms 332 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;
	vector<int> per(n);
	iota(per.begin(),per.end(),0);
	srand(time(0));
	while(l <= r){
		int m = (l+r)>>1;
		vector<int> rem;
		random_shuffle(per.begin(),per.end());
		for(int x = 0; x < n; ++x){
			int i = per[x];
			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 = x+1; j < n; ++j){
					if(st[per[j]])continue;
					rem.push_back(per[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;
}

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 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 3 ms 304 KB Output is correct
9 Correct 6 ms 304 KB Output is correct
10 Correct 6 ms 208 KB Output is correct
11 Correct 3 ms 208 KB Output is correct
12 Correct 6 ms 296 KB Output is correct
13 Correct 6 ms 208 KB Output is correct
14 Correct 6 ms 208 KB Output is correct
15 Correct 5 ms 296 KB Output is correct
16 Correct 5 ms 208 KB Output is correct
17 Correct 5 ms 300 KB Output is correct
18 Correct 6 ms 300 KB Output is correct
19 Correct 5 ms 308 KB Output is correct
20 Correct 4 ms 208 KB Output is correct
21 Correct 3 ms 296 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 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 3 ms 304 KB Output is correct
9 Correct 6 ms 304 KB Output is correct
10 Correct 6 ms 208 KB Output is correct
11 Correct 3 ms 208 KB Output is correct
12 Correct 6 ms 296 KB Output is correct
13 Correct 6 ms 208 KB Output is correct
14 Correct 6 ms 208 KB Output is correct
15 Correct 5 ms 296 KB Output is correct
16 Correct 5 ms 208 KB Output is correct
17 Correct 5 ms 300 KB Output is correct
18 Correct 6 ms 300 KB Output is correct
19 Correct 5 ms 308 KB Output is correct
20 Correct 4 ms 208 KB Output is correct
21 Correct 3 ms 296 KB Output is correct
22 Correct 2 ms 208 KB Output is correct
23 Correct 17 ms 284 KB Output is correct
24 Correct 9 ms 208 KB Output is correct
25 Correct 20 ms 288 KB Output is correct
26 Correct 26 ms 208 KB Output is correct
27 Correct 22 ms 208 KB Output is correct
28 Correct 8 ms 284 KB Output is correct
29 Correct 22 ms 208 KB Output is correct
30 Correct 29 ms 208 KB Output is correct
31 Correct 15 ms 244 KB Output is correct
32 Correct 23 ms 208 KB Output is correct
33 Correct 21 ms 284 KB Output is correct
34 Correct 25 ms 288 KB Output is correct
35 Correct 15 ms 296 KB Output is correct
36 Correct 28 ms 208 KB Output is correct
37 Correct 19 ms 208 KB Output is correct
38 Correct 17 ms 300 KB Output is correct
39 Correct 22 ms 304 KB Output is correct
40 Correct 14 ms 208 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 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 45 ms 296 KB Output is correct
8 Correct 20 ms 288 KB Output is correct
9 Correct 45 ms 296 KB Output is correct
10 Correct 74 ms 288 KB Output is correct
11 Correct 42 ms 296 KB Output is correct
12 Correct 23 ms 288 KB Output is correct
13 Correct 39 ms 296 KB Output is correct
14 Correct 50 ms 288 KB Output is correct
15 Correct 22 ms 208 KB Output is correct
16 Correct 25 ms 284 KB Output is correct
17 Correct 52 ms 296 KB Output is correct
18 Correct 57 ms 300 KB Output is correct
19 Correct 43 ms 292 KB Output is correct
20 Correct 58 ms 316 KB Output is correct
21 Correct 29 ms 288 KB Output is correct
22 Correct 62 ms 300 KB Output is correct
23 Correct 49 ms 304 KB Output is correct
24 Correct 20 ms 304 KB Output is correct
25 Correct 40 ms 292 KB Output is correct
26 Correct 22 ms 312 KB Output is correct
27 Correct 47 ms 304 KB Output is correct
28 Correct 47 ms 296 KB Output is correct
29 Correct 47 ms 284 KB Output is correct
30 Correct 43 ms 296 KB Output is correct
31 Correct 63 ms 304 KB Output is correct
32 Correct 28 ms 312 KB Output is correct
33 Correct 63 ms 284 KB Output is correct
34 Correct 57 ms 300 KB Output is correct
35 Correct 52 ms 284 KB Output is correct
36 Correct 24 ms 296 KB Output is correct
37 Correct 56 ms 296 KB Output is correct
38 Correct 25 ms 300 KB Output is correct
39 Correct 49 ms 288 KB Output is correct
40 Correct 45 ms 288 KB Output is correct
41 Correct 46 ms 332 KB Output is correct
42 Correct 55 ms 304 KB Output is correct
43 Correct 13 ms 312 KB Output is correct
44 Correct 43 ms 300 KB Output is correct
45 Correct 40 ms 284 KB Output is correct
46 Correct 15 ms 296 KB Output is correct
47 Correct 17 ms 296 KB Output is correct
48 Correct 36 ms 300 KB Output is correct