Submission #830797

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
830797	2023-08-19T10:45:12 Z	FatihSolak	Rarest Insects (IOI22_insects)	C++17	75.52 / 100	115 ms	436 KB

insects

#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(N/dif > (1<<5) && dif <= 9){
		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())
					del2();
				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;
	}
	int l = 1,r = N/dif;
	while(l < r){
		int m = (l + r + 1)/2;
		int tmp = now;
		press_button();
		assert(now == tmp);
		if(now < m){
			for(int i = 0;i<N;i++){
				if(v.size() == m * dif)
					break;
				if(find(v.begin(),v.end(),i) == v.end()){
					add(i);
					if(now > m)
						del2();
				}
			}
		}
		else{
			while(now > m){
				del();
			}
			for(int i = 0;i<N;i++){
				if(v.size() == m * dif)
					break;
				if(find(v.begin(),v.end(),i) == v.end()){
					add(i);
					if(now > m)
						del2();
				}
			}
		}
		if(v.size() == m * dif){
			l  = m;
		}
		else r = m -1;
	}
	return l;
}

Compilation message

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

Subtask #1
10.0 / 10.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	2 ms	208 KB	Output is correct
7	Correct	1 ms	208 KB	Output is correct
8	Correct	5 ms	208 KB	Output is correct
9	Correct	5 ms	208 KB	Output is correct
10	Correct	4 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	8 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	6 ms	208 KB	Output is correct
17	Correct	6 ms	208 KB	Output is correct
18	Correct	8 ms	208 KB	Output is correct
19	Correct	2 ms	208 KB	Output is correct
20	Correct	7 ms	208 KB	Output is correct
21	Correct	2 ms	208 KB	Output is correct
22	Correct	1 ms	208 KB	Output is correct

Subtask #2
15.0 / 15.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	2 ms	208 KB	Output is correct
7	Correct	1 ms	208 KB	Output is correct
8	Correct	5 ms	208 KB	Output is correct
9	Correct	5 ms	208 KB	Output is correct
10	Correct	4 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	8 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	6 ms	208 KB	Output is correct
17	Correct	6 ms	208 KB	Output is correct
18	Correct	8 ms	208 KB	Output is correct
19	Correct	2 ms	208 KB	Output is correct
20	Correct	7 ms	208 KB	Output is correct
21	Correct	2 ms	208 KB	Output is correct
22	Correct	1 ms	208 KB	Output is correct
23	Correct	9 ms	208 KB	Output is correct
24	Correct	4 ms	316 KB	Output is correct
25	Correct	12 ms	288 KB	Output is correct
26	Correct	15 ms	208 KB	Output is correct
27	Correct	17 ms	208 KB	Output is correct
28	Correct	9 ms	208 KB	Output is correct
29	Correct	21 ms	208 KB	Output is correct
30	Correct	45 ms	208 KB	Output is correct
31	Correct	31 ms	208 KB	Output is correct
32	Correct	20 ms	208 KB	Output is correct
33	Correct	29 ms	312 KB	Output is correct
34	Correct	17 ms	312 KB	Output is correct
35	Correct	20 ms	308 KB	Output is correct
36	Correct	32 ms	208 KB	Output is correct
37	Correct	29 ms	208 KB	Output is correct
38	Correct	32 ms	208 KB	Output is correct
39	Correct	19 ms	208 KB	Output is correct
40	Correct	10 ms	208 KB	Output is correct
41	Correct	7 ms	308 KB	Output is correct

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

Submission #830797

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 15.0 / 15.0

Subtask #3 50.52 / 75.0

Subtask #1
10.0 / 10.0

Subtask #2
15.0 / 15.0

Subtask #3
50.52 / 75.0