oj.uz

Submission #988535

# Submission time Handle Problem Language Result Execution time Memory
988535 2024-05-25T06:13:27 Z cnn008 Rarest Insects (IOI22_insects) C++17
53.13 / 100
 104 ms 1952 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;
	vector <int> nw;
	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(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) 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:84:9: warning: "/*" within comment [-Wcomment]
   84 | /**  /\_/\
      |

Subtask #1
10.0 / 10.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 3 ms 600 KB Output is correct
7 Correct 2 ms 600 KB Output is correct
8 Correct 3 ms 856 KB Output is correct
9 Correct 4 ms 856 KB Output is correct
10 Correct 6 ms 344 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 6 ms 600 KB Output is correct
13 Correct 4 ms 856 KB Output is correct
14 Correct 3 ms 600 KB Output is correct
15 Correct 3 ms 856 KB Output is correct
16 Correct 4 ms 856 KB Output is correct
17 Correct 3 ms 600 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 1 ms 856 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 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 3 ms 600 KB Output is correct
7 Correct 2 ms 600 KB Output is correct
8 Correct 3 ms 856 KB Output is correct
9 Correct 4 ms 856 KB Output is correct
10 Correct 6 ms 344 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 6 ms 600 KB Output is correct
13 Correct 4 ms 856 KB Output is correct
14 Correct 3 ms 600 KB Output is correct
15 Correct 3 ms 856 KB Output is correct
16 Correct 4 ms 856 KB Output is correct
17 Correct 3 ms 600 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 1 ms 856 KB Output is correct
23 Correct 13 ms 940 KB Output is correct
24 Correct 6 ms 600 KB Output is correct
25 Correct 13 ms 1368 KB Output is correct
26 Correct 24 ms 940 KB Output is correct
27 Correct 50 ms 848 KB Output is correct
28 Correct 5 ms 600 KB Output is correct
29 Correct 41 ms 696 KB Output is correct
30 Correct 34 ms 1112 KB Output is correct
31 Correct 17 ms 696 KB Output is correct
32 Correct 13 ms 1116 KB Output is correct
33 Correct 19 ms 600 KB Output is correct
34 Correct 19 ms 1624 KB Output is correct
35 Correct 15 ms 884 KB Output is correct
36 Correct 20 ms 872 KB Output is correct
37 Correct 14 ms 1112 KB Output is correct
38 Correct 16 ms 856 KB Output is correct
39 Correct 14 ms 856 KB Output is correct
40 Correct 13 ms 700 KB Output is correct
41 Correct 5 ms 856 KB Output is correct

Subtask #3
28.13 / 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 340 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 27 ms 1508 KB Output is correct
8 Correct 9 ms 1624 KB Output is correct
9 Correct 29 ms 1440 KB Output is correct
10 Partially correct 34 ms 1360 KB Output is partially correct
11 Partially correct 104 ms 664 KB Output is partially correct
12 Correct 20 ms 964 KB Output is correct
13 Partially correct 104 ms 848 KB Output is partially correct
14 Partially correct 64 ms 1104 KB Output is partially correct
15 Partially correct 50 ms 728 KB Output is partially correct
16 Partially correct 28 ms 1236 KB Output is partially correct
17 Partially correct 33 ms 1168 KB Output is partially correct
18 Partially correct 45 ms 1212 KB Output is partially correct
19 Partially correct 34 ms 1104 KB Output is partially correct
20 Partially correct 33 ms 992 KB Output is partially correct
21 Partially correct 44 ms 1616 KB Output is partially correct
22 Partially correct 49 ms 1120 KB Output is partially correct
23 Partially correct 37 ms 1208 KB Output is partially correct
24 Correct 40 ms 856 KB Output is correct
25 Correct 23 ms 1112 KB Output is correct
26 Correct 9 ms 600 KB Output is correct
27 Correct 25 ms 1148 KB Output is correct
28 Correct 24 ms 1952 KB Output is correct
29 Partially correct 29 ms 1492 KB Output is partially correct
30 Partially correct 32 ms 1240 KB Output is partially correct
31 Partially correct 36 ms 896 KB Output is partially correct
32 Partially correct 41 ms 1228 KB Output is partially correct
33 Partially correct 44 ms 1104 KB Output is partially correct
34 Partially correct 51 ms 1104 KB Output is partially correct
35 Partially correct 26 ms 1452 KB Output is partially correct
36 Partially correct 28 ms 1208 KB Output is partially correct
37 Partially correct 40 ms 856 KB Output is partially correct
38 Partially correct 36 ms 668 KB Output is partially correct
39 Correct 25 ms 1472 KB Output is correct
40 Correct 23 ms 1460 KB Output is correct
41 Partially correct 32 ms 1428 KB Output is partially correct
42 Partially correct 30 ms 992 KB Output is partially correct
43 Partially correct 22 ms 856 KB Output is partially correct
44 Partially correct 84 ms 456 KB Output is partially correct
45 Correct 37 ms 672 KB Output is correct
46 Correct 21 ms 584 KB Output is correct
47 Correct 19 ms 1112 KB Output is correct
48 Correct 21 ms 1452 KB Output is correct