Submission #1042596

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1042596	2024-08-03T08:17:09 Z	Alihan_8	Rarest Insects (IOI22_insects)	C++17	95.53 / 100	56 ms	864 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 ){ // 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;
	
	int aux = 0;
	
	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;
			}
		}
		
		return cnt + aux == 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;
			
			aux += (int)tmp.size();
		}
		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

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	340 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	344 KB	Output is correct
7	Correct	2 ms	344 KB	Output is correct
8	Correct	3 ms	344 KB	Output is correct
9	Correct	2 ms	600 KB	Output is correct
10	Correct	3 ms	436 KB	Output is correct
11	Correct	1 ms	344 KB	Output is correct
12	Correct	3 ms	344 KB	Output is correct
13	Correct	3 ms	344 KB	Output is correct
14	Correct	5 ms	344 KB	Output is correct
15	Correct	2 ms	436 KB	Output is correct
16	Correct	2 ms	436 KB	Output is correct
17	Correct	3 ms	344 KB	Output is correct
18	Correct	2 ms	344 KB	Output is correct
19	Correct	2 ms	344 KB	Output is correct
20	Correct	3 ms	436 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

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	340 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	344 KB	Output is correct
7	Correct	2 ms	344 KB	Output is correct
8	Correct	3 ms	344 KB	Output is correct
9	Correct	2 ms	600 KB	Output is correct
10	Correct	3 ms	436 KB	Output is correct
11	Correct	1 ms	344 KB	Output is correct
12	Correct	3 ms	344 KB	Output is correct
13	Correct	3 ms	344 KB	Output is correct
14	Correct	5 ms	344 KB	Output is correct
15	Correct	2 ms	436 KB	Output is correct
16	Correct	2 ms	436 KB	Output is correct
17	Correct	3 ms	344 KB	Output is correct
18	Correct	2 ms	344 KB	Output is correct
19	Correct	2 ms	344 KB	Output is correct
20	Correct	3 ms	436 KB	Output is correct
21	Correct	2 ms	344 KB	Output is correct
22	Correct	1 ms	344 KB	Output is correct
23	Correct	8 ms	344 KB	Output is correct
24	Correct	6 ms	696 KB	Output is correct
25	Correct	14 ms	688 KB	Output is correct
26	Correct	9 ms	344 KB	Output is correct
27	Correct	5 ms	600 KB	Output is correct
28	Correct	5 ms	600 KB	Output is correct
29	Correct	21 ms	600 KB	Output is correct
30	Correct	14 ms	600 KB	Output is correct
31	Correct	22 ms	344 KB	Output is correct
32	Correct	8 ms	344 KB	Output is correct
33	Correct	18 ms	344 KB	Output is correct
34	Correct	14 ms	600 KB	Output is correct
35	Correct	9 ms	344 KB	Output is correct
36	Correct	15 ms	600 KB	Output is correct
37	Correct	11 ms	436 KB	Output is correct
38	Correct	11 ms	436 KB	Output is correct
39	Correct	12 ms	600 KB	Output is correct
40	Correct	9 ms	344 KB	Output is correct
41	Correct	4 ms	344 KB	Output is correct

Subtask #3
70.53 / 75.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	1 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	0 ms	344 KB	Output is correct
7	Correct	16 ms	444 KB	Output is correct
8	Correct	7 ms	444 KB	Output is correct
9	Correct	27 ms	344 KB	Output is correct
10	Correct	26 ms	600 KB	Output is correct
11	Correct	10 ms	344 KB	Output is correct
12	Correct	17 ms	344 KB	Output is correct
13	Partially correct	23 ms	432 KB	Output is partially correct
14	Correct	24 ms	600 KB	Output is correct
15	Partially correct	30 ms	420 KB	Output is partially correct
16	Correct	36 ms	592 KB	Output is correct
17	Correct	29 ms	592 KB	Output is correct
18	Correct	18 ms	344 KB	Output is correct
19	Partially correct	39 ms	344 KB	Output is partially correct
20	Correct	34 ms	680 KB	Output is correct
21	Correct	26 ms	864 KB	Output is correct
22	Partially correct	36 ms	440 KB	Output is partially correct
23	Correct	19 ms	448 KB	Output is correct
24	Correct	27 ms	436 KB	Output is correct
25	Correct	15 ms	604 KB	Output is correct
26	Correct	8 ms	452 KB	Output is correct
27	Correct	32 ms	428 KB	Output is correct
28	Correct	56 ms	428 KB	Output is correct
29	Partially correct	39 ms	592 KB	Output is partially correct
30	Partially correct	30 ms	436 KB	Output is partially correct
31	Correct	21 ms	428 KB	Output is correct
32	Correct	24 ms	432 KB	Output is correct
33	Correct	20 ms	672 KB	Output is correct
34	Correct	20 ms	432 KB	Output is correct
35	Partially correct	26 ms	428 KB	Output is partially correct
36	Partially correct	27 ms	432 KB	Output is partially correct
37	Correct	22 ms	420 KB	Output is correct
38	Correct	29 ms	432 KB	Output is correct
39	Correct	20 ms	436 KB	Output is correct
40	Correct	24 ms	420 KB	Output is correct
41	Partially correct	30 ms	428 KB	Output is partially correct
42	Partially correct	28 ms	444 KB	Output is partially correct
43	Correct	8 ms	344 KB	Output is correct
44	Correct	13 ms	436 KB	Output is correct
45	Correct	26 ms	444 KB	Output is correct
46	Correct	16 ms	440 KB	Output is correct
47	Correct	17 ms	440 KB	Output is correct
48	Correct	18 ms	344 KB	Output is correct

Submission #1042596

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 15.0 / 15.0

Subtask #3 70.53 / 75.0

Subtask #1
10.0 / 10.0

Subtask #2
15.0 / 15.0

Subtask #3
70.53 / 75.0