oj.uz

Submission #988546

# Submission time Handle Problem Language Result Execution time Memory
988546 2024-05-25T06:44:48 Z cnn008 Rarest Insects (IOI22_insects) C++17
57.25 / 100
 115 ms 1752 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

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int rand(int l, int r){
    assert(l<=r);
    return uniform_int_distribution<int> (l,r)(rng);
}

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

int min_cardinality(int n){
	set <int> s;
	vector <int> nw,p(n);
	iota(p.begin(),p.end(),0);
	shuffle(p.begin(),p.end(),rng);
	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{
		nw.clear();
		for(int i=0; i<n; i++){
			if(s.find(p[i])!=s.end()) continue;
			add(p[i]);
			if(press_button()>k) del(p[i]);
			else nw.push_back(p[i]);
		}
		return (int)s.size()>=cad*k;
	};
	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;
			for(auto i:nw) del(i);
		}
	}
	return ans;
}
/**  /\_/\
*   (= ._.)
*   / >💖 \>💕
**/

Compilation message

insects.cpp:92:9: warning: "/*" within comment [-Wcomment]
   92 | /**  /\_/\
      |          
insects.cpp: In function 'int min_cardinality(int)':
insects.cpp:37:7: warning: variable 'clear' set but not used [-Wunused-but-set-variable]
   37 |  auto clear = [&]() -> void{
      |       ^~~~~

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 340 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 856 KB Output is correct
8 Correct 3 ms 856 KB Output is correct
9 Correct 5 ms 344 KB Output is correct
10 Correct 3 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 5 ms 600 KB Output is correct
13 Correct 6 ms 600 KB Output is correct
14 Correct 5 ms 440 KB Output is correct
15 Correct 7 ms 600 KB Output is correct
16 Correct 4 ms 600 KB Output is correct
17 Correct 3 ms 856 KB Output is correct
18 Correct 5 ms 856 KB Output is correct
19 Correct 4 ms 600 KB Output is correct
20 Correct 3 ms 440 KB Output is correct
21 Correct 2 ms 600 KB Output is correct
22 Correct 2 ms 340 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 340 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 856 KB Output is correct
8 Correct 3 ms 856 KB Output is correct
9 Correct 5 ms 344 KB Output is correct
10 Correct 3 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 5 ms 600 KB Output is correct
13 Correct 6 ms 600 KB Output is correct
14 Correct 5 ms 440 KB Output is correct
15 Correct 7 ms 600 KB Output is correct
16 Correct 4 ms 600 KB Output is correct
17 Correct 3 ms 856 KB Output is correct
18 Correct 5 ms 856 KB Output is correct
19 Correct 4 ms 600 KB Output is correct
20 Correct 3 ms 440 KB Output is correct
21 Correct 2 ms 600 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 8 ms 344 KB Output is correct
24 Correct 5 ms 1112 KB Output is correct
25 Correct 15 ms 1384 KB Output is correct
26 Correct 19 ms 1120 KB Output is correct
27 Correct 15 ms 600 KB Output is correct
28 Correct 5 ms 1112 KB Output is correct
29 Correct 27 ms 600 KB Output is correct
30 Correct 26 ms 1208 KB Output is correct
31 Correct 23 ms 600 KB Output is correct
32 Correct 39 ms 600 KB Output is correct
33 Correct 22 ms 696 KB Output is correct
34 Correct 21 ms 704 KB Output is correct
35 Correct 15 ms 856 KB Output is correct
36 Correct 23 ms 1216 KB Output is correct
37 Correct 15 ms 968 KB Output is correct
38 Correct 17 ms 856 KB Output is correct
39 Correct 11 ms 696 KB Output is correct
40 Correct 8 ms 864 KB Output is correct
41 Correct 4 ms 344 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 340 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 17 ms 600 KB Output is correct
8 Correct 10 ms 1236 KB Output is correct
9 Correct 28 ms 1248 KB Output is correct
10 Partially correct 44 ms 452 KB Output is partially correct
11 Correct 25 ms 600 KB Output is correct
12 Correct 14 ms 972 KB Output is correct
13 Partially correct 48 ms 592 KB Output is partially correct
14 Partially correct 64 ms 952 KB Output is partially correct
15 Partially correct 66 ms 592 KB Output is partially correct
16 Partially correct 115 ms 600 KB Output is partially correct
17 Partially correct 38 ms 1264 KB Output is partially correct
18 Partially correct 39 ms 696 KB Output is partially correct
19 Partially correct 40 ms 988 KB Output is partially correct
20 Partially correct 32 ms 1260 KB Output is partially correct
21 Partially correct 36 ms 1472 KB Output is partially correct
22 Partially correct 51 ms 856 KB Output is partially correct
23 Partially correct 50 ms 984 KB Output is partially correct
24 Correct 24 ms 1148 KB Output is correct
25 Correct 19 ms 872 KB Output is correct
26 Correct 9 ms 1116 KB Output is correct
27 Correct 29 ms 1516 KB Output is correct
28 Correct 29 ms 1128 KB Output is correct
29 Partially correct 28 ms 1136 KB Output is partially correct
30 Partially correct 30 ms 1240 KB Output is partially correct
31 Partially correct 35 ms 976 KB Output is partially correct
32 Partially correct 35 ms 1124 KB Output is partially correct
33 Partially correct 46 ms 1104 KB Output is partially correct
34 Partially correct 58 ms 708 KB Output is partially correct
35 Partially correct 32 ms 1752 KB Output is partially correct
36 Partially correct 38 ms 964 KB Output is partially correct
37 Partially correct 39 ms 1204 KB Output is partially correct
38 Partially correct 41 ms 872 KB Output is partially correct
39 Correct 26 ms 992 KB Output is correct
40 Correct 33 ms 736 KB Output is correct
41 Partially correct 26 ms 1668 KB Output is partially correct
42 Partially correct 30 ms 992 KB Output is partially correct
43 Partially correct 11 ms 344 KB Output is partially correct
44 Partially correct 59 ms 600 KB Output is partially correct
45 Correct 30 ms 592 KB Output is correct
46 Correct 14 ms 600 KB Output is correct
47 Correct 19 ms 1112 KB Output is correct
48 Correct 13 ms 984 KB Output is correct