oj.uz

답안 #988569

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
988569 2024-05-25T07:26:33 Z cnn008 드문 곤충 (IOI22_insects) C++17
99.95 / 100
 41 ms 2064 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{
		if(s.find(i)!=s.end()) return;
		s.insert(i);
		move_inside(i);
	};
	auto del = [&](int i) -> void{
		s.erase(s.find(i));
		move_outside(i);
	};
	auto check = [&](int k) -> int{
		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(p[i]);
		if(press_button()>1) del(p[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:69:9: warning: "/*" within comment [-Wcomment]
   69 | /**  /\_/\
      |

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 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 0 ms 344 KB Output is correct
6 Correct 2 ms 600 KB Output is correct
7 Correct 2 ms 600 KB Output is correct
8 Correct 2 ms 600 KB Output is correct
9 Correct 3 ms 600 KB Output is correct
10 Correct 3 ms 344 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 344 KB Output is correct
14 Correct 3 ms 1112 KB Output is correct
15 Correct 3 ms 600 KB Output is correct
16 Correct 3 ms 600 KB Output is correct
17 Correct 3 ms 344 KB Output is correct
18 Correct 3 ms 600 KB Output is correct
19 Correct 3 ms 1112 KB Output is correct
20 Correct 3 ms 1112 KB Output is correct
21 Correct 2 ms 600 KB Output is correct
22 Correct 1 ms 600 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 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 0 ms 344 KB Output is correct
6 Correct 2 ms 600 KB Output is correct
7 Correct 2 ms 600 KB Output is correct
8 Correct 2 ms 600 KB Output is correct
9 Correct 3 ms 600 KB Output is correct
10 Correct 3 ms 344 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 344 KB Output is correct
14 Correct 3 ms 1112 KB Output is correct
15 Correct 3 ms 600 KB Output is correct
16 Correct 3 ms 600 KB Output is correct
17 Correct 3 ms 344 KB Output is correct
18 Correct 3 ms 600 KB Output is correct
19 Correct 3 ms 1112 KB Output is correct
20 Correct 3 ms 1112 KB Output is correct
21 Correct 2 ms 600 KB Output is correct
22 Correct 1 ms 600 KB Output is correct
23 Correct 11 ms 1072 KB Output is correct
24 Correct 5 ms 856 KB Output is correct
25 Correct 12 ms 820 KB Output is correct
26 Correct 12 ms 1368 KB Output is correct
27 Correct 12 ms 776 KB Output is correct
28 Correct 5 ms 1364 KB Output is correct
29 Correct 14 ms 692 KB Output is correct
30 Correct 15 ms 868 KB Output is correct
31 Correct 11 ms 1368 KB Output is correct
32 Correct 12 ms 1140 KB Output is correct
33 Correct 13 ms 1200 KB Output is correct
34 Correct 12 ms 1368 KB Output is correct
35 Correct 12 ms 1100 KB Output is correct
36 Correct 13 ms 1052 KB Output is correct
37 Correct 13 ms 872 KB Output is correct
38 Correct 15 ms 856 KB Output is correct
39 Correct 9 ms 856 KB Output is correct
40 Correct 8 ms 612 KB Output is correct
41 Correct 6 ms 856 KB Output is correct

Subtask #3
74.95 / 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 596 KB Output is correct
4 Correct 1 ms 404 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 692 KB Output is correct
8 Correct 9 ms 968 KB Output is correct
9 Correct 25 ms 1652 KB Output is correct
10 Correct 31 ms 1400 KB Output is correct
11 Correct 24 ms 936 KB Output is correct
12 Correct 16 ms 1180 KB Output is correct
13 Correct 29 ms 1108 KB Output is correct
14 Correct 31 ms 848 KB Output is correct
15 Correct 24 ms 1712 KB Output is correct
16 Correct 26 ms 1264 KB Output is correct
17 Correct 25 ms 1136 KB Output is correct
18 Correct 25 ms 1832 KB Output is correct
19 Correct 27 ms 1172 KB Output is correct
20 Correct 25 ms 1420 KB Output is correct
21 Correct 25 ms 1188 KB Output is correct
22 Correct 41 ms 1332 KB Output is correct
23 Correct 23 ms 1016 KB Output is correct
24 Correct 22 ms 1160 KB Output is correct
25 Correct 16 ms 1216 KB Output is correct
26 Correct 9 ms 952 KB Output is correct
27 Correct 24 ms 1400 KB Output is correct
28 Correct 24 ms 1188 KB Output is correct
29 Correct 30 ms 1220 KB Output is correct
30 Correct 29 ms 1496 KB Output is correct
31 Correct 31 ms 1228 KB Output is correct
32 Correct 30 ms 1692 KB Output is correct
33 Correct 29 ms 948 KB Output is correct
34 Correct 25 ms 1300 KB Output is correct
35 Partially correct 35 ms 1680 KB Output is partially correct
36 Correct 28 ms 1460 KB Output is correct
37 Correct 32 ms 1432 KB Output is correct
38 Correct 30 ms 924 KB Output is correct
39 Correct 22 ms 2064 KB Output is correct
40 Correct 24 ms 1108 KB Output is correct
41 Correct 28 ms 1916 KB Output is correct
42 Partially correct 30 ms 1416 KB Output is partially correct
43 Correct 7 ms 864 KB Output is correct
44 Correct 23 ms 956 KB Output is correct
45 Correct 19 ms 1636 KB Output is correct
46 Correct 13 ms 1360 KB Output is correct
47 Correct 20 ms 1108 KB Output is correct
48 Correct 13 ms 856 KB Output is correct