oj.uz

Submission #1042549

# Submission time Handle Problem Language Result Execution time Memory
1042549 2024-08-03T06:53:21 Z Alihan_8 Rarest Insects (IOI22_insects) C++17
56.54 / 100
 87 ms 688 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;
}

const int C = 100;

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);
		}
	}
	
	if ( (int)p.size() > 100 ){
		int cnt = 0;
		
		vector <int> us(n);
		
		while ( !*min_element(all(us)) ){
			cnt += 1;
			
			int lst = (int)p.size();
			
			for ( auto &j: p ){
				us[j] = 1;
				
				move_outside(j);
			} p.clear();
			
			for ( int i = 0; i < n; i++ ){
				if ( us[i] ) continue;
				
				move_inside(i);
				
				if ( press_button() == 1 ){
					p.pb(i);
				} else{
					move_outside(i);
				}
			}
			
			if ( (int)p.size() != lst ){
				break;
			}
		}
		
		return cnt;
	} else if ( (int)p.size() < 20 ){
		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));
	}
	
	int k = (int)p.size();
	
	for ( auto &x: p ){
		move_outside(x);
	} p.clear();
	
	auto ok = [&](int m){
		int cnt = 0;
		
		for ( int i = 0; i < n; i++ ){
			move_inside(i);
			
			if ( press_button() > m ){
				move_outside(i);
			} else{
				p.pb(i);
				cnt += 1;
			}
		}
		
		for ( auto &x: p ){
			move_outside(x);
		} p.clear();
		
		return cnt == k * m;
	};
	
	int l = 1, r = n / k + 1;
	
	while ( l + 1 < r ){
		int m = (l + r) / 2;
		
		if ( ok(m) ) l = m;
		else r = m;
	}
	
	return l;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory 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 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 1 ms 344 KB Output is correct
8 Correct 7 ms 344 KB Output is correct
9 Correct 8 ms 344 KB Output is correct
10 Correct 3 ms 436 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 4 ms 344 KB Output is correct
13 Correct 8 ms 344 KB Output is correct
14 Correct 2 ms 344 KB Output is correct
15 Correct 6 ms 344 KB Output is correct
16 Correct 4 ms 344 KB Output is correct
17 Correct 6 ms 344 KB Output is correct
18 Correct 9 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 2 ms 432 KB Output is correct
22 Correct 1 ms 440 KB Output is correct

Subtask #2
15.0 / 15.0

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

Subtask #3
31.54 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 408 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 0 ms 344 KB Output is correct
7 Correct 16 ms 436 KB Output is correct
8 Correct 9 ms 344 KB Output is correct
9 Partially correct 76 ms 668 KB Output is partially correct
10 Partially correct 71 ms 676 KB Output is partially correct
11 Correct 15 ms 344 KB Output is correct
12 Correct 11 ms 344 KB Output is correct
13 Partially correct 36 ms 436 KB Output is partially correct
14 Partially correct 55 ms 412 KB Output is partially correct
15 Partially correct 30 ms 344 KB Output is partially correct
16 Partially correct 48 ms 600 KB Output is partially correct
17 Partially correct 69 ms 344 KB Output is partially correct
18 Partially correct 78 ms 408 KB Output is partially correct
19 Partially correct 81 ms 344 KB Output is partially correct
20 Partially correct 77 ms 592 KB Output is partially correct
21 Partially correct 64 ms 436 KB Output is partially correct
22 Partially correct 58 ms 344 KB Output is partially correct
23 Correct 15 ms 600 KB Output is correct
24 Correct 13 ms 344 KB Output is correct
25 Correct 12 ms 600 KB Output is correct
26 Correct 11 ms 344 KB Output is correct
27 Partially correct 48 ms 340 KB Output is partially correct
28 Partially correct 42 ms 672 KB Output is partially correct
29 Partially correct 74 ms 664 KB Output is partially correct
30 Partially correct 84 ms 592 KB Output is partially correct
31 Partially correct 55 ms 580 KB Output is partially correct
32 Partially correct 50 ms 676 KB Output is partially correct
33 Correct 23 ms 428 KB Output is correct
34 Correct 33 ms 412 KB Output is correct
35 Partially correct 60 ms 600 KB Output is partially correct
36 Partially correct 87 ms 672 KB Output is partially correct
37 Partially correct 54 ms 344 KB Output is partially correct
38 Partially correct 60 ms 344 KB Output is partially correct
39 Partially correct 83 ms 344 KB Output is partially correct
40 Partially correct 82 ms 600 KB Output is partially correct
41 Partially correct 67 ms 344 KB Output is partially correct
42 Partially correct 71 ms 672 KB Output is partially correct
43 Correct 6 ms 436 KB Output is correct
44 Correct 17 ms 344 KB Output is correct
45 Correct 18 ms 600 KB Output is correct
46 Correct 14 ms 688 KB Output is correct
47 Correct 11 ms 344 KB Output is correct
48 Correct 11 ms 436 KB Output is correct