oj.uz

답안 #988521

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
988521 2024-05-25T05:48:53 Z cnn008 드문 곤충 (IOI22_insects) C++17
25 / 100
 201 ms 1428 KB 
#include "bits/stdc++.h"
using namespace std;

#include "insects.h"

#ifdef N_N_C
#include "debug.h"
#else
#define cebug(...) "Arya"
#endif

#define ll long long

const int N=1e5+5;
const int mod=1e9+7;

int vis[2005];
int min_cardinality(int n){
	set <int> s;
	int cad=0;
	auto add = [&](int i) -> void{
		s.insert(i);
		move_inside(i);
	};
	auto del = [&](int i) -> void{
		s.erase(i);
		move_outside(i);
	};
	auto clear = [&]() -> void{
		auto _s=s;
		for(auto i:_s) del(i);
	};
	auto check = [&](int k) -> bool{
		for(int i=0; i<n; i++){
			add(i);
			if(press_button()>k) del(i);
		}
		bool f=((int)s.size()>=cad*k);
		clear();
		return f;
	};
	for(int i=0; i<n; i++){
		add(i);
		if(press_button()==1) cad++;
		else del(i);
	}
	clear();
	if(cad<=20){
		int type=0;
		for(int i=0; i<n; i++){
			if(!vis[i]){
				vis[i]=++type;
				move_inside(i);
				for(int j=i+1; j<n; j++){
					move_inside(j);
					int val=press_button();
					if(val==2) vis[j]=type;
					move_outside(j);
				}
				move_outside(i);
			}
		}
		map <int,int> mp;
		for(int i=0; i<n; i++) mp[vis[i]]++;
		int ans=INT_MAX;
		for(auto [x,y]:mp) ans=min(ans,y);
		return ans;
	}
	int l=2,r=n/cad,ans=1;
	while(l<=r){
		int mid=(l+r)/2;
		if(check(mid)){
			ans=mid;
			l=mid+1;
		}else r=mid-1;
	}
	return ans;
}
/**  /\_/\
*   (= ._.)
*   / >💖 \>💕
**/

Compilation message

insects.cpp:79:9: warning: "/*" within comment [-Wcomment]
   79 | /**  /\_/\
      |

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 2 ms 380 KB Output is correct
7 Correct 1 ms 600 KB Output is correct
8 Correct 13 ms 344 KB Output is correct
9 Correct 13 ms 340 KB Output is correct
10 Correct 3 ms 344 KB Output is correct
11 Correct 2 ms 600 KB Output is correct
12 Correct 6 ms 344 KB Output is correct
13 Correct 10 ms 344 KB Output is correct
14 Correct 6 ms 344 KB Output is correct
15 Correct 8 ms 344 KB Output is correct
16 Correct 10 ms 352 KB Output is correct
17 Correct 10 ms 344 KB Output is correct
18 Correct 15 ms 344 KB Output is correct
19 Correct 19 ms 344 KB Output is correct
20 Correct 3 ms 600 KB Output is correct
21 Correct 2 ms 600 KB Output is correct
22 Correct 2 ms 600 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 2 ms 380 KB Output is correct
7 Correct 1 ms 600 KB Output is correct
8 Correct 13 ms 344 KB Output is correct
9 Correct 13 ms 340 KB Output is correct
10 Correct 3 ms 344 KB Output is correct
11 Correct 2 ms 600 KB Output is correct
12 Correct 6 ms 344 KB Output is correct
13 Correct 10 ms 344 KB Output is correct
14 Correct 6 ms 344 KB Output is correct
15 Correct 8 ms 344 KB Output is correct
16 Correct 10 ms 352 KB Output is correct
17 Correct 10 ms 344 KB Output is correct
18 Correct 15 ms 344 KB Output is correct
19 Correct 19 ms 344 KB Output is correct
20 Correct 3 ms 600 KB Output is correct
21 Correct 2 ms 600 KB Output is correct
22 Correct 2 ms 600 KB Output is correct
23 Correct 8 ms 444 KB Output is correct
24 Correct 5 ms 852 KB Output is correct
25 Correct 29 ms 980 KB Output is correct
26 Correct 29 ms 972 KB Output is correct
27 Correct 13 ms 600 KB Output is correct
28 Correct 5 ms 852 KB Output is correct
29 Correct 29 ms 600 KB Output is correct
30 Correct 27 ms 1104 KB Output is correct
31 Correct 25 ms 600 KB Output is correct
32 Correct 56 ms 600 KB Output is correct
33 Correct 53 ms 344 KB Output is correct
34 Correct 91 ms 440 KB Output is correct
35 Correct 87 ms 592 KB Output is correct
36 Correct 117 ms 600 KB Output is correct
37 Correct 25 ms 1236 KB Output is correct
38 Correct 18 ms 952 KB Output is correct
39 Correct 14 ms 952 KB Output is correct
40 Correct 9 ms 1112 KB Output is correct
41 Correct 5 ms 616 KB Output is correct

Subtask #3
0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 23 ms 592 KB Output is correct
8 Correct 12 ms 1248 KB Output is correct
9 Partially correct 74 ms 1428 KB Output is partially correct
10 Partially correct 59 ms 656 KB Output is partially correct
11 Correct 33 ms 592 KB Output is correct
12 Correct 19 ms 1128 KB Output is correct
13 Partially correct 55 ms 416 KB Output is partially correct
14 Partially correct 58 ms 964 KB Output is partially correct
15 Partially correct 65 ms 344 KB Output is partially correct
16 Partially correct 85 ms 432 KB Output is partially correct
17 Partially correct 124 ms 592 KB Output is partially correct
18 Partially correct 143 ms 588 KB Output is partially correct
19 Partially correct 167 ms 592 KB Output is partially correct
20 Incorrect 201 ms 420 KB Too many queries.
21 Halted 0 ms 0 KB -