oj.uz

Submission #988547

# Submission time Handle Problem Language Result Execution time Memory
988547 2024-05-25T06:58:57 Z cnn008 Rarest Insects (IOI22_insects) C++17
57.25 / 100
 93 ms 1536 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 clear = [&]() -> void{
		auto _s=s;
		for(auto i:_s) del(i);
	};
	auto check = [&](int k) -> bool{
		nw.clear();
		auto op=mp.lower_bound(k);
		for(int i=0; i<n; i++){
			if(s.find(i)!=s.end()) continue;
			add(i);
			if(press_button()>k) del(i);
			else nw.push_back(i);
		}
		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();
	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> brute;
		for(int i=0; i<n; i++) brute[vis[i]]++;
		int ans=INT_MAX;
		for(auto [x,y]:brute) ans=min(ans,y);
		return ans;
	}
	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;
		if(check(mid)){
			ans=mid;
			l=mid+1;
		}else{
			r=mid-1;
			for(auto i:nw) del(i);
		}
	}
	return ans;
}
/**  /\_/\
*   (= ._.)
*   / >💖 \>💕
**/

Compilation message

insects.cpp:96:9: warning: "/*" within comment [-Wcomment]
   96 | /**  /\_/\
      |          
insects.cpp: In lambda function:
insects.cpp:45:8: warning: variable 'op' set but not used [-Wunused-but-set-variable]
   45 |   auto op=mp.lower_bound(k);
      |        ^~
insects.cpp: In function 'int min_cardinality(int)':
insects.cpp:39:7: warning: variable 'clear' set but not used [-Wunused-but-set-variable]
   39 |  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 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 3 ms 344 KB Output is correct
7 Correct 2 ms 600 KB Output is correct
8 Correct 3 ms 600 KB Output is correct
9 Correct 4 ms 600 KB Output is correct
10 Correct 3 ms 344 KB Output is correct
11 Correct 2 ms 344 KB Output is correct
12 Correct 5 ms 344 KB Output is correct
13 Correct 4 ms 600 KB Output is correct
14 Correct 7 ms 344 KB Output is correct
15 Correct 8 ms 344 KB Output is correct
16 Correct 3 ms 600 KB Output is correct
17 Correct 4 ms 896 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 600 KB Output is correct
22 Correct 2 ms 344 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 3 ms 344 KB Output is correct
7 Correct 2 ms 600 KB Output is correct
8 Correct 3 ms 600 KB Output is correct
9 Correct 4 ms 600 KB Output is correct
10 Correct 3 ms 344 KB Output is correct
11 Correct 2 ms 344 KB Output is correct
12 Correct 5 ms 344 KB Output is correct
13 Correct 4 ms 600 KB Output is correct
14 Correct 7 ms 344 KB Output is correct
15 Correct 8 ms 344 KB Output is correct
16 Correct 3 ms 600 KB Output is correct
17 Correct 4 ms 896 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 600 KB Output is correct
22 Correct 2 ms 344 KB Output is correct
23 Correct 11 ms 600 KB Output is correct
24 Correct 5 ms 1112 KB Output is correct
25 Correct 15 ms 1204 KB Output is correct
26 Correct 16 ms 440 KB Output is correct
27 Correct 11 ms 596 KB Output is correct
28 Correct 6 ms 1116 KB Output is correct
29 Correct 34 ms 600 KB Output is correct
30 Correct 30 ms 1104 KB Output is correct
31 Correct 28 ms 440 KB Output is correct
32 Correct 44 ms 600 KB Output is correct
33 Correct 18 ms 952 KB Output is correct
34 Correct 16 ms 1112 KB Output is correct
35 Correct 19 ms 1368 KB Output is correct
36 Correct 18 ms 1228 KB Output is correct
37 Correct 19 ms 752 KB Output is correct
38 Correct 16 ms 672 KB Output is correct
39 Correct 16 ms 1112 KB Output is correct
40 Correct 9 ms 876 KB Output is correct
41 Correct 5 ms 1120 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 0 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 600 KB Output is correct
8 Correct 8 ms 1128 KB Output is correct
9 Correct 36 ms 1248 KB Output is correct
10 Partially correct 34 ms 1136 KB Output is partially correct
11 Correct 29 ms 592 KB Output is correct
12 Correct 16 ms 1216 KB Output is correct
13 Partially correct 50 ms 436 KB Output is partially correct
14 Partially correct 57 ms 1376 KB Output is partially correct
15 Partially correct 70 ms 444 KB Output is partially correct
16 Partially correct 93 ms 420 KB Output is partially correct
17 Partially correct 33 ms 1224 KB Output is partially correct
18 Partially correct 37 ms 1488 KB Output is partially correct
19 Partially correct 33 ms 1056 KB Output is partially correct
20 Partially correct 42 ms 1460 KB Output is partially correct
21 Partially correct 36 ms 1368 KB Output is partially correct
22 Partially correct 45 ms 1292 KB Output is partially correct
23 Partially correct 45 ms 1300 KB Output is partially correct
24 Correct 26 ms 1208 KB Output is correct
25 Correct 14 ms 1536 KB Output is correct
26 Correct 10 ms 960 KB Output is correct
27 Correct 26 ms 1248 KB Output is correct
28 Correct 25 ms 1444 KB Output is correct
29 Partially correct 28 ms 1184 KB Output is partially correct
30 Partially correct 40 ms 1112 KB Output is partially correct
31 Partially correct 41 ms 1284 KB Output is partially correct
32 Partially correct 39 ms 1112 KB Output is partially correct
33 Partially correct 52 ms 944 KB Output is partially correct
34 Partially correct 44 ms 848 KB Output is partially correct
35 Partially correct 29 ms 956 KB Output is partially correct
36 Partially correct 28 ms 1376 KB Output is partially correct
37 Partially correct 47 ms 856 KB Output is partially correct
38 Partially correct 42 ms 1032 KB Output is partially correct
39 Correct 23 ms 1208 KB Output is correct
40 Correct 24 ms 976 KB Output is correct
41 Partially correct 30 ms 1088 KB Output is partially correct
42 Partially correct 32 ms 860 KB Output is partially correct
43 Partially correct 15 ms 600 KB Output is partially correct
44 Partially correct 44 ms 600 KB Output is partially correct
45 Correct 31 ms 592 KB Output is correct
46 Correct 13 ms 600 KB Output is correct
47 Correct 15 ms 1368 KB Output is correct
48 Correct 15 ms 600 KB Output is correct