답안 #988522

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
988522 2024-05-25T05:49:28 Z cnn008 드문 곤충 (IOI22_insects) C++17
41.2 / 100
142 ms 1788 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<=15){
		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 | /**  /\_/\
      |
# 결과 실행 시간 메모리 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 344 KB Output is correct
7 Correct 2 ms 1112 KB Output is correct
8 Correct 14 ms 504 KB Output is correct
9 Correct 12 ms 344 KB Output is correct
10 Correct 3 ms 344 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 5 ms 344 KB Output is correct
13 Correct 21 ms 344 KB Output is correct
14 Correct 5 ms 344 KB Output is correct
15 Correct 8 ms 344 KB Output is correct
16 Correct 9 ms 340 KB Output is correct
17 Correct 15 ms 344 KB Output is correct
18 Correct 16 ms 596 KB Output is correct
19 Correct 5 ms 856 KB Output is correct
20 Correct 3 ms 600 KB Output is correct
21 Correct 2 ms 600 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
# 결과 실행 시간 메모리 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 344 KB Output is correct
7 Correct 2 ms 1112 KB Output is correct
8 Correct 14 ms 504 KB Output is correct
9 Correct 12 ms 344 KB Output is correct
10 Correct 3 ms 344 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 5 ms 344 KB Output is correct
13 Correct 21 ms 344 KB Output is correct
14 Correct 5 ms 344 KB Output is correct
15 Correct 8 ms 344 KB Output is correct
16 Correct 9 ms 340 KB Output is correct
17 Correct 15 ms 344 KB Output is correct
18 Correct 16 ms 596 KB Output is correct
19 Correct 5 ms 856 KB Output is correct
20 Correct 3 ms 600 KB Output is correct
21 Correct 2 ms 600 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 8 ms 592 KB Output is correct
24 Correct 5 ms 1128 KB Output is correct
25 Correct 28 ms 1244 KB Output is correct
26 Correct 32 ms 972 KB Output is correct
27 Correct 11 ms 344 KB Output is correct
28 Correct 5 ms 860 KB Output is correct
29 Correct 30 ms 444 KB Output is correct
30 Correct 32 ms 1108 KB Output is correct
31 Correct 28 ms 592 KB Output is correct
32 Correct 40 ms 600 KB Output is correct
33 Correct 58 ms 600 KB Output is correct
34 Correct 70 ms 344 KB Output is correct
35 Correct 100 ms 432 KB Output is correct
36 Correct 30 ms 1144 KB Output is correct
37 Correct 26 ms 1364 KB Output is correct
38 Correct 19 ms 856 KB Output is correct
39 Correct 13 ms 1116 KB Output is correct
40 Correct 10 ms 964 KB Output is correct
41 Correct 5 ms 1112 KB Output is correct
# 결과 실행 시간 메모리 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 18 ms 592 KB Output is correct
8 Correct 10 ms 600 KB Output is correct
9 Partially correct 64 ms 1380 KB Output is partially correct
10 Partially correct 59 ms 760 KB Output is partially correct
11 Correct 28 ms 600 KB Output is correct
12 Correct 25 ms 856 KB Output is correct
13 Partially correct 56 ms 596 KB Output is partially correct
14 Partially correct 54 ms 1104 KB Output is partially correct
15 Partially correct 68 ms 440 KB Output is partially correct
16 Partially correct 86 ms 436 KB Output is partially correct
17 Partially correct 124 ms 420 KB Output is partially correct
18 Partially correct 131 ms 420 KB Output is partially correct
19 Partially correct 142 ms 592 KB Output is partially correct
20 Partially correct 76 ms 1280 KB Output is partially correct
21 Partially correct 73 ms 1036 KB Output is partially correct
22 Partially correct 70 ms 936 KB Output is partially correct
23 Partially correct 55 ms 952 KB Output is partially correct
24 Correct 33 ms 956 KB Output is correct
25 Correct 23 ms 668 KB Output is correct
26 Correct 9 ms 856 KB Output is correct
27 Partially correct 62 ms 1216 KB Output is partially correct
28 Partially correct 56 ms 1248 KB Output is partially correct
29 Partially correct 91 ms 832 KB Output is partially correct
30 Partially correct 80 ms 1788 KB Output is partially correct
31 Partially correct 64 ms 1052 KB Output is partially correct
32 Partially correct 71 ms 1056 KB Output is partially correct
33 Partially correct 47 ms 744 KB Output is partially correct
34 Partially correct 41 ms 848 KB Output is partially correct
35 Partially correct 66 ms 568 KB Output is partially correct
36 Partially correct 67 ms 1184 KB Output is partially correct
37 Partially correct 60 ms 1108 KB Output is partially correct
38 Partially correct 52 ms 1220 KB Output is partially correct
39 Partially correct 44 ms 984 KB Output is partially correct
40 Partially correct 55 ms 848 KB Output is partially correct
41 Partially correct 72 ms 1448 KB Output is partially correct
42 Partially correct 65 ms 1044 KB Output is partially correct
43 Partially correct 16 ms 344 KB Output is partially correct
44 Partially correct 58 ms 416 KB Output is partially correct
45 Correct 29 ms 412 KB Output is correct
46 Correct 22 ms 856 KB Output is correct
47 Correct 20 ms 1104 KB Output is correct
48 Correct 17 ms 1132 KB Output is correct