답안 #1057812

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1057812	2024-08-14T06:22:20 Z	fuad27	드문 곤충 (IOI22_insects)	C++17	91.93 / 100	55 ms	1464 KB

insects

#include "insects.h"
#include <bits/stdc++.h>
using namespace std;
int min_cardinality(int N) {
	int distcnt = 0;
	set<int> idxs;
	mt19937 rng(time(0));
	vector<int> alll(N);
	iota(alll.begin(), alll.end() ,0);
	shuffle(alll.begin(), alll.end(), rng);
	for(int i:alll) {
		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:alll) {
				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:alll) {
				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:51:8: warning: unused variable 'curn' [-Wunused-variable]
   51 |    int curn=0;
      |        ^~~~
insects.cpp:74:18: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   74 |   if(idxs.size() == distcnt*mid) {
      |      ~~~~~~~~~~~~^~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

#	결과	실행 시간	메모리	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	2 ms	344 KB	Output is correct
7	Correct	1 ms	344 KB	Output is correct
8	Correct	2 ms	344 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	344 KB	Output is correct
13	Correct	2 ms	344 KB	Output is correct
14	Correct	3 ms	452 KB	Output is correct
15	Correct	3 ms	344 KB	Output is correct
16	Correct	2 ms	452 KB	Output is correct
17	Correct	3 ms	456 KB	Output is correct
18	Correct	3 ms	344 KB	Output is correct
19	Correct	2 ms	600 KB	Output is correct
20	Correct	2 ms	344 KB	Output is correct
21	Correct	2 ms	444 KB	Output is correct
22	Correct	1 ms	344 KB	Output is correct

Subtask #2
15.0 / 15.0

#	결과	실행 시간	메모리	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	2 ms	344 KB	Output is correct
7	Correct	1 ms	344 KB	Output is correct
8	Correct	2 ms	344 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	344 KB	Output is correct
13	Correct	2 ms	344 KB	Output is correct
14	Correct	3 ms	452 KB	Output is correct
15	Correct	3 ms	344 KB	Output is correct
16	Correct	2 ms	452 KB	Output is correct
17	Correct	3 ms	456 KB	Output is correct
18	Correct	3 ms	344 KB	Output is correct
19	Correct	2 ms	600 KB	Output is correct
20	Correct	2 ms	344 KB	Output is correct
21	Correct	2 ms	444 KB	Output is correct
22	Correct	1 ms	344 KB	Output is correct
23	Correct	11 ms	780 KB	Output is correct
24	Correct	4 ms	344 KB	Output is correct
25	Correct	12 ms	772 KB	Output is correct
26	Correct	9 ms	588 KB	Output is correct
27	Correct	6 ms	444 KB	Output is correct
28	Correct	4 ms	344 KB	Output is correct
29	Correct	24 ms	504 KB	Output is correct
30	Correct	13 ms	344 KB	Output is correct
31	Correct	12 ms	848 KB	Output is correct
32	Correct	11 ms	592 KB	Output is correct
33	Correct	10 ms	848 KB	Output is correct
34	Correct	16 ms	596 KB	Output is correct
35	Correct	13 ms	592 KB	Output is correct
36	Correct	13 ms	596 KB	Output is correct
37	Correct	12 ms	516 KB	Output is correct
38	Correct	17 ms	692 KB	Output is correct
39	Correct	10 ms	552 KB	Output is correct
40	Correct	6 ms	608 KB	Output is correct
41	Correct	5 ms	344 KB	Output is correct

Subtask #3
66.93 / 75.0

#	결과	실행 시간	메모리	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	26 ms	1464 KB	Output is correct
8	Correct	7 ms	600 KB	Output is correct
9	Correct	22 ms	1084 KB	Output is correct
10	Partially correct	31 ms	592 KB	Output is partially correct
11	Correct	17 ms	540 KB	Output is correct
12	Correct	11 ms	624 KB	Output is correct
13	Partially correct	31 ms	592 KB	Output is partially correct
14	Partially correct	36 ms	592 KB	Output is partially correct
15	Partially correct	24 ms	1124 KB	Output is partially correct
16	Partially correct	35 ms	1048 KB	Output is partially correct
17	Partially correct	33 ms	1104 KB	Output is partially correct
18	Partially correct	32 ms	948 KB	Output is partially correct
19	Partially correct	36 ms	948 KB	Output is partially correct
20	Partially correct	36 ms	1104 KB	Output is partially correct
21	Partially correct	31 ms	1072 KB	Output is partially correct
22	Partially correct	55 ms	696 KB	Output is partially correct
23	Partially correct	18 ms	600 KB	Output is partially correct
24	Correct	23 ms	676 KB	Output is correct
25	Correct	14 ms	464 KB	Output is correct
26	Correct	8 ms	600 KB	Output is correct
27	Correct	23 ms	1304 KB	Output is correct
28	Correct	35 ms	964 KB	Output is correct
29	Partially correct	19 ms	1360 KB	Output is partially correct
30	Partially correct	24 ms	1080 KB	Output is partially correct
31	Partially correct	32 ms	788 KB	Output is partially correct
32	Partially correct	26 ms	848 KB	Output is partially correct
33	Partially correct	29 ms	452 KB	Output is partially correct
34	Partially correct	33 ms	628 KB	Output is partially correct
35	Partially correct	27 ms	820 KB	Output is partially correct
36	Partially correct	31 ms	964 KB	Output is partially correct
37	Partially correct	24 ms	728 KB	Output is partially correct
38	Partially correct	23 ms	716 KB	Output is partially correct
39	Correct	20 ms	848 KB	Output is correct
40	Correct	20 ms	844 KB	Output is correct
41	Partially correct	28 ms	976 KB	Output is partially correct
42	Partially correct	19 ms	892 KB	Output is partially correct
43	Correct	5 ms	344 KB	Output is correct
44	Correct	19 ms	600 KB	Output is correct
45	Correct	22 ms	1360 KB	Output is correct
46	Correct	8 ms	592 KB	Output is correct
47	Correct	11 ms	592 KB	Output is correct
48	Correct	10 ms	600 KB	Output is correct

답안 #1057812

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 15.0 / 15.0

Subtask #3 66.93 / 75.0

Subtask #1
10.0 / 10.0

Subtask #2
15.0 / 15.0

Subtask #3
66.93 / 75.0