Submission #1042556

# Submission time Handle Problem Language Result Execution time Memory
1042556 2024-08-03T07:08:44 Z Alihan_8 Rarest Insects (IOI22_insects) C++17
57.76 / 100
110 ms 700 KB
#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;
	
	auto ok = [&](int m){
		int cnt = 0;
		
		tmp = p;
		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 == k * m;
	};
	
	int l = 1, r = n / k + 1;
	
	while ( l + 1 < r ){
		int m = (l + r) / 2;
		
		if ( ok(m) ){
			for ( auto &x: p ){
				us[x] = 1;
			} l = m;
		}
		else{
			for ( auto &x: rem ){
				us[x] = 1;
			} 
			
			for ( auto &x: tmp ){
				move_outside(x);
			} tmp.clear();
			
			r = m;
		}
	}
	
	return l;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 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 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 5 ms 344 KB Output is correct
9 Correct 4 ms 600 KB Output is correct
10 Correct 4 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 2 ms 344 KB Output is correct
13 Correct 2 ms 436 KB Output is correct
14 Correct 3 ms 344 KB Output is correct
15 Correct 4 ms 344 KB Output is correct
16 Correct 5 ms 600 KB Output is correct
17 Correct 4 ms 344 KB Output is correct
18 Correct 4 ms 432 KB Output is correct
19 Correct 3 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 600 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 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 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 5 ms 344 KB Output is correct
9 Correct 4 ms 600 KB Output is correct
10 Correct 4 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 2 ms 344 KB Output is correct
13 Correct 2 ms 436 KB Output is correct
14 Correct 3 ms 344 KB Output is correct
15 Correct 4 ms 344 KB Output is correct
16 Correct 5 ms 600 KB Output is correct
17 Correct 4 ms 344 KB Output is correct
18 Correct 4 ms 432 KB Output is correct
19 Correct 3 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 600 KB Output is correct
23 Correct 8 ms 600 KB Output is correct
24 Correct 5 ms 444 KB Output is correct
25 Correct 35 ms 344 KB Output is correct
26 Correct 13 ms 344 KB Output is correct
27 Correct 7 ms 344 KB Output is correct
28 Correct 5 ms 344 KB Output is correct
29 Correct 14 ms 440 KB Output is correct
30 Correct 11 ms 344 KB Output is correct
31 Correct 14 ms 344 KB Output is correct
32 Correct 32 ms 344 KB Output is correct
33 Correct 27 ms 600 KB Output is correct
34 Correct 27 ms 344 KB Output is correct
35 Correct 27 ms 344 KB Output is correct
36 Correct 29 ms 600 KB Output is correct
37 Correct 19 ms 448 KB Output is correct
38 Correct 12 ms 440 KB Output is correct
39 Correct 7 ms 600 KB Output is correct
40 Correct 20 ms 596 KB Output is correct
41 Correct 5 ms 344 KB Output is correct
# Verdict Execution time Memory 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 Correct 0 ms 344 KB Output is correct
7 Correct 15 ms 344 KB Output is correct
8 Correct 11 ms 344 KB Output is correct
9 Partially correct 65 ms 448 KB Output is partially correct
10 Partially correct 52 ms 592 KB Output is partially correct
11 Correct 19 ms 616 KB Output is correct
12 Correct 18 ms 344 KB Output is correct
13 Partially correct 34 ms 436 KB Output is partially correct
14 Correct 26 ms 344 KB Output is correct
15 Partially correct 35 ms 600 KB Output is partially correct
16 Partially correct 110 ms 404 KB Output is partially correct
17 Partially correct 75 ms 436 KB Output is partially correct
18 Partially correct 85 ms 344 KB Output is partially correct
19 Partially correct 87 ms 600 KB Output is partially correct
20 Partially correct 87 ms 344 KB Output is partially correct
21 Partially correct 43 ms 596 KB Output is partially correct
22 Partially correct 49 ms 436 KB Output is partially correct
23 Correct 29 ms 600 KB Output is correct
24 Correct 34 ms 592 KB Output is correct
25 Correct 14 ms 344 KB Output is correct
26 Correct 8 ms 344 KB Output is correct
27 Partially correct 75 ms 432 KB Output is partially correct
28 Partially correct 42 ms 600 KB Output is partially correct
29 Partially correct 75 ms 440 KB Output is partially correct
30 Partially correct 56 ms 440 KB Output is partially correct
31 Partially correct 41 ms 684 KB Output is partially correct
32 Partially correct 35 ms 444 KB Output is partially correct
33 Correct 24 ms 440 KB Output is correct
34 Correct 26 ms 428 KB Output is correct
35 Partially correct 58 ms 440 KB Output is partially correct
36 Partially correct 47 ms 440 KB Output is partially correct
37 Partially correct 45 ms 440 KB Output is partially correct
38 Partially correct 41 ms 700 KB Output is partially correct
39 Partially correct 53 ms 344 KB Output is partially correct
40 Partially correct 44 ms 452 KB Output is partially correct
41 Partially correct 63 ms 608 KB Output is partially correct
42 Partially correct 62 ms 424 KB Output is partially correct
43 Correct 10 ms 344 KB Output is correct
44 Correct 17 ms 676 KB Output is correct
45 Correct 20 ms 440 KB Output is correct
46 Correct 15 ms 608 KB Output is correct
47 Correct 15 ms 444 KB Output is correct
48 Correct 25 ms 344 KB Output is correct