oj.uz

답안 #988575

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
988575 2024-05-25T07:46:19 Z cnn008 드문 곤충 (IOI22_insects) C++17
100 / 100
 36 ms 2008 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());

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(p[i]);
	};
	auto del = [&](int i) -> void{
		s.erase(s.find(i));
		move_outside(p[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;
			if((int)s.size()>=cad*k) return 1;
			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;
		if(check(mid)){
			ans=mid;
			l=mid+1;
		}else{
			r=mid-1;
			for(auto i:nw) del(i);
		}
	}
	return ans;
}
/**  /\_/\
*   (= ._.)
*   / >💖 \>💕
**/

Compilation message

insects.cpp:68:9: warning: "/*" within comment [-Wcomment]
   68 | /**  /\_/\
      |

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 856 KB Output is correct
9 Correct 3 ms 344 KB Output is correct
10 Correct 3 ms 432 KB Output is correct
11 Correct 2 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 2 ms 600 KB Output is correct
15 Correct 3 ms 700 KB Output is correct
16 Correct 3 ms 600 KB Output is correct
17 Correct 3 ms 1112 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 692 KB Output is correct
22 Correct 2 ms 1108 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 856 KB Output is correct
9 Correct 3 ms 344 KB Output is correct
10 Correct 3 ms 432 KB Output is correct
11 Correct 2 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 2 ms 600 KB Output is correct
15 Correct 3 ms 700 KB Output is correct
16 Correct 3 ms 600 KB Output is correct
17 Correct 3 ms 1112 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 692 KB Output is correct
22 Correct 2 ms 1108 KB Output is correct
23 Correct 13 ms 1224 KB Output is correct
24 Correct 5 ms 1388 KB Output is correct
25 Correct 11 ms 856 KB Output is correct
26 Correct 14 ms 956 KB Output is correct
27 Correct 14 ms 1112 KB Output is correct
28 Correct 5 ms 1112 KB Output is correct
29 Correct 18 ms 696 KB Output is correct
30 Correct 15 ms 960 KB Output is correct
31 Correct 11 ms 1232 KB Output is correct
32 Correct 12 ms 1220 KB Output is correct
33 Correct 12 ms 1472 KB Output is correct
34 Correct 13 ms 1160 KB Output is correct
35 Correct 13 ms 1112 KB Output is correct
36 Correct 13 ms 600 KB Output is correct
37 Correct 12 ms 956 KB Output is correct
38 Correct 12 ms 856 KB Output is correct
39 Correct 10 ms 1112 KB Output is correct
40 Correct 10 ms 972 KB Output is correct
41 Correct 5 ms 1124 KB Output is correct

Subtask #3
75.0 / 75.0

# 결과 실행 시간 메모리 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 22 ms 1740 KB Output is correct
8 Correct 10 ms 1120 KB Output is correct
9 Correct 21 ms 1220 KB Output is correct
10 Correct 29 ms 1692 KB Output is correct
11 Correct 22 ms 1036 KB Output is correct
12 Correct 19 ms 1112 KB Output is correct
13 Correct 25 ms 1104 KB Output is correct
14 Correct 31 ms 1464 KB Output is correct
15 Correct 22 ms 1672 KB Output is correct
16 Correct 27 ms 1676 KB Output is correct
17 Correct 30 ms 1420 KB Output is correct
18 Correct 23 ms 1432 KB Output is correct
19 Correct 28 ms 1488 KB Output is correct
20 Correct 30 ms 1524 KB Output is correct
21 Correct 30 ms 1028 KB Output is correct
22 Correct 26 ms 848 KB Output is correct
23 Correct 24 ms 1372 KB Output is correct
24 Correct 28 ms 1376 KB Output is correct
25 Correct 17 ms 1856 KB Output is correct
26 Correct 9 ms 712 KB Output is correct
27 Correct 23 ms 1212 KB Output is correct
28 Correct 22 ms 1364 KB Output is correct
29 Correct 24 ms 1192 KB Output is correct
30 Correct 22 ms 1660 KB Output is correct
31 Correct 26 ms 1336 KB Output is correct
32 Correct 31 ms 2008 KB Output is correct
33 Correct 36 ms 940 KB Output is correct
34 Correct 30 ms 1664 KB Output is correct
35 Correct 29 ms 1472 KB Output is correct
36 Correct 24 ms 1032 KB Output is correct
37 Correct 30 ms 1200 KB Output is correct
38 Correct 28 ms 1420 KB Output is correct
39 Correct 24 ms 1056 KB Output is correct
40 Correct 23 ms 1640 KB Output is correct
41 Correct 23 ms 1336 KB Output is correct
42 Correct 22 ms 1324 KB Output is correct
43 Correct 6 ms 600 KB Output is correct
44 Correct 29 ms 932 KB Output is correct
45 Correct 20 ms 1104 KB Output is correct
46 Correct 15 ms 1468 KB Output is correct
47 Correct 14 ms 1132 KB Output is correct
48 Correct 19 ms 1124 KB Output is correct