oj.uz

Submission #830914

# Submission time Handle Problem Language Result Execution time Memory
830914 2023-08-19T12:52:53 Z FatihSolak Rarest Insects (IOI22_insects) C++17
82.23 / 100
 99 ms 420 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 + 1 + rng()%(r-l);
		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{
			while(v.size()){
				del3();
			}
			now = 0;
			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();
				}
			}
		}
		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:99:15: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   99 |   if(v.size() == (m-ext) * dif){
      |      ~~~~~~~~~^~~~~~~~~~~~~~~~
insects.cpp:20:7: warning: variable 'del' set but not used [-Wunused-but-set-variable]
   20 |  auto del = [&](){
      |       ^~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 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 1 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 4 ms 256 KB Output is correct
9 Correct 2 ms 208 KB Output is correct
10 Correct 3 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 4 ms 208 KB Output is correct
13 Correct 3 ms 208 KB Output is correct
14 Correct 5 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 5 ms 208 KB Output is correct
20 Correct 4 ms 208 KB Output is correct
21 Correct 4 ms 208 KB Output is correct
22 Correct 2 ms 208 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 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 1 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 4 ms 256 KB Output is correct
9 Correct 2 ms 208 KB Output is correct
10 Correct 3 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 4 ms 208 KB Output is correct
13 Correct 3 ms 208 KB Output is correct
14 Correct 5 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 5 ms 208 KB Output is correct
20 Correct 4 ms 208 KB Output is correct
21 Correct 4 ms 208 KB Output is correct
22 Correct 2 ms 208 KB Output is correct
23 Correct 7 ms 208 KB Output is correct
24 Correct 9 ms 300 KB Output is correct
25 Correct 14 ms 324 KB Output is correct
26 Correct 22 ms 308 KB Output is correct
27 Correct 14 ms 420 KB Output is correct
28 Correct 7 ms 208 KB Output is correct
29 Correct 33 ms 292 KB Output is correct
30 Correct 14 ms 208 KB Output is correct
31 Correct 26 ms 208 KB Output is correct
32 Correct 25 ms 312 KB Output is correct
33 Correct 21 ms 208 KB Output is correct
34 Correct 23 ms 208 KB Output is correct
35 Correct 23 ms 208 KB Output is correct
36 Correct 26 ms 312 KB Output is correct
37 Correct 37 ms 420 KB Output is correct
38 Correct 28 ms 208 KB Output is correct
39 Correct 24 ms 296 KB Output is correct
40 Correct 10 ms 208 KB Output is correct
41 Correct 7 ms 312 KB Output is correct

Subtask #3
57.23 / 75.0

# Verdict Execution time Memory 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 0 ms 208 KB Output is correct
7 Correct 13 ms 208 KB Output is correct
8 Correct 11 ms 316 KB Output is correct
9 Correct 28 ms 296 KB Output is correct
10 Partially correct 48 ms 304 KB Output is partially correct
11 Correct 34 ms 300 KB Output is correct
12 Correct 19 ms 316 KB Output is correct
13 Correct 28 ms 304 KB Output is correct
14 Correct 33 ms 208 KB Output is correct
15 Partially correct 57 ms 308 KB Output is partially correct
16 Correct 46 ms 308 KB Output is correct
17 Partially correct 75 ms 304 KB Output is partially correct
18 Partially correct 81 ms 300 KB Output is partially correct
19 Partially correct 52 ms 208 KB Output is partially correct
20 Partially correct 75 ms 320 KB Output is partially correct
21 Partially correct 76 ms 308 KB Output is partially correct
22 Correct 39 ms 308 KB Output is correct
23 Correct 46 ms 304 KB Output is correct
24 Correct 39 ms 208 KB Output is correct
25 Correct 22 ms 296 KB Output is correct
26 Correct 8 ms 312 KB Output is correct
27 Partially correct 47 ms 296 KB Output is partially correct
28 Partially correct 88 ms 208 KB Output is partially correct
29 Partially correct 49 ms 304 KB Output is partially correct
30 Partially correct 35 ms 328 KB Output is partially correct
31 Partially correct 99 ms 304 KB Output is partially correct
32 Partially correct 40 ms 300 KB Output is partially correct
33 Partially correct 76 ms 292 KB Output is partially correct
34 Partially correct 53 ms 308 KB Output is partially correct
35 Partially correct 72 ms 296 KB Output is partially correct
36 Partially correct 62 ms 208 KB Output is partially correct
37 Partially correct 85 ms 292 KB Output is partially correct
38 Partially correct 55 ms 308 KB Output is partially correct
39 Correct 31 ms 308 KB Output is correct
40 Correct 36 ms 296 KB Output is correct
41 Correct 38 ms 296 KB Output is correct
42 Correct 25 ms 312 KB Output is correct
43 Correct 12 ms 312 KB Output is correct
44 Correct 29 ms 208 KB Output is correct
45 Correct 25 ms 292 KB Output is correct
46 Correct 23 ms 316 KB Output is correct
47 Correct 20 ms 208 KB Output is correct
48 Correct 28 ms 316 KB Output is correct