oj.uz

답안 #667048

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
667048 2022-11-30T08:58:13 Z mychecksedad 드문 곤충 (IOI22_insects) C++17
25 / 100
 188 ms 496 KB 
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
void move_inside(int i);
void move_outside(int i);
int press_button();


int min_cardinality(int n){
	set<int> v;
	for(int i = 0; i < n; ++i){
		v.insert(i);
		move_inside(i);
	}
	int ans = n;
	while(1){
		int k = press_button();
		vector<bool> in(n, 1);
		if(k == v.size() || k == 1){
			return k;
		}else if(k >= sqrt(n)){
			int index = 0;
			for(int i: v){
				move_outside(i);
				in[i] = 0;
				int k1 = press_button();
				if(k1 != k){
					index = i;
					break;
				}
			}
			for(int x: v) if(in[x]) move_outside(x), in[x] = 0;
			move_inside(index);
			in[index] = 1;
			vector<int> removed = {index};
			for(int i: v){
				if(i != index){
					move_inside(i);
					int k1 = press_button();
					if(k1 > 1){
						removed.pb(i);
					}
					move_outside(i);
				}
			}
			for(int x: removed) v.erase(x);
		}else{
			for(int i: v){
				in[i] = 0;
				move_outside(i);
			}
			int group_num = 0;
			for(int i: v){
				move_inside(i);
				int k1 = press_button();
				in[i] = 1;
				if(k1 > 1){
					move_outside(i);
					in[i] = 0;
				}else group_num++;
			}
			vector<int> removed;
			for(int i: v){
				if(in[i]) continue;
				move_inside(i);
				int k1 = press_button();
				if(k1 == k){
					removed.pb(i);
					move_outside(i);
				}else in[i] = 1;
			}
			if(removed.size() == group_num){
				return k;
			}
			for(int i: removed) v.erase(i);
		}
		for(int x: v) if(!in[x]) move_inside(x);
	}
	return ans;
}

Compilation message

insects.cpp: In function 'int min_cardinality(int)':
insects.cpp:19:8: warning: comparison of integer expressions of different signedness: 'int' and 'std::set<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |   if(k == v.size() || k == 1){
      |      ~~^~~~~~~~~~~
insects.cpp:72:22: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   72 |    if(removed.size() == group_num){
      |       ~~~~~~~~~~~~~~~^~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 9 ms 208 KB Output is correct
9 Correct 16 ms 208 KB Output is correct
10 Correct 2 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 5 ms 208 KB Output is correct
13 Correct 12 ms 208 KB Output is correct
14 Correct 5 ms 208 KB Output is correct
15 Correct 6 ms 208 KB Output is correct
16 Correct 8 ms 208 KB Output is correct
17 Correct 12 ms 208 KB Output is correct
18 Correct 18 ms 208 KB Output is correct
19 Correct 22 ms 208 KB Output is correct
20 Correct 27 ms 208 KB Output is correct
21 Correct 12 ms 208 KB Output is correct
22 Correct 8 ms 208 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 9 ms 208 KB Output is correct
9 Correct 16 ms 208 KB Output is correct
10 Correct 2 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 5 ms 208 KB Output is correct
13 Correct 12 ms 208 KB Output is correct
14 Correct 5 ms 208 KB Output is correct
15 Correct 6 ms 208 KB Output is correct
16 Correct 8 ms 208 KB Output is correct
17 Correct 12 ms 208 KB Output is correct
18 Correct 18 ms 208 KB Output is correct
19 Correct 22 ms 208 KB Output is correct
20 Correct 27 ms 208 KB Output is correct
21 Correct 12 ms 208 KB Output is correct
22 Correct 8 ms 208 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 120 ms 336 KB Output is correct
26 Correct 157 ms 336 KB Output is correct
27 Correct 9 ms 336 KB Output is correct
28 Correct 11 ms 336 KB Output is correct
29 Correct 27 ms 336 KB Output is correct
30 Correct 150 ms 452 KB Output is correct
31 Correct 24 ms 336 KB Output is correct
32 Correct 19 ms 348 KB Output is correct
33 Correct 58 ms 336 KB Output is correct
34 Correct 54 ms 336 KB Output is correct
35 Correct 72 ms 336 KB Output is correct
36 Correct 86 ms 336 KB Output is correct
37 Correct 127 ms 336 KB Output is correct
38 Correct 188 ms 336 KB Output is correct
39 Correct 124 ms 336 KB Output is correct
40 Correct 69 ms 336 KB Output is correct
41 Correct 66 ms 336 KB Output is correct

Subtask #3
0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 2 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 396 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Incorrect 166 ms 496 KB Too many queries.
10 Halted 0 ms 0 KB -