oj.uz

답안 #830896

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
830896 2023-08-19T12:40:30 Z FatihSolak 드문 곤충 (IOI22_insects) C++17
98.04 / 100
 64 ms 316 KB 
#include "insects.h"
#include <bits/stdc++.h>
using namespace std;
	
int min_cardinality(int N){
	mt19937 rng(chrono::steady_clock().now().time_since_epoch().count());
	vector<int> ord;
	for(int i = 0;i<N;i++){
		ord.push_back(i);
	}
	shuffle(ord.begin(),ord.end(),rng);
	vector<int> v;
	int now = 0;
	int dif = 0;
	auto add = [&](int x){
		v.push_back(x);
		move_inside(ord[x]);
		now = press_button();
	};
	auto del = [&](){
		move_outside(ord[v.back()]);
		v.pop_back();
		now = press_button();
	};
	auto del2 = [&](){
		move_outside(ord[v.back()]);
		v.pop_back();
		now--;
	};
	auto del3 = [&](){
		move_outside(ord[v.back()]);
		v.pop_back();
	};
	add(0);
	dif = 1;
	for(int i = 1;i<N;i++){
		add(i);
		if(now == 2){
			del2();
		}
		else dif++;
	}
	if(dif <= 3){
		vector<bool> found(N,0);
		int mini = 1e9;
		int rem = N;
		for(int i = 0;i<N && dif > 1;i++){
			if(found[i] == 0){
				dif--;
				while(v.size())
					del3();
				now = 0;
				int cnt = 0;
				for(int j = 0;j<N;j++){
					if(found[j])continue;
					add(j);
					if(now != cnt + 1){
						del3();
					}
					else{
						found[j] = 1;
						cnt++;
						rem--;
					}
				}
				mini = min(mini,cnt);
			}
		}
		mini = min(mini,rem);
		return mini;
	}
	vector<int> ban(N,0);
	int l = 1,r = N/dif;
	int ext = 0;
	while(l < r){
		int m = (l + r + 1)/2;
		if(now < m-ext){
			for(int i = 0;i<N;i++){
				if(ban[i] == 0 && find(v.begin(),v.end(),i) == v.end()){
					add(i);
					if(now > m - ext)
						del2();
				}
			}
		}
		else{
			vector<int> tmp;
			while(now > m-ext){
				tmp.push_back(v.back());
				del();
			}
			for(auto u:tmp){
				if(ban[u] == 0 && find(v.begin(),v.end(),u) == v.end()){
					add(u);
					if(now > m - ext)
						del2();
				}
			}
		}
		if(v.size() == (m-ext) * dif){
			for(auto u:v){
				ban[u] = 1;
			}
			while(v.size())
				del3();
			now = 0;
			ext = m;
			l  = m;
		}
		else{
			r = m -1;
			for(int i = 0;i<N;i++){
				if(find(v.begin(),v.end(),i) == v.end()){
					ban[i] = 1;
				}
			}
		}
	}
	return l;
}

Compilation message

