Submission #1057802

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1057802	2024-08-14T06:16:17 Z	fuad27	Rarest Insects (IOI22_insects)	C++17	90.83 / 100	47 ms	1376 KB

insects

#include "insects.h"
#include <bits/stdc++.h>
using namespace std;
int min_cardinality(int N) {
	int distcnt = 0;
	set<int> idxs;
	for(int i = 0;i<N;i++) {
		move_inside(i);
		if(press_button() <= 1){
			idxs.insert(i);
			distcnt++;
			continue;
		}
		move_outside(i);
	}
	set<int> all_idxs[N+1];
	all_idxs[1] = idxs;
	int ans=1;
	int prev = 1;
	int lo = 2, hi = N/distcnt;
	while(lo <= hi) {
		int mid = (lo+hi)/2;
		if(prev < mid) {
			for(int j = 0;j<N;j++) {
				if(idxs.find(j)!=idxs.end())continue;
				move_inside(j);
				if(press_button() <= mid) {
					idxs.insert(j);
					continue;
				}
				move_outside(j);
			}
		}
		else {
			int cur = 1;
			for(int j = 1;j<mid;j++) {
				if(all_idxs[j].size() > all_idxs[cur].size()) {
					cur=j;
				}
			}
			vector<int> er;
			for(int j:idxs) {
				if(all_idxs[cur].find(j)==all_idxs[cur].end()) {
					er.push_back(j);
				}
			}
			int curn=0;
			for(int j = mid+1;j<N;j++) {
				if(all_idxs[j].size()) {
					cur=j;
					break;
				}
			}
			for(int j:er){
				move_outside(j);
				idxs.erase(j);
				if(press_button() <= mid)break;
			}
			for(int j = 0;j<N;j++) {
				if(idxs.find(j)!=idxs.end())continue;
				if(all_idxs[cur].find(j)==all_idxs[cur].end())continue;
				move_inside(j);
				if(press_button() <= mid) {
					idxs.insert(j);
					continue;
				}
				move_outside(j);
			}
		}
		if(idxs.size() == distcnt*mid) {
			lo = mid+1;
			ans=mid;
		}
		else {
			hi=mid-1;
		}
		all_idxs[mid] = idxs;
		prev=mid;
	}
	return ans;
}

Compilation message

insects.cpp: In function 'int min_cardinality(int)':
insects.cpp:47:8: warning: unused variable 'curn' [-Wunused-variable]
   47 |    int curn=0;
      |        ^~~~
