oj.uz

답안 #832989

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
832989 2023-08-21T18:30:27 Z MeGustaElArroz23 드문 곤충 (IOI22_insects) C++17
10 / 100
 276 ms 304 KB 
#include "insects.h"

using namespace std;

#include<bits/stdc++.h>

#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int,int>
#define vii vector<pii>
#define fi first
#define se second
#define pb push_back
#define vb vector<bool>

int n;
vb box;
vb basic_box;
int basic_box_size;

void create_basic_box(){
	basic_box=vb(n,0);
	for (int i=0;i<n;i++){
		move_inside(i);
		box[i]=1;
		if (press_button()>1){
			move_outside(i);
			box[i]=0;
		}
	}
	basic_box=box;
	basic_box_size=0;
	for (int x:basic_box) basic_box_size+=x;
}

void clear_box(){
	for (int i=0;i<n;i++){
		if (box[i] && (! basic_box[i])){
			box[i]=0;
			move_outside(i);
		}
	}
}

int check_ans(int m){
	for (int i=0;i<n;i++){
		move_inside(i);
		box[i]=1;
		if (press_button()>m){
			move_outside(i);
			box[i]=0;
		}
	}
	int count=0;
	for (int x:box) count+=x;
	if (count==m*basic_box_size){
		basic_box=box;
		return 1;
	}
	else return 0;
}

int min_cardinality(int N) {
	n=N;
	box=vb(n,0);
    create_basic_box();
	clear_box();

	if (basic_box_size==1) return N;

	int l=1;
	int r=n/basic_box_size+1;

	while (l!=r-1){
		cerr << l << ' ' << r << '\n';
		int m=max((int) (0.38*l+0.62*r)/8,l+1);
		if (check_ans(m)) l=m;
		else r=m;
		clear_box();
	}

	return l;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 20 ms 208 KB Output is correct
9 Correct 13 ms 208 KB Output is correct
10 Correct 6 ms 208 KB Output is correct
11 Correct 3 ms 208 KB Output is correct
12 Correct 5 ms 208 KB Output is correct
13 Correct 4 ms 208 KB Output is correct
14 Correct 35 ms 208 KB Output is correct
15 Correct 26 ms 208 KB Output is correct
16 Correct 28 ms 208 KB Output is correct
17 Correct 11 ms 208 KB Output is correct
18 Correct 5 ms 208 KB Output is correct
19 Correct 12 ms 252 KB Output is correct
20 Correct 2 ms 304 KB Output is correct
21 Correct 2 ms 296 KB Output is correct
22 Correct 1 ms 208 KB Output is correct

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 20 ms 208 KB Output is correct
9 Correct 13 ms 208 KB Output is correct
10 Correct 6 ms 208 KB Output is correct
11 Correct 3 ms 208 KB Output is correct
12 Correct 5 ms 208 KB Output is correct
13 Correct 4 ms 208 KB Output is correct
14 Correct 35 ms 208 KB Output is correct
15 Correct 26 ms 208 KB Output is correct
16 Correct 28 ms 208 KB Output is correct
17 Correct 11 ms 208 KB Output is correct
18 Correct 5 ms 208 KB Output is correct
19 Correct 12 ms 252 KB Output is correct
20 Correct 2 ms 304 KB Output is correct
21 Correct 2 ms 296 KB Output is correct
22 Correct 1 ms 208 KB Output is correct
23 Correct 4 ms 208 KB Output is correct
24 Correct 9 ms 208 KB Output is correct
25 Correct 187 ms 208 KB Output is correct
26 Correct 147 ms 280 KB Output is correct
27 Correct 21 ms 288 KB Output is correct
28 Correct 7 ms 208 KB Output is correct
29 Correct 26 ms 208 KB Output is correct
30 Correct 17 ms 208 KB Output is correct
31 Incorrect 234 ms 208 KB Too many queries.
32 Halted 0 ms 0 KB -

Subtask #3
0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Partially correct 1 ms 208 KB Output is partially correct
7 Correct 18 ms 208 KB Output is correct
8 Correct 7 ms 208 KB Output is correct
9 Incorrect 276 ms 208 KB Too many queries.
10 Halted 0 ms 0 KB -