oj.uz

Submission #893157

# Submission time Handle Problem Language Result Execution time Memory
893157 2023-12-26T15:12:03 Z Trisanu_Das Rarest Insects (IOI22_insects) C++17
100 / 100
 34 ms 960 KB 
#pragma GCC optimize("O3")
#include "insects.h"
#include <bits/stdc++.h>
using namespace std;

int D, N;
const int MAX = 3000;
int mark[MAX], inside[MAX];
vector<int> p;
int cnt = 0;
bool check(int m){
	for(auto i : p){
		if(cnt == m * D) break;
		if(mark[i]) continue;
		move_inside(i);
		if(press_button() > m){
			move_outside(i);
		}else{
			cnt++;
			inside[i] = 1;
		}
	}
	if(cnt == m * D){
		for(int i = 0; i < N; i++) if(inside[i]) mark[i] = 1;
		return false;
	}
	for(int i = 0; i < N; i++){
		if(!inside[i]) mark[i] = 1;
		else if(!mark[i]){
			move_outside(i);
			inside[i] = 0;
			cnt--;
		}
	}
	return true;
}
int min_cardinality(int n) {
	N = n;
	p.resize(N);
	for(int i = 0; i < N; i++) p[i] = i;
	random_shuffle(p.begin(), p.end());
	for(int i = 0; i < N; i++){
		move_inside(i);
		if(press_button() > 1){
			move_outside(i);
		}else{
			cnt++;
			inside[i] = 1;
			mark[i] = 1;
		}
	}
	D = cnt;
 
	int l = 1, r = N / D;
	while(l <= r){
		int m = (l + r) / 2;
		if(check(m)) r = m - 1;
		else l = m + 1;
	}
	return r;
}

Subtask #1
10.0 / 10.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 2 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 3 ms 344 KB Output is correct
9 Correct 3 ms 344 KB Output is correct
10 Correct 2 ms 496 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 344 KB Output is correct
14 Correct 2 ms 344 KB Output is correct
15 Correct 3 ms 344 KB Output is correct
16 Correct 3 ms 344 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 2 ms 344 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 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 2 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 3 ms 344 KB Output is correct
9 Correct 3 ms 344 KB Output is correct
10 Correct 2 ms 496 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 344 KB Output is correct
14 Correct 2 ms 344 KB Output is correct
15 Correct 3 ms 344 KB Output is correct
16 Correct 3 ms 344 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 2 ms 344 KB Output is correct
21 Correct 2 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 9 ms 600 KB Output is correct
24 Correct 4 ms 600 KB Output is correct
25 Correct 15 ms 600 KB Output is correct
26 Correct 22 ms 600 KB Output is correct
27 Correct 11 ms 600 KB Output is correct
28 Correct 4 ms 856 KB Output is correct
29 Correct 14 ms 424 KB Output is correct
30 Correct 12 ms 600 KB Output is correct
31 Correct 9 ms 600 KB Output is correct
32 Correct 11 ms 856 KB Output is correct
33 Correct 11 ms 604 KB Output is correct
34 Correct 14 ms 448 KB Output is correct
35 Correct 13 ms 448 KB Output is correct
36 Correct 11 ms 600 KB Output is correct
37 Correct 16 ms 700 KB Output is correct
38 Correct 17 ms 680 KB Output is correct
39 Correct 10 ms 856 KB Output is correct
40 Correct 8 ms 600 KB Output is correct
41 Correct 5 ms 600 KB Output is correct

Subtask #3
75.0 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 596 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 0 ms 344 KB Output is correct
7 Correct 16 ms 680 KB Output is correct
8 Correct 10 ms 960 KB Output is correct
9 Correct 18 ms 848 KB Output is correct
10 Correct 26 ms 600 KB Output is correct
11 Correct 25 ms 440 KB Output is correct
12 Correct 14 ms 704 KB Output is correct
13 Correct 26 ms 692 KB Output is correct
14 Correct 34 ms 436 KB Output is correct
15 Correct 22 ms 344 KB Output is correct
16 Correct 25 ms 344 KB Output is correct
17 Correct 21 ms 684 KB Output is correct
18 Correct 22 ms 600 KB Output is correct
19 Correct 24 ms 588 KB Output is correct
20 Correct 23 ms 608 KB Output is correct
21 Correct 28 ms 456 KB Output is correct
22 Correct 26 ms 940 KB Output is correct
23 Correct 26 ms 856 KB Output is correct
24 Correct 17 ms 600 KB Output is correct
25 Correct 16 ms 856 KB Output is correct
26 Correct 9 ms 856 KB Output is correct
27 Correct 24 ms 432 KB Output is correct
28 Correct 24 ms 444 KB Output is correct
29 Correct 28 ms 848 KB Output is correct
30 Correct 27 ms 592 KB Output is correct
31 Correct 23 ms 848 KB Output is correct
32 Correct 27 ms 432 KB Output is correct
33 Correct 27 ms 596 KB Output is correct
34 Correct 28 ms 600 KB Output is correct
35 Correct 23 ms 436 KB Output is correct
36 Correct 26 ms 600 KB Output is correct
37 Correct 30 ms 596 KB Output is correct
38 Correct 26 ms 592 KB Output is correct
39 Correct 22 ms 688 KB Output is correct
40 Correct 26 ms 684 KB Output is correct
41 Correct 30 ms 848 KB Output is correct
42 Correct 21 ms 604 KB Output is correct
43 Correct 6 ms 344 KB Output is correct
44 Correct 21 ms 448 KB Output is correct
45 Correct 18 ms 848 KB Output is correct
46 Correct 22 ms 452 KB Output is correct
47 Correct 17 ms 600 KB Output is correct
48 Correct 13 ms 460 KB Output is correct