oj.uz

답안 #1058459

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1058459 2024-08-14T10:05:06 Z fuad27 드문 곤충 (IOI22_insects) C++17
96.05 / 100
 43 ms 1668 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);
				int val = press_button();
				idxs.insert(j);
				if(val == mid and idxs.size() == mid*distcnt)break;
				if(val <= mid) {
					continue;
				}
				idxs.erase(j);
				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);
				int val = press_button();
				idxs.insert(j);
				if(val == mid and idxs.size() == mid*distcnt)break;
				if(val <= mid) {
					continue;
				}
				idxs.erase(j);
				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:33:35: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   33 |     if(val == mid and idxs.size() == mid*distcnt)break;
      |                       ~~~~~~~~~~~~^~~~~~~~~~~~~~
insects.cpp:71:35: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   71 |     if(val == mid and idxs.size() == mid*distcnt)break;
      |                       ~~~~~~~~~~~~^~~~~~~~~~~~~~
insects.cpp:54:8: warning: unused variable 'curn' [-Wunused-variable]
   54 |    int curn=0;
      |        ^~~~
insects.cpp:79:18: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   79 |   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 440 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 3 ms 344 KB Output is correct
9 Correct 4 ms 600 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 3 ms 432 KB Output is correct
14 Correct 3 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 3 ms 468 KB Output is correct
18 Correct 3 ms 344 KB Output is correct
19 Correct 3 ms 472 KB Output is correct
20 Correct 3 ms 460 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

# 결과 실행 시간 메모리 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 440 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 3 ms 344 KB Output is correct
9 Correct 4 ms 600 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 3 ms 432 KB Output is correct
14 Correct 3 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 3 ms 468 KB Output is correct
18 Correct 3 ms 344 KB Output is correct
19 Correct 3 ms 472 KB Output is correct
20 Correct 3 ms 460 KB Output is correct
21 Correct 2 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 10 ms 864 KB Output is correct
24 Correct 5 ms 1236 KB Output is correct
25 Correct 10 ms 872 KB Output is correct
26 Correct 12 ms 776 KB Output is correct
27 Correct 8 ms 440 KB Output is correct
28 Correct 4 ms 452 KB Output is correct
29 Correct 16 ms 440 KB Output is correct
30 Correct 12 ms 704 KB Output is correct
31 Correct 13 ms 660 KB Output is correct
32 Correct 10 ms 748 KB Output is correct
33 Correct 15 ms 796 KB Output is correct
34 Correct 11 ms 516 KB Output is correct
35 Correct 15 ms 644 KB Output is correct
36 Correct 17 ms 704 KB Output is correct
37 Correct 12 ms 444 KB Output is correct
38 Correct 17 ms 596 KB Output is correct
39 Correct 14 ms 600 KB Output is correct
40 Correct 4 ms 464 KB Output is correct
41 Correct 4 ms 1112 KB Output is correct

Subtask #3
71.05 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 356 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 15 ms 1336 KB Output is correct
8 Correct 8 ms 708 KB Output is correct
9 Correct 25 ms 1080 KB Output is correct
10 Correct 27 ms 1060 KB Output is correct
11 Correct 20 ms 848 KB Output is correct
12 Correct 10 ms 600 KB Output is correct
13 Partially correct 43 ms 556 KB Output is partially correct
14 Correct 33 ms 436 KB Output is correct
15 Correct 23 ms 1188 KB Output is correct
16 Correct 25 ms 1204 KB Output is correct
17 Correct 27 ms 1188 KB Output is correct
18 Correct 23 ms 1284 KB Output is correct
19 Correct 27 ms 1220 KB Output is correct
20 Correct 28 ms 1156 KB Output is correct
21 Partially correct 24 ms 948 KB Output is partially correct
22 Partially correct 30 ms 684 KB Output is partially correct
23 Correct 25 ms 844 KB Output is correct
24 Correct 28 ms 848 KB Output is correct
25 Correct 10 ms 712 KB Output is correct
26 Correct 13 ms 596 KB Output is correct
27 Correct 20 ms 848 KB Output is correct
28 Correct 24 ms 1052 KB Output is correct
29 Correct 22 ms 1104 KB Output is correct
30 Correct 28 ms 1140 KB Output is correct
31 Correct 30 ms 840 KB Output is correct
32 Correct 18 ms 696 KB Output is correct
33 Correct 28 ms 992 KB Output is correct
34 Correct 25 ms 824 KB Output is correct
35 Correct 29 ms 1192 KB Output is correct
36 Correct 20 ms 972 KB Output is correct
37 Correct 27 ms 1212 KB Output is correct
38 Correct 17 ms 820 KB Output is correct
39 Correct 28 ms 768 KB Output is correct
40 Correct 24 ms 1668 KB Output is correct
41 Correct 21 ms 972 KB Output is correct
42 Correct 21 ms 960 KB Output is correct
43 Correct 9 ms 344 KB Output is correct
44 Correct 20 ms 776 KB Output is correct
45 Correct 18 ms 1616 KB Output is correct
46 Correct 22 ms 600 KB Output is correct
47 Correct 8 ms 976 KB Output is correct
48 Correct 8 ms 756 KB Output is correct