답안 #1057811

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1057811 2024-08-14T06:21:43 Z fuad27 드문 곤충 (IOI22_insects) C++17
93.68 / 100
40 ms 1584 KB
#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);
			}
			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:73:18: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   73 |   if(idxs.size() == distcnt*mid) {
      |      ~~~~~~~~~~~~^~~~~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 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 3 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 2 ms 436 KB Output is correct
9 Correct 5 ms 344 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 3 ms 344 KB Output is correct
13 Correct 3 ms 600 KB Output is correct
14 Correct 2 ms 440 KB Output is correct
15 Correct 3 ms 344 KB Output is correct
16 Correct 4 ms 344 KB Output is correct
17 Correct 2 ms 464 KB Output is correct
18 Correct 3 ms 600 KB Output is correct
19 Correct 2 ms 600 KB Output is correct
20 Correct 3 ms 344 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 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 3 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 2 ms 436 KB Output is correct
9 Correct 5 ms 344 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 3 ms 344 KB Output is correct
13 Correct 3 ms 600 KB Output is correct
14 Correct 2 ms 440 KB Output is correct
15 Correct 3 ms 344 KB Output is correct
16 Correct 4 ms 344 KB Output is correct
17 Correct 2 ms 464 KB Output is correct
18 Correct 3 ms 600 KB Output is correct
19 Correct 2 ms 600 KB Output is correct
20 Correct 3 ms 344 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 14 ms 796 KB Output is correct
24 Correct 4 ms 344 KB Output is correct
25 Correct 12 ms 772 KB Output is correct
26 Correct 12 ms 764 KB Output is correct
27 Correct 14 ms 696 KB Output is correct
28 Correct 3 ms 344 KB Output is correct
29 Correct 15 ms 444 KB Output is correct
30 Correct 17 ms 512 KB Output is correct
31 Correct 8 ms 804 KB Output is correct
32 Correct 9 ms 600 KB Output is correct
33 Correct 23 ms 896 KB Output is correct
34 Correct 19 ms 1368 KB Output is correct
35 Correct 17 ms 848 KB Output is correct
36 Correct 11 ms 652 KB Output is correct
37 Correct 11 ms 600 KB Output is correct
38 Correct 9 ms 344 KB Output is correct
39 Correct 6 ms 344 KB Output is correct
40 Correct 9 ms 344 KB Output is correct
41 Correct 4 ms 344 KB Output is correct
# 결과 실행 시간 메모리 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 1 ms 344 KB Output is correct
7 Correct 22 ms 1584 KB Output is correct
8 Correct 9 ms 600 KB Output is correct
9 Correct 29 ms 1288 KB Output is correct
10 Correct 30 ms 844 KB Output is correct
11 Correct 27 ms 448 KB Output is correct
12 Correct 9 ms 848 KB Output is correct
13 Partially correct 38 ms 592 KB Output is partially correct
14 Correct 16 ms 592 KB Output is correct
15 Partially correct 19 ms 1108 KB Output is partially correct
16 Partially correct 40 ms 1192 KB Output is partially correct
17 Partially correct 29 ms 1292 KB Output is partially correct
18 Partially correct 39 ms 1192 KB Output is partially correct
19 Partially correct 37 ms 1104 KB Output is partially correct
20 Partially correct 29 ms 1064 KB Output is partially correct
21 Partially correct 32 ms 704 KB Output is partially correct
22 Partially correct 39 ms 636 KB Output is partially correct
23 Correct 26 ms 600 KB Output is correct
24 Correct 14 ms 604 KB Output is correct
25 Correct 11 ms 592 KB Output is correct
26 Correct 6 ms 476 KB Output is correct
27 Correct 21 ms 836 KB Output is correct
28 Correct 30 ms 1104 KB Output is correct
29 Partially correct 23 ms 1104 KB Output is partially correct
30 Partially correct 31 ms 944 KB Output is partially correct
31 Correct 27 ms 596 KB Output is correct
32 Correct 29 ms 844 KB Output is correct
33 Correct 19 ms 596 KB Output is correct
34 Correct 24 ms 952 KB Output is correct
35 Partially correct 25 ms 852 KB Output is partially correct
36 Partially correct 32 ms 1128 KB Output is partially correct
37 Correct 23 ms 804 KB Output is correct
38 Correct 28 ms 848 KB Output is correct
39 Correct 21 ms 828 KB Output is correct
40 Correct 24 ms 848 KB Output is correct
41 Partially correct 22 ms 1056 KB Output is partially correct
42 Partially correct 26 ms 952 KB Output is partially correct
43 Correct 4 ms 344 KB Output is correct
44 Correct 17 ms 788 KB Output is correct
45 Correct 24 ms 1204 KB Output is correct
46 Correct 9 ms 724 KB Output is correct
47 Correct 11 ms 468 KB Output is correct
48 Correct 9 ms 736 KB Output is correct