oj.uz

답안 #988551

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
988551 2024-05-25T07:01:26 Z cnn008 드문 곤충 (IOI22_insects) C++17
57.25 / 100
 91 ms 2160 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();
	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:97:9: warning: "/*" within comment [-Wcomment]
   97 | /**  /\_/\
      |          
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

# 결과 실행 시간 메모리 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 2 ms 344 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 600 KB Output is correct
10 Correct 3 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 6 ms 344 KB Output is correct
13 Correct 3 ms 600 KB Output is correct
14 Correct 5 ms 344 KB Output is correct
15 Correct 7 ms 344 KB Output is correct
16 Correct 3 ms 600 KB Output is correct
17 Correct 3 ms 692 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 600 KB Output is correct
21 Correct 2 ms 600 KB Output is correct
22 Correct 1 ms 344 KB Output is correct

Subtask #2
15.0 / 15.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 2 ms 344 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 600 KB Output is correct
10 Correct 3 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 6 ms 344 KB Output is correct
13 Correct 3 ms 600 KB Output is correct
14 Correct 5 ms 344 KB Output is correct
15 Correct 7 ms 344 KB Output is correct
16 Correct 3 ms 600 KB Output is correct
17 Correct 3 ms 692 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 600 KB Output is correct
21 Correct 2 ms 600 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 10 ms 600 KB Output is correct
24 Correct 5 ms 1140 KB Output is correct
25 Correct 17 ms 1060 KB Output is correct
26 Correct 21 ms 860 KB Output is correct
27 Correct 13 ms 600 KB Output is correct
28 Correct 5 ms 1116 KB Output is correct
29 Correct 26 ms 600 KB Output is correct
30 Correct 13 ms 856 KB Output is correct
31 Correct 33 ms 600 KB Output is correct
32 Correct 37 ms 600 KB Output is correct
33 Correct 18 ms 1712 KB Output is correct
34 Correct 13 ms 972 KB Output is correct
35 Correct 13 ms 1564 KB Output is correct
36 Correct 13 ms 856 KB Output is correct
37 Correct 17 ms 1048 KB Output is correct
38 Correct 13 ms 848 KB Output is correct
39 Correct 12 ms 956 KB Output is correct
40 Correct 8 ms 1236 KB Output is correct
41 Correct 5 ms 856 KB Output is correct

Subtask #3
32.25 / 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 0 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 21 ms 412 KB Output is correct
8 Correct 10 ms 1384 KB Output is correct
9 Correct 34 ms 1536 KB Output is correct
10 Correct 37 ms 1080 KB Output is correct
11 Correct 30 ms 600 KB Output is correct
12 Correct 16 ms 1628 KB Output is correct
13 Partially correct 55 ms 592 KB Output is partially correct
14 Correct 25 ms 864 KB Output is correct
15 Partially correct 55 ms 592 KB Output is partially correct
16 Partially correct 91 ms 600 KB Output is partially correct
17 Correct 28 ms 1608 KB Output is correct
18 Correct 35 ms 1388 KB Output is correct
19 Partially correct 30 ms 1700 KB Output is partially correct
20 Correct 31 ms 1532 KB Output is correct
21 Correct 32 ms 1072 KB Output is correct
22 Correct 27 ms 712 KB Output is correct
23 Correct 25 ms 676 KB Output is correct
24 Correct 19 ms 856 KB Output is correct
25 Correct 18 ms 744 KB Output is correct
26 Correct 12 ms 1492 KB Output is correct
27 Correct 29 ms 1756 KB Output is correct
28 Correct 29 ms 1504 KB Output is correct
29 Partially correct 32 ms 2160 KB Output is partially correct
30 Partially correct 28 ms 1864 KB Output is partially correct
31 Correct 33 ms 1488 KB Output is correct
32 Correct 25 ms 1364 KB Output is correct
33 Correct 26 ms 1308 KB Output is correct
34 Correct 26 ms 848 KB Output is correct
35 Partially correct 27 ms 1820 KB Output is partially correct
36 Partially correct 44 ms 1468 KB Output is partially correct
37 Correct 28 ms 1260 KB Output is correct
38 Correct 29 ms 1268 KB Output is correct
39 Correct 30 ms 1272 KB Output is correct
40 Correct 25 ms 1464 KB Output is correct
41 Partially correct 29 ms 1592 KB Output is partially correct
42 Partially correct 27 ms 1880 KB Output is partially correct
43 Partially correct 14 ms 344 KB Output is partially correct
44 Partially correct 57 ms 592 KB Output is partially correct
45 Correct 45 ms 344 KB Output is correct
46 Correct 13 ms 1204 KB Output is correct
47 Correct 13 ms 1112 KB Output is correct
48 Correct 18 ms 924 KB Output is correct