oj.uz

Submission #988529

# Submission time Handle Problem Language Result Execution time Memory
988529 2024-05-25T06:03:53 Z cnn008 Rarest Insects (IOI22_insects) C++17
57.25 / 100
 102 ms 1656 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 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++){
			if(s.find(i)!=s.end()) continue;
			add(i);
			if(press_button()>k) del(i);
		}
		bool f=((int)s.size()>=cad*k);
		return f;
	};
	for(int i=0; i<n; i++){
		add(i);
		if(press_button()==1) cad++;
		else del(i);
	}
	clear();
	if(cad<=9){
		vector <int> vis(n,0);
		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;
			clear();
		}
	}
	return ans;
}
/**  /\_/\
*   (= ._.)
*   / >💖 \>💕
**/

Compilation message

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

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory 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 1 ms 344 KB Output is correct
8 Correct 3 ms 600 KB Output is correct
9 Correct 4 ms 344 KB Output is correct
10 Correct 3 ms 344 KB Output is correct
11 Correct 2 ms 344 KB Output is correct
12 Correct 9 ms 344 KB Output is correct
13 Correct 4 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 4 ms 860 KB Output is correct
17 Correct 4 ms 856 KB Output is correct
18 Correct 4 ms 600 KB Output is correct
19 Correct 3 ms 600 KB Output is correct
20 Correct 3 ms 600 KB Output is correct
21 Correct 2 ms 344 KB Output is correct
22 Correct 1 ms 600 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 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 1 ms 344 KB Output is correct
8 Correct 3 ms 600 KB Output is correct
9 Correct 4 ms 344 KB Output is correct
10 Correct 3 ms 344 KB Output is correct
11 Correct 2 ms 344 KB Output is correct
12 Correct 9 ms 344 KB Output is correct
13 Correct 4 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 4 ms 860 KB Output is correct
17 Correct 4 ms 856 KB Output is correct
18 Correct 4 ms 600 KB Output is correct
19 Correct 3 ms 600 KB Output is correct
20 Correct 3 ms 600 KB Output is correct
21 Correct 2 ms 344 KB Output is correct
22 Correct 1 ms 600 KB Output is correct
23 Correct 8 ms 436 KB Output is correct
24 Correct 6 ms 600 KB Output is correct
25 Correct 14 ms 1124 KB Output is correct
26 Correct 24 ms 1368 KB Output is correct
27 Correct 15 ms 600 KB Output is correct
28 Correct 5 ms 948 KB Output is correct
29 Correct 27 ms 436 KB Output is correct
30 Correct 33 ms 856 KB Output is correct
31 Correct 25 ms 600 KB Output is correct
32 Correct 41 ms 600 KB Output is correct
33 Correct 25 ms 1112 KB Output is correct
34 Correct 20 ms 1612 KB Output is correct
35 Correct 22 ms 1360 KB Output is correct
36 Correct 21 ms 932 KB Output is correct
37 Correct 18 ms 944 KB Output is correct
38 Correct 18 ms 688 KB Output is correct
39 Correct 17 ms 612 KB Output is correct
40 Correct 9 ms 856 KB Output is correct
41 Correct 5 ms 860 KB Output is correct

Subtask #3
32.25 / 75.0

# Verdict Execution time Memory 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 596 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 344 KB Output is correct
8 Correct 11 ms 972 KB Output is correct
9 Correct 28 ms 1616 KB Output is correct
10 Partially correct 52 ms 1376 KB Output is partially correct
11 Correct 28 ms 412 KB Output is correct
12 Correct 18 ms 1112 KB Output is correct
13 Partially correct 48 ms 692 KB Output is partially correct
14 Partially correct 59 ms 704 KB Output is partially correct
15 Partially correct 70 ms 416 KB Output is partially correct
16 Partially correct 102 ms 600 KB Output is partially correct
17 Partially correct 44 ms 1656 KB Output is partially correct
18 Partially correct 58 ms 928 KB Output is partially correct
19 Partially correct 45 ms 1388 KB Output is partially correct
20 Partially correct 61 ms 940 KB Output is partially correct
21 Partially correct 49 ms 724 KB Output is partially correct
22 Partially correct 43 ms 1124 KB Output is partially correct
23 Partially correct 43 ms 1200 KB Output is partially correct
24 Correct 28 ms 1148 KB Output is correct
25 Correct 17 ms 972 KB Output is correct
26 Correct 11 ms 600 KB Output is correct
27 Correct 28 ms 1156 KB Output is correct
28 Correct 25 ms 1208 KB Output is correct
29 Partially correct 28 ms 1156 KB Output is partially correct
30 Partially correct 27 ms 1192 KB Output is partially correct
31 Partially correct 54 ms 956 KB Output is partially correct
32 Partially correct 55 ms 848 KB Output is partially correct
33 Partially correct 47 ms 1100 KB Output is partially correct
34 Partially correct 45 ms 1112 KB Output is partially correct
35 Partially correct 30 ms 944 KB Output is partially correct
36 Partially correct 30 ms 1228 KB Output is partially correct
37 Partially correct 49 ms 1216 KB Output is partially correct
38 Partially correct 51 ms 1236 KB Output is partially correct
39 Correct 23 ms 1628 KB Output is correct
40 Correct 23 ms 1456 KB Output is correct
41 Partially correct 29 ms 1164 KB Output is partially correct
42 Partially correct 32 ms 724 KB Output is partially correct
43 Partially correct 13 ms 344 KB Output is partially correct
44 Partially correct 56 ms 600 KB Output is partially correct
45 Correct 37 ms 592 KB Output is correct
46 Correct 21 ms 692 KB Output is correct
47 Correct 17 ms 1112 KB Output is correct
48 Correct 20 ms 840 KB Output is correct