insects.cpp: In function 'int min_cardinality(int)':
insects.cpp:100:15: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  100 |   if(v.size() == (m-ext) * dif){
      |      ~~~~~~~~~^~~~~~~~~~~~~~~~

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 2 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 4 ms 208 KB Output is correct
9 Correct 6 ms 208 KB Output is correct
10 Correct 4 ms 208 KB Output is correct
11 Correct 3 ms 208 KB Output is correct
12 Correct 6 ms 208 KB Output is correct
13 Correct 8 ms 208 KB Output is correct
14 Correct 3 ms 208 KB Output is correct
15 Correct 6 ms 208 KB Output is correct
16 Correct 5 ms 208 KB Output is correct
17 Correct 4 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 5 ms 208 KB Output is correct
21 Correct 2 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 2 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 4 ms 208 KB Output is correct
9 Correct 6 ms 208 KB Output is correct
10 Correct 4 ms 208 KB Output is correct
11 Correct 3 ms 208 KB Output is correct
12 Correct 6 ms 208 KB Output is correct
13 Correct 8 ms 208 KB Output is correct
14 Correct 3 ms 208 KB Output is correct
15 Correct 6 ms 208 KB Output is correct
16 Correct 5 ms 208 KB Output is correct
17 Correct 4 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 5 ms 208 KB Output is correct
21 Correct 2 ms 208 KB Output is correct
22 Correct 2 ms 208 KB Output is correct
23 Correct 6 ms 208 KB Output is correct
24 Correct 9 ms 208 KB Output is correct
25 Correct 24 ms 300 KB Output is correct
26 Correct 19 ms 208 KB Output is correct
27 Correct 11 ms 312 KB Output is correct
28 Correct 13 ms 208 KB Output is correct
29 Correct 24 ms 208 KB Output is correct
30 Correct 32 ms 288 KB Output is correct
31 Correct 29 ms 208 KB Output is correct
32 Correct 28 ms 312 KB Output is correct
33 Correct 24 ms 308 KB Output is correct
34 Correct 20 ms 308 KB Output is correct
35 Correct 26 ms 316 KB Output is correct
36 Correct 17 ms 304 KB Output is correct
37 Correct 20 ms 208 KB Output is correct
38 Correct 24 ms 288 KB Output is correct
39 Correct 22 ms 308 KB Output is correct
40 Correct 13 ms 308 KB Output is correct
41 Correct 4 ms 308 KB Output is correct

Subtask #3
73.04 / 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 13 ms 208 KB Output is correct
8 Correct 20 ms 312 KB Output is correct
9 Correct 41 ms 300 KB Output is correct
10 Partially correct 53 ms 296 KB Output is partially correct
11 Correct 25 ms 304 KB Output is correct
12 Correct 25 ms 208 KB Output is correct
13 Correct 49 ms 296 KB Output is correct
14 Partially correct 64 ms 292 KB Output is partially correct
15 Partially correct 47 ms 308 KB Output is partially correct
16 Partially correct 40 ms 208 KB Output is partially correct
17 Partially correct 50 ms 304 KB Output is partially correct
18 Partially correct 54 ms 304 KB Output is partially correct
19 Partially correct 33 ms 304 KB Output is partially correct
20 Partially correct 33 ms 312 KB Output is partially correct
21 Partially correct 40 ms 304 KB Output is partially correct
22 Partially correct 45 ms 304 KB Output is partially correct
23 Partially correct 58 ms 308 KB Output is partially correct
24 Correct 42 ms 292 KB Output is correct
25 Correct 29 ms 296 KB Output is correct
26 Correct 15 ms 312 KB Output is correct
27 Correct 51 ms 292 KB Output is correct
28 Correct 51 ms 208 KB Output is correct
29 Partially correct 29 ms 312 KB Output is partially correct
30 Partially correct 51 ms 308 KB Output is partially correct
31 Partially correct 34 ms 308 KB Output is partially correct
32 Partially correct 56 ms 308 KB Output is partially correct
33 Partially correct 61 ms 208 KB Output is partially correct
34 Partially correct 27 ms 316 KB Output is partially correct
35 Partially correct 40 ms 308 KB Output is partially correct
36 Partially correct 51 ms 292 KB Output is partially correct
37 Partially correct 57 ms 308 KB Output is partially correct
38 Partially correct 43 ms 308 KB Output is partially correct
39 Correct 45 ms 296 KB Output is correct
40 Correct 36 ms 304 KB Output is correct
41 Partially correct 52 ms 304 KB Output is partially correct
42 Partially correct 38 ms 300 KB Output is partially correct
43 Correct 9 ms 208 KB Output is correct
44 Correct 42 ms 208 KB Output is correct
45 Correct 34 ms 292 KB Output is correct
46 Correct 19 ms 312 KB Output is correct
47 Correct 23 ms 208 KB Output is correct
48 Correct 25 ms 300 KB Output is correct