답안 #631232

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
631232	2022-08-17T21:11:58 Z	fuad27	드문 곤충 (IOI22_insects)	C++17	50.59 / 100	156 ms	452 KB

insects

#include "insects.h"
#include <bits/stdc++.h>
using namespace std;
int min_cardinality(int N) {
	vector<int> idx_type;
	idx_type.push_back(0);
	move_inside(0);
	for(int i = 1;i<N;i++) {
		move_inside(i);
		int val=press_button();
		if(val == 2)move_outside(i);
		else idx_type.push_back(i);
	}
	for(int i:idx_type) {
		//~ cout << i << endl;
		move_outside(i);
	}
	vector<int> l(N, -1), r(N, idx_type.size()-1);
	for(int i = 0;i<idx_type.size();i++) {
		r[idx_type[i]]=i;
		l[idx_type[i]]=i-1;
	}
	vector<pair<int,int>> que;
	int tmp=0;
	while(1) {
		que.clear();
		bool check=false;
		for(int i = 0;i<N;i++) {
			if(r[i]-l[i]<=1)continue;
			que.push_back({(r[i]+l[i])/2, i});
			check=true;
		}
		int cnt=tmp;
		sort(que.begin(), que.end());
		for(int i = 0;i<que.size();i++) {
			int mid = que[i].first;
			while(cnt > mid+1) {
				move_outside(idx_type[--cnt]);
			}
			while(cnt <= mid) {
				move_inside(idx_type[cnt++]);
			}
			move_inside(que[i].second);
			int val=press_button();
			//~ assert(val!=3);
			if(val == 2) {
				r[que[i].second]=que[i].first;
				//~ cout << que[i].second << " " << mid << " " << val << endl;
			}
			else {
				l[que[i].second]=que[i].first;
				//~ cout << que[i].second << " " << mid << " " << val << endl;
			}
			move_outside(que[i].second);
		}
		tmp=cnt;
		if(!check)break;
	}
	vector<int> cnt(N+1, 0);
	for(int i = 0;i<N;i++) {
		//~ cout << idx_type[r[i]] << " ";
		cnt[idx_type[r[i]]]++;
	}
	//~ cout << endl;
	int ans=20000;
	for(int i = 0;i<N;i++) {
		if(cnt[i]==0)continue;
		ans=min(ans, cnt[i]);
	}
	return ans;
}

Compilation message

