Submission #988558

# Submission time Handle Problem Language Result Execution time Memory
988558 2024-05-25T07:12:22 Z cnn008 Rarest Insects (IOI22_insects) C++17
99.89 / 100
39 ms 1912 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;
	// vector <int> p(n);
	// iota(p.begin(),p.end(),0);
	// shuffle(p.begin(),p.end(),rng);
	map <int,set<int>> mp;
	int cad;
	auto add = [&](int i) -> void{
		s.insert(i);
		move_inside(i);
	};
	auto del = [&](int i) -> void{
		s.erase(i);
		move_outside(i);
	};
	// auto check = [&](int k) -> bool{
		// nw.clear();
		// auto op=*mp.lower_bound(k);
		// for(auto i:op.second){
			// if(s.find(i)!=s.end()) continue;
			// add(i);
			// if(press_button()>k) del(i);
			// else nw.push_back(i);
		// }
		// mp[k]=s;
		// return (int)s.size()>=cad*k;
	// };	
	for(int i=0; i<n; i++){
		add(i);
		if(press_button()>1) del(i);
	}
	cad=(int)s.size();
	mp[1]=s;
	for(int i=0; i<n; i++) mp[n].insert(i);
	int l=2,r=n/cad,ans=1;
	while(l<=r){
		int mid=(l+r)/2;
		vector <int> nw;
		auto op=mp.lower_bound(mid);
		for(auto i:(*op).second){
			if(s.find(i)!=s.end()) continue;
			add(i);
			if(press_button()>mid) del(i);
			else nw.push_back(i);
		}
		mp[mid]=s;
		if((int)s.size()>=cad*mid){
			ans=mid;
			l=mid+1;
		}else{
			r=mid-1;
			for(auto i:nw) del(i);
		}
	}
	return ans;
}
/**  /\_/\
*   (= ._.)
*   / >💖 \>💕
**/

Compilation message

insects.cpp:80:9: warning: "/*" within comment [-Wcomment]
   80 | /**  /\_/\
      |
# 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 3 ms 600 KB Output is correct
7 Correct 2 ms 600 KB Output is correct
8 Correct 3 ms 864 KB Output is correct
9 Correct 4 ms 1128 KB Output is correct
10 Correct 3 ms 600 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 3 ms 600 KB Output is correct
13 Correct 3 ms 600 KB Output is correct
14 Correct 3 ms 856 KB Output is correct
15 Correct 3 ms 468 KB Output is correct
16 Correct 3 ms 856 KB Output is correct
17 Correct 3 ms 856 KB Output is correct
18 Correct 3 ms 600 KB Output is correct
19 Correct 3 ms 600 KB Output is correct
20 Correct 2 ms 600 KB Output is correct
21 Correct 2 ms 596 KB Output is correct
22 Correct 1 ms 600 KB Output is correct
# 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 3 ms 600 KB Output is correct
7 Correct 2 ms 600 KB Output is correct
8 Correct 3 ms 864 KB Output is correct
9 Correct 4 ms 1128 KB Output is correct
10 Correct 3 ms 600 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 3 ms 600 KB Output is correct
13 Correct 3 ms 600 KB Output is correct
14 Correct 3 ms 856 KB Output is correct
15 Correct 3 ms 468 KB Output is correct
16 Correct 3 ms 856 KB Output is correct
17 Correct 3 ms 856 KB Output is correct
18 Correct 3 ms 600 KB Output is correct
19 Correct 3 ms 600 KB Output is correct
20 Correct 2 ms 600 KB Output is correct
21 Correct 2 ms 596 KB Output is correct
22 Correct 1 ms 600 KB Output is correct
23 Correct 14 ms 1456 KB Output is correct
24 Correct 5 ms 872 KB Output is correct
25 Correct 15 ms 1276 KB Output is correct
26 Correct 17 ms 756 KB Output is correct
27 Correct 12 ms 672 KB Output is correct
28 Correct 5 ms 1112 KB Output is correct
29 Correct 12 ms 1104 KB Output is correct
30 Correct 14 ms 1104 KB Output is correct
31 Correct 14 ms 1288 KB Output is correct
32 Correct 15 ms 1000 KB Output is correct
33 Correct 15 ms 1008 KB Output is correct
34 Correct 14 ms 1704 KB Output is correct
35 Correct 13 ms 980 KB Output is correct
36 Correct 13 ms 1164 KB Output is correct
37 Correct 14 ms 1432 KB Output is correct
38 Correct 11 ms 1000 KB Output is correct
39 Correct 10 ms 968 KB Output is correct
40 Correct 8 ms 1212 KB Output is correct
41 Correct 6 ms 856 KB Output is correct
# 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 1 ms 344 KB Output is correct
7 Correct 34 ms 1840 KB Output is correct
8 Correct 11 ms 1216 KB Output is correct
9 Correct 27 ms 1716 KB Output is correct
10 Correct 34 ms 1084 KB Output is correct
11 Correct 21 ms 684 KB Output is correct
12 Correct 16 ms 856 KB Output is correct
13 Correct 39 ms 592 KB Output is correct
14 Correct 28 ms 856 KB Output is correct
15 Correct 32 ms 1912 KB Output is correct
16 Correct 30 ms 1556 KB Output is correct
17 Correct 30 ms 1652 KB Output is correct
18 Correct 30 ms 1076 KB Output is correct
19 Partially correct 28 ms 1460 KB Output is partially correct
20 Correct 25 ms 1624 KB Output is correct
21 Correct 27 ms 1236 KB Output is correct
22 Correct 31 ms 1104 KB Output is correct
23 Correct 28 ms 1072 KB Output is correct
24 Correct 27 ms 1368 KB Output is correct
25 Correct 15 ms 1236 KB Output is correct
26 Correct 9 ms 856 KB Output is correct
27 Correct 26 ms 1360 KB Output is correct
28 Correct 28 ms 1140 KB Output is correct
29 Partially correct 27 ms 1456 KB Output is partially correct
30 Partially correct 28 ms 1728 KB Output is partially correct
31 Correct 26 ms 1360 KB Output is correct
32 Correct 27 ms 1408 KB Output is correct
33 Correct 27 ms 1276 KB Output is correct
34 Correct 25 ms 1308 KB Output is correct
35 Partially correct 29 ms 1268 KB Output is partially correct
36 Partially correct 33 ms 1724 KB Output is partially correct
37 Correct 30 ms 984 KB Output is correct
38 Correct 24 ms 1512 KB Output is correct
39 Correct 25 ms 1740 KB Output is correct
40 Correct 26 ms 1720 KB Output is correct
41 Partially correct 34 ms 1228 KB Output is partially correct
42 Partially correct 28 ms 1704 KB Output is partially correct
43 Correct 6 ms 856 KB Output is correct
44 Correct 28 ms 696 KB Output is correct
45 Correct 28 ms 1728 KB Output is correct
46 Correct 19 ms 1208 KB Output is correct
47 Correct 18 ms 1112 KB Output is correct
48 Correct 16 ms 856 KB Output is correct