insects.cpp:70:18: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   70 |   if(idxs.size() == distcnt*mid) {
      |      ~~~~~~~~~~~~^~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	0 ms	344 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	4 ms	344 KB	Output is correct
7	Correct	1 ms	444 KB	Output is correct
8	Correct	3 ms	340 KB	Output is correct
9	Correct	3 ms	344 KB	Output is correct
10	Correct	2 ms	344 KB	Output is correct
11	Correct	1 ms	344 KB	Output is correct
12	Correct	2 ms	436 KB	Output is correct
13	Correct	2 ms	436 KB	Output is correct
14	Correct	4 ms	600 KB	Output is correct
15	Correct	3 ms	600 KB	Output is correct
16	Correct	2 ms	344 KB	Output is correct
17	Correct	2 ms	448 KB	Output is correct
18	Correct	4 ms	344 KB	Output is correct
19	Correct	2 ms	344 KB	Output is correct
20	Correct	2 ms	344 KB	Output is correct
21	Correct	2 ms	344 KB	Output is correct
22	Correct	1 ms	344 KB	Output is correct

Subtask #2
15.0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	0 ms	344 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	4 ms	344 KB	Output is correct
7	Correct	1 ms	444 KB	Output is correct
8	Correct	3 ms	340 KB	Output is correct
9	Correct	3 ms	344 KB	Output is correct
10	Correct	2 ms	344 KB	Output is correct
11	Correct	1 ms	344 KB	Output is correct
12	Correct	2 ms	436 KB	Output is correct
13	Correct	2 ms	436 KB	Output is correct
14	Correct	4 ms	600 KB	Output is correct
15	Correct	3 ms	600 KB	Output is correct
16	Correct	2 ms	344 KB	Output is correct
17	Correct	2 ms	448 KB	Output is correct
18	Correct	4 ms	344 KB	Output is correct
19	Correct	2 ms	344 KB	Output is correct
20	Correct	2 ms	344 KB	Output is correct
21	Correct	2 ms	344 KB	Output is correct
22	Correct	1 ms	344 KB	Output is correct
23	Correct	13 ms	856 KB	Output is correct
24	Correct	3 ms	344 KB	Output is correct
25	Correct	11 ms	524 KB	Output is correct
26	Correct	12 ms	1140 KB	Output is correct
27	Correct	8 ms	344 KB	Output is correct
28	Correct	4 ms	448 KB	Output is correct
29	Correct	14 ms	344 KB	Output is correct
30	Correct	15 ms	492 KB	Output is correct
31	Correct	12 ms	848 KB	Output is correct
32	Correct	11 ms	664 KB	Output is correct
33	Correct	13 ms	688 KB	Output is correct
34	Correct	15 ms	840 KB	Output is correct
35	Correct	12 ms	660 KB	Output is correct
36	Correct	11 ms	568 KB	Output is correct
37	Correct	9 ms	592 KB	Output is correct
38	Correct	14 ms	1108 KB	Output is correct
39	Correct	9 ms	600 KB	Output is correct
40	Correct	5 ms	700 KB	Output is correct
41	Correct	4 ms	344 KB	Output is correct

Subtask #3
65.83 / 75.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	0 ms	344 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	0 ms	344 KB	Output is correct
7	Correct	21 ms	1376 KB	Output is correct
8	Correct	9 ms	600 KB	Output is correct
9	Correct	26 ms	924 KB	Output is correct
10	Partially correct	26 ms	960 KB	Output is partially correct
11	Correct	13 ms	708 KB	Output is correct
12	Correct	11 ms	600 KB	Output is correct
13	Partially correct	32 ms	540 KB	Output is partially correct
14	Partially correct	32 ms	548 KB	Output is partially correct
15	Partially correct	24 ms	988 KB	Output is partially correct
16	Partially correct	22 ms	1320 KB	Output is partially correct
17	Partially correct	20 ms	1108 KB	Output is partially correct
18	Partially correct	34 ms	1044 KB	Output is partially correct
19	Partially correct	33 ms	1140 KB	Output is partially correct
20	Partially correct	28 ms	1224 KB	Output is partially correct
21	Partially correct	33 ms	848 KB	Output is partially correct
22	Partially correct	47 ms	992 KB	Output is partially correct
23	Partially correct	31 ms	620 KB	Output is partially correct
24	Correct	30 ms	668 KB	Output is correct
25	Correct	12 ms	600 KB	Output is correct
26	Correct	7 ms	460 KB	Output is correct
27	Correct	28 ms	808 KB	Output is correct
28	Correct	25 ms	856 KB	Output is correct
29	Partially correct	21 ms	1316 KB	Output is partially correct
30	Partially correct	15 ms	1188 KB	Output is partially correct
31	Correct	28 ms	864 KB	Output is correct
32	Partially correct	25 ms	592 KB	Output is partially correct
33	Correct	17 ms	620 KB	Output is correct
34	Correct	32 ms	428 KB	Output is correct
35	Partially correct	23 ms	872 KB	Output is partially correct
36	Partially correct	23 ms	944 KB	Output is partially correct
37	Correct	21 ms	792 KB	Output is correct
38	Correct	22 ms	808 KB	Output is correct
39	Correct	21 ms	784 KB	Output is correct
40	Correct	20 ms	892 KB	Output is correct
41	Partially correct	26 ms	928 KB	Output is partially correct
42	Partially correct	25 ms	1048 KB	Output is partially correct
43	Correct	6 ms	436 KB	Output is correct
44	Correct	18 ms	344 KB	Output is correct
45	Correct	29 ms	1292 KB	Output is correct
46	Correct	11 ms	716 KB	Output is correct
47	Correct	8 ms	620 KB	Output is correct
48	Correct	16 ms	600 KB	Output is correct

Submission #1057802

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 15.0 / 15.0

Subtask #3 65.83 / 75.0

Subtask #1
10.0 / 10.0

Subtask #2
15.0 / 15.0

Subtask #3
65.83 / 75.0