oj.uz

답안 #1060429

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1060429 2024-08-15T14:14:37 Z parsadox2 드문 곤충 (IOI22_insects) C++17
92.73 / 100
 65 ms 668 KB 
#include <bits/stdc++.h>
#include "insects.h"
 
using namespace std;
 
const int N = 2e3 + 10 , Lg = 10;
int n , ans;
bool bad[N] , dead[N];
 
bool check(int mid)
{
	//cout << "Check : " << mid << endl;
	int all = 0;
	for(int i = 0 ; i < n ; i++)  if(!dead[i])
	{
		bad[i] = false;
		all++;
		move_inside(i);
		int val = press_button();
		if(val > mid)
		{
			bad[i] = true;
			move_outside(i);
		}
	}
	for(int i = 0 ; i < n ; i++)  if(!bad[i] && !dead[i])
		move_outside(i);
	bool flg = true;
	vector <int> vec;
	int cnt = 0;
	for(int i = 0 ; i < n ; i++)  if(bad[i] && !dead[i])
	{
		//cout << "BAD " << i << endl;
		flg = false;
		move_inside(i);
		int val = press_button();
		if(val > 1)
		{
			move_outside(i);
			cnt++;
		}
		else
		{
			cnt += (mid + 1);
			vec.push_back(i);
		}
	}
	for(auto u : vec)
	{
		move_outside(u);
	}
	if(cnt == all)
	{
		for(int i = 0 ; i < n ; i++)  if(!dead[i] && !bad[i])
			dead[i] = true;
		return false;
	}
	for(int i = 0 ; i < n ; i++)  if(bad[i] && !dead[i])
		dead[i] = true;
	return true;
}
 
int min_cardinality(int nn)
{
	n = nn;
	int cnt = 0;
	vector <int> vec;
	for(int i = 0 ; i < n ; i++)
	{
		move_inside(i);
		int val = press_button();
		if(val == 1)
		{
			cnt++;
			vec.push_back(i);
		}
		else
		{
			move_outside(i);
		}
	}
	for(auto u : vec)
		move_outside(u);
	//cout << cnt << endl;
	int mx = n / cnt;
	while(mx > 1)
	{
		int mid = mx / 2;
		if(!check(mid))
		{
			mx = mx - mid;
			ans += mid;
		}
		else
		{
			mx = mid;
		}
	}
	return ans + 1;
}

Compilation message

insects.cpp: In function 'bool check(int)':
insects.cpp:28:7: warning: variable 'flg' set but not used [-Wunused-but-set-variable]
   28 |  bool flg = true;
      |       ^~~

Subtask #1
10.0 / 10.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 1 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 4 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 4 ms 344 KB Output is correct
9 Correct 4 ms 344 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 2 ms 344 KB Output is correct
12 Correct 4 ms 344 KB Output is correct
13 Correct 3 ms 340 KB Output is correct
14 Correct 4 ms 344 KB Output is correct
15 Correct 4 ms 344 KB Output is correct
16 Correct 4 ms 344 KB Output is correct
17 Correct 3 ms 344 KB Output is correct
18 Correct 5 ms 344 KB Output is correct
19 Correct 3 ms 344 KB Output is correct
20 Correct 3 ms 344 KB Output is correct
21 Correct 3 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 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 1 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 4 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 4 ms 344 KB Output is correct
9 Correct 4 ms 344 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 2 ms 344 KB Output is correct
12 Correct 4 ms 344 KB Output is correct
13 Correct 3 ms 340 KB Output is correct
14 Correct 4 ms 344 KB Output is correct
15 Correct 4 ms 344 KB Output is correct
16 Correct 4 ms 344 KB Output is correct
17 Correct 3 ms 344 KB Output is correct
18 Correct 5 ms 344 KB Output is correct
19 Correct 3 ms 344 KB Output is correct
20 Correct 3 ms 344 KB Output is correct
21 Correct 3 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 23 ms 344 KB Output is correct
24 Correct 5 ms 344 KB Output is correct
25 Correct 21 ms 344 KB Output is correct
26 Correct 28 ms 344 KB Output is correct
27 Correct 27 ms 344 KB Output is correct
28 Correct 5 ms 344 KB Output is correct
29 Correct 18 ms 344 KB Output is correct
30 Correct 18 ms 344 KB Output is correct
31 Correct 16 ms 344 KB Output is correct
32 Correct 23 ms 344 KB Output is correct
33 Correct 24 ms 344 KB Output is correct
34 Correct 12 ms 344 KB Output is correct
35 Correct 12 ms 344 KB Output is correct
36 Correct 20 ms 344 KB Output is correct
37 Correct 21 ms 344 KB Output is correct
38 Correct 15 ms 344 KB Output is correct
39 Correct 12 ms 344 KB Output is correct
40 Correct 11 ms 596 KB Output is correct
41 Correct 5 ms 344 KB Output is correct

Subtask #3
67.73 / 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 1 ms 344 KB Output is correct
6 Partially correct 0 ms 344 KB Output is partially correct
7 Partially correct 42 ms 412 KB Output is partially correct
8 Correct 10 ms 592 KB Output is correct
9 Partially correct 49 ms 344 KB Output is partially correct
10 Partially correct 46 ms 344 KB Output is partially correct
11 Partially correct 48 ms 344 KB Output is partially correct
12 Correct 33 ms 668 KB Output is correct
13 Partially correct 33 ms 344 KB Output is partially correct
14 Partially correct 37 ms 344 KB Output is partially correct
15 Partially correct 48 ms 344 KB Output is partially correct
16 Partially correct 41 ms 420 KB Output is partially correct
17 Partially correct 41 ms 420 KB Output is partially correct
18 Partially correct 50 ms 432 KB Output is partially correct
19 Partially correct 45 ms 412 KB Output is partially correct
20 Partially correct 43 ms 344 KB Output is partially correct
21 Partially correct 42 ms 412 KB Output is partially correct
22 Partially correct 49 ms 344 KB Output is partially correct
23 Partially correct 40 ms 344 KB Output is partially correct
24 Partially correct 50 ms 416 KB Output is partially correct
25 Correct 25 ms 444 KB Output is correct
26 Correct 11 ms 592 KB Output is correct
27 Partially correct 42 ms 420 KB Output is partially correct
28 Partially correct 55 ms 416 KB Output is partially correct
29 Partially correct 53 ms 420 KB Output is partially correct
30 Partially correct 36 ms 416 KB Output is partially correct
31 Partially correct 49 ms 432 KB Output is partially correct
32 Partially correct 30 ms 344 KB Output is partially correct
33 Partially correct 43 ms 340 KB Output is partially correct
34 Partially correct 32 ms 344 KB Output is partially correct
35 Partially correct 60 ms 420 KB Output is partially correct
36 Partially correct 47 ms 412 KB Output is partially correct
37 Partially correct 52 ms 412 KB Output is partially correct
38 Partially correct 39 ms 412 KB Output is partially correct
39 Partially correct 65 ms 420 KB Output is partially correct
40 Partially correct 46 ms 592 KB Output is partially correct
41 Partially correct 44 ms 592 KB Output is partially correct
42 Partially correct 51 ms 420 KB Output is partially correct
43 Partially correct 10 ms 344 KB Output is partially correct
44 Partially correct 33 ms 344 KB Output is partially correct
45 Partially correct 42 ms 344 KB Output is partially correct
46 Correct 23 ms 344 KB Output is correct
47 Correct 23 ms 344 KB Output is correct
48 Correct 20 ms 344 KB Output is correct