답안 #1042594

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1042594	2024-08-03T08:15:09 Z	Alihan_8	드문 곤충 (IOI22_insects)	C++17	47.5 / 100	115 ms	1128 KB

insects

#include "insects.h"

#include <bits/stdc++.h>

using namespace std;

#define pb push_back
#define ar array
#define all(x) x.begin(), x.end()

template <class F, class S>
bool chmin(F &u, const S &v){
	bool flag = false;
	
	if ( u > v ){
		u = v; flag |= true;
	}
	
	return flag;
}

int min_cardinality(int n) {
	vector <int> p;
	
	for ( int i = 0; i < n; i++ ){
		move_inside(i);
		
		if ( press_button() == 1 ){
			p.pb(i);
		} else{
			move_outside(i);
		}
	}
	
	int k = (int)p.size();
	
	if ( __lg(n / k + 1) >= k && false ){ // random stuff
		vector <int> us(n);
		
		for ( auto &j: p ){
			move_outside(j);
		} p.clear();
		
		vector <int> f;
		
		while ( !*min_element(all(us)) ){
			int cnt = 0;
			
			for ( int i = 0; i < n; i++ ){
				if ( us[i] ) continue;
				
				move_inside(i);
				
				if ( press_button() == cnt + 1 ){
					cnt += 1; p.pb(i);
				} else{
					move_outside(i);
				}
			}
			
			f.pb(cnt);
			
			for ( auto &x: p ){
				us[x] = 1;
				
				move_outside(x);
			} p.clear();
		}
		
		return *min_element(all(f));
	}
	
	for ( auto &x: p ){
		move_outside(x);
	} p.clear();
	
	vector <int> us(n), tmp, rem;
	
	auto ok = [&](int m){
		int cnt = 0;
		
		tmp.clear();
		rem.clear();
		
		for ( int i = 0; i < n; i++ ){
			if ( us[i] ) continue;
			
			move_inside(i);
			
			if ( press_button() > m ){
				move_outside(i);
				
				rem.pb(i);
			} else{
				tmp.pb(i);
				cnt += 1;
			}
		} 
		
		for ( auto &x: tmp ) move_outside(x);
		
		tmp.clear();
		
		return cnt == k * m;
	};
	
	int l = 1, r = n / k + 1;
	
	while ( l + 1 < r ){
		int m = (l + r) / 2;
		
		if ( ok(m) ){
			for ( auto &x: tmp ){
				us[x] = 1;
			} l = m;
		}
		else{
			for ( auto &x: rem ){
				us[x] = 1;
			} 
			
			for ( auto &x: tmp ){
				move_outside(x);
			} 
			
			r = m;
		}
	}
	
	return l;
}

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

Subtask #3
22.5 / 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	0 ms	344 KB	Output is correct
6	Partially correct	0 ms	344 KB	Output is partially correct
7	Partially correct	115 ms	652 KB	Output is partially correct
8	Correct	6 ms	444 KB	Output is correct
9	Partially correct	61 ms	664 KB	Output is partially correct
10	Partially correct	41 ms	440 KB	Output is partially correct
11	Correct	16 ms	600 KB	Output is correct
12	Correct	19 ms	612 KB	Output is correct
13	Correct	21 ms	344 KB	Output is correct
14	Correct	21 ms	444 KB	Output is correct
15	Partially correct	99 ms	688 KB	Output is partially correct
16	Partially correct	111 ms	592 KB	Output is partially correct
17	Partially correct	82 ms	612 KB	Output is partially correct
18	Partially correct	83 ms	688 KB	Output is partially correct
19	Partially correct	95 ms	632 KB	Output is partially correct
20	Partially correct	83 ms	600 KB	Output is partially correct
21	Partially correct	66 ms	668 KB	Output is partially correct
22	Partially correct	38 ms	344 KB	Output is partially correct
23	Correct	23 ms	344 KB	Output is correct
24	Correct	21 ms	344 KB	Output is correct
25	Correct	24 ms	428 KB	Output is correct
26	Correct	7 ms	456 KB	Output is correct
27	Partially correct	61 ms	592 KB	Output is partially correct
28	Partially correct	53 ms	444 KB	Output is partially correct
29	Partially correct	86 ms	676 KB	Output is partially correct
30	Partially correct	82 ms	428 KB	Output is partially correct
31	Partially correct	43 ms	436 KB	Output is partially correct
32	Partially correct	46 ms	600 KB	Output is partially correct
33	Correct	24 ms	444 KB	Output is correct
34	Correct	22 ms	432 KB	Output is correct
35	Partially correct	71 ms	428 KB	Output is partially correct
36	Partially correct	72 ms	676 KB	Output is partially correct
37	Partially correct	47 ms	920 KB	Output is partially correct
38	Partially correct	42 ms	680 KB	Output is partially correct
39	Partially correct	40 ms	592 KB	Output is partially correct
40	Partially correct	47 ms	676 KB	Output is partially correct
41	Partially correct	59 ms	696 KB	Output is partially correct
42	Partially correct	62 ms	904 KB	Output is partially correct
43	Correct	6 ms	440 KB	Output is correct
44	Correct	16 ms	456 KB	Output is correct
45	Partially correct	93 ms	1128 KB	Output is partially correct
46	Correct	17 ms	344 KB	Output is correct
47	Correct	12 ms	448 KB	Output is correct
48	Correct	18 ms	444 KB	Output is correct

답안 #1042594

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 15.0 / 15.0

Subtask #3 22.5 / 75.0

Subtask #1
10.0 / 10.0

Subtask #2
15.0 / 15.0

Subtask #3
22.5 / 75.0