insects.cpp: In function 'int min_cardinality(int)':
insects.cpp:19:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |  for(int i = 0;i<idx_type.size();i++) {
      |                ~^~~~~~~~~~~~~~~~
insects.cpp:35:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |   for(int i = 0;i<que.size();i++) {
      |                 ~^~~~~~~~~~~

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	0 ms	208 KB	Output is correct
4	Correct	0 ms	208 KB	Output is correct
5	Correct	0 ms	208 KB	Output is correct
6	Correct	1 ms	236 KB	Output is correct
7	Correct	2 ms	208 KB	Output is correct
8	Correct	13 ms	208 KB	Output is correct
9	Correct	13 ms	304 KB	Output is correct
10	Correct	5 ms	208 KB	Output is correct
11	Correct	9 ms	208 KB	Output is correct
12	Correct	6 ms	304 KB	Output is correct
13	Correct	10 ms	300 KB	Output is correct
14	Correct	7 ms	208 KB	Output is correct
15	Correct	7 ms	304 KB	Output is correct
16	Correct	8 ms	208 KB	Output is correct
17	Correct	10 ms	336 KB	Output is correct
18	Correct	8 ms	208 KB	Output is correct
19	Correct	11 ms	300 KB	Output is correct
20	Correct	10 ms	208 KB	Output is correct
21	Correct	5 ms	304 KB	Output is correct
22	Correct	7 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	0 ms	208 KB	Output is correct
4	Correct	0 ms	208 KB	Output is correct
5	Correct	0 ms	208 KB	Output is correct
6	Correct	1 ms	236 KB	Output is correct
7	Correct	2 ms	208 KB	Output is correct
8	Correct	13 ms	208 KB	Output is correct
9	Correct	13 ms	304 KB	Output is correct
10	Correct	5 ms	208 KB	Output is correct
11	Correct	9 ms	208 KB	Output is correct
12	Correct	6 ms	304 KB	Output is correct
13	Correct	10 ms	300 KB	Output is correct
14	Correct	7 ms	208 KB	Output is correct
15	Correct	7 ms	304 KB	Output is correct
16	Correct	8 ms	208 KB	Output is correct
17	Correct	10 ms	336 KB	Output is correct
18	Correct	8 ms	208 KB	Output is correct
19	Correct	11 ms	300 KB	Output is correct
20	Correct	10 ms	208 KB	Output is correct
21	Correct	5 ms	304 KB	Output is correct
22	Correct	7 ms	208 KB	Output is correct
23	Correct	8 ms	296 KB	Output is correct
24	Correct	10 ms	300 KB	Output is correct
25	Correct	53 ms	288 KB	Output is correct
26	Correct	47 ms	208 KB	Output is correct
27	Correct	17 ms	288 KB	Output is correct
28	Correct	46 ms	296 KB	Output is correct
29	Correct	30 ms	208 KB	Output is correct
30	Correct	54 ms	296 KB	Output is correct
31	Correct	33 ms	296 KB	Output is correct
32	Correct	42 ms	296 KB	Output is correct
33	Correct	38 ms	292 KB	Output is correct
34	Correct	45 ms	288 KB	Output is correct
35	Correct	37 ms	208 KB	Output is correct
36	Correct	50 ms	292 KB	Output is correct
37	Correct	61 ms	288 KB	Output is correct
38	Correct	50 ms	208 KB	Output is correct
39	Correct	68 ms	296 KB	Output is correct
40	Correct	59 ms	296 KB	Output is correct
41	Correct	42 ms	304 KB	Output is correct

Subtask #3
25.59 / 75.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	208 KB	Output is correct
2	Correct	0 ms	208 KB	Output is correct
3	Correct	0 ms	208 KB	Output is correct
4	Correct	0 ms	208 KB	Output is correct
5	Correct	0 ms	208 KB	Output is correct
6	Correct	0 ms	208 KB	Output is correct
7	Correct	13 ms	292 KB	Output is correct
8	Correct	18 ms	300 KB	Output is correct
9	Partially correct	123 ms	276 KB	Output is partially correct
10	Partially correct	117 ms	284 KB	Output is partially correct
11	Correct	27 ms	284 KB	Output is correct
12	Partially correct	97 ms	300 KB	Output is partially correct
13	Partially correct	61 ms	276 KB	Output is partially correct
14	Partially correct	62 ms	296 KB	Output is partially correct
15	Partially correct	60 ms	288 KB	Output is partially correct
16	Partially correct	107 ms	208 KB	Output is partially correct
17	Partially correct	79 ms	328 KB	Output is partially correct
18	Partially correct	87 ms	284 KB	Output is partially correct
19	Partially correct	92 ms	280 KB	Output is partially correct
20	Partially correct	73 ms	328 KB	Output is partially correct
21	Partially correct	127 ms	280 KB	Output is partially correct
22	Partially correct	123 ms	288 KB	Output is partially correct
23	Partially correct	100 ms	300 KB	Output is partially correct
24	Partially correct	146 ms	296 KB	Output is partially correct
25	Partially correct	109 ms	452 KB	Output is partially correct
26	Partially correct	86 ms	328 KB	Output is partially correct
27	Partially correct	131 ms	284 KB	Output is partially correct
28	Partially correct	75 ms	288 KB	Output is partially correct
29	Partially correct	101 ms	292 KB	Output is partially correct
30	Partially correct	61 ms	276 KB	Output is partially correct
31	Partially correct	125 ms	276 KB	Output is partially correct
32	Partially correct	156 ms	292 KB	Output is partially correct
33	Partially correct	134 ms	284 KB	Output is partially correct
34	Partially correct	123 ms	284 KB	Output is partially correct
35	Partially correct	139 ms	292 KB	Output is partially correct
36	Partially correct	132 ms	288 KB	Output is partially correct
37	Partially correct	111 ms	280 KB	Output is partially correct
38	Partially correct	117 ms	280 KB	Output is partially correct
39	Partially correct	147 ms	292 KB	Output is partially correct
40	Partially correct	66 ms	292 KB	Output is partially correct
41	Partially correct	125 ms	280 KB	Output is partially correct
42	Partially correct	128 ms	292 KB	Output is partially correct
43	Partially correct	23 ms	208 KB	Output is partially correct
44	Partially correct	24 ms	288 KB	Output is partially correct
45	Correct	34 ms	292 KB	Output is correct
46	Partially correct	109 ms	208 KB	Output is partially correct
47	Partially correct	107 ms	316 KB	Output is partially correct
48	Partially correct	102 ms	320 KB	Output is partially correct

답안 #631232

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 15.0 / 15.0

Subtask #3 25.59 / 75.0

Subtask #1
10.0 / 10.0

Subtask #2
15.0 / 15.0

Subtask #3
25.59 / 75.0