oj.uz

Submission #988555

# Submission time Handle Problem Language Result Execution time Memory
988555 2024-05-25T07:10:14 Z cnn008 Rarest Insects (IOI22_insects) C++17
57.25 / 100
 88 ms 1972 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(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();
	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> 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;
		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:107:9: warning: "/*" within comment [-Wcomment]
  107 | /**  /\_/\
      |

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 0 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 600 KB Output is correct
8 Correct 4 ms 948 KB Output is correct
9 Correct 3 ms 864 KB Output is correct
10 Correct 3 ms 344 KB Output is correct
11 Correct 2 ms 600 KB Output is correct
12 Correct 5 ms 344 KB Output is correct
13 Correct 3 ms 856 KB Output is correct
14 Correct 6 ms 344 KB Output is correct
15 Correct 8 ms 344 KB Output is correct
16 Correct 3 ms 856 KB Output is correct
17 Correct 3 ms 1108 KB Output is correct
18 Correct 3 ms 600 KB Output is correct
19 Correct 3 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 700 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 0 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 600 KB Output is correct
8 Correct 4 ms 948 KB Output is correct
9 Correct 3 ms 864 KB Output is correct
10 Correct 3 ms 344 KB Output is correct
11 Correct 2 ms 600 KB Output is correct
12 Correct 5 ms 344 KB Output is correct
13 Correct 3 ms 856 KB Output is correct
14 Correct 6 ms 344 KB Output is correct
15 Correct 8 ms 344 KB Output is correct
16 Correct 3 ms 856 KB Output is correct
17 Correct 3 ms 1108 KB Output is correct
18 Correct 3 ms 600 KB Output is correct
19 Correct 3 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 700 KB Output is correct
23 Correct 11 ms 800 KB Output is correct
24 Correct 5 ms 872 KB Output is correct
25 Correct 20 ms 1180 KB Output is correct
26 Correct 18 ms 1224 KB Output is correct
27 Correct 13 ms 440 KB Output is correct
28 Correct 6 ms 600 KB Output is correct
29 Correct 25 ms 436 KB Output is correct
30 Correct 13 ms 856 KB Output is correct
31 Correct 28 ms 432 KB Output is correct
32 Correct 50 ms 600 KB Output is correct
33 Correct 17 ms 1420 KB Output is correct
34 Correct 17 ms 1252 KB Output is correct
35 Correct 19 ms 928 KB Output is correct
36 Correct 15 ms 936 KB Output is correct
37 Correct 14 ms 1428 KB Output is correct
38 Correct 13 ms 648 KB Output is correct
39 Correct 12 ms 872 KB Output is correct
40 Correct 14 ms 856 KB Output is correct
41 Correct 5 ms 608 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 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 19 ms 344 KB Output is correct
8 Correct 12 ms 1368 KB Output is correct
9 Correct 32 ms 1144 KB Output is correct
10 Correct 25 ms 1712 KB Output is correct
11 Correct 23 ms 432 KB Output is correct
12 Correct 21 ms 1972 KB Output is correct
13 Partially correct 61 ms 668 KB Output is partially correct
14 Correct 37 ms 872 KB Output is correct
15 Partially correct 55 ms 592 KB Output is partially correct
16 Partially correct 88 ms 600 KB Output is partially correct
17 Correct 35 ms 1508 KB Output is correct
18 Correct 29 ms 1456 KB Output is correct
19 Partially correct 32 ms 1708 KB Output is partially correct
20 Correct 30 ms 1564 KB Output is correct
21 Correct 33 ms 1312 KB Output is correct
22 Partially correct 28 ms 1276 KB Output is partially correct
23 Correct 35 ms 680 KB Output is correct
24 Correct 26 ms 1456 KB Output is correct
25 Correct 25 ms 1448 KB Output is correct
26 Correct 9 ms 1112 KB Output is correct
27 Correct 35 ms 1708 KB Output is correct
28 Correct 30 ms 1260 KB Output is correct
29 Partially correct 33 ms 1344 KB Output is partially correct
30 Partially correct 35 ms 1380 KB Output is partially correct
31 Correct 37 ms 1344 KB Output is correct
32 Correct 36 ms 972 KB Output is correct
33 Correct 32 ms 1192 KB Output is correct
34 Correct 28 ms 932 KB Output is correct
35 Partially correct 34 ms 968 KB Output is partially correct
36 Partially correct 29 ms 1320 KB Output is partially correct
37 Correct 29 ms 1024 KB Output is correct
38 Correct 35 ms 1320 KB Output is correct
39 Correct 26 ms 1296 KB Output is correct
40 Correct 26 ms 1356 KB Output is correct
41 Partially correct 31 ms 1380 KB Output is partially correct
42 Partially correct 30 ms 1796 KB Output is partially correct
43 Partially correct 23 ms 600 KB Output is partially correct
44 Partially correct 57 ms 592 KB Output is partially correct
45 Correct 30 ms 592 KB Output is correct
46 Correct 21 ms 932 KB Output is correct
47 Correct 25 ms 1400 KB Output is correct
48 Correct 19 ms 1672 KB Output is correct