Submission #787284

# Submission time Handle Problem Language Result Execution time Memory
787284 2023-07-19T03:36:33 Z ono_de206 Rarest Insects (IOI22_insects) C++17
61.1 / 100
131 ms 728 KB
#include "insects.h"
#include<bits/stdc++.h>
using namespace std;

#define in insert
#define all(x) x.begin(),x.end()
#define pb push_back
#define eb emplace_back
#define ff first
#define ss second

//#define int long long
 
typedef long long ll;
typedef vector<int> vi;
typedef set<int> si;
typedef multiset<int> msi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
set<int> all;

void add(int i) {
	if(all.count(i)) return;
	move_inside(i);
	all.in(i);
}

void rem(int i) {
	if(!all.count(i)) return;
	move_outside(i);
	all.erase(i);
}

int solve(vector<int> a, vector<int> b) {
	if(a.size() == 1) {
		rem(a[0]);
		return (int)a.size() + (int)b.size();
	}
	if(b.size() < a.size()) {
		for(int x : a) {
			rem(x);
		}
		return 1;
	}
	random_shuffle(all(a));
	vector<int> a1, a2, b1, b2;
	int sz = a.size();
	for(int i = 0; i < sz / 2; i++) {
		a1.pb(a[i]);
		add(a[i]);
	}
	for(int i = sz / 2; i < sz; i++) {
		a2.pb(a[i]);
		rem(a[i]);
	}
	for(int x : b) {
		add(x);
		if(press_button() > 1) b1.pb(x);
		else b2.pb(x);
		rem(x);
	}
	return min(solve(a1, b1), solve(a2, b2));
}

int min_cardinality(int n) {
	vector<int> a, b;
	for(int i = 0; i < n; i++) {
		a.pb(i);
		add(i);
		if(press_button() > 1) {
			a.pop_back();
			b.pb(i);
			rem(i);
		}
	}
	return solve(a, b);
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 2 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 8 ms 208 KB Output is correct
9 Correct 6 ms 208 KB Output is correct
10 Correct 4 ms 284 KB Output is correct
11 Correct 1 ms 304 KB Output is correct
12 Correct 6 ms 304 KB Output is correct
13 Correct 5 ms 208 KB Output is correct
14 Correct 7 ms 308 KB Output is correct
15 Correct 5 ms 308 KB Output is correct
16 Correct 6 ms 304 KB Output is correct
17 Correct 8 ms 296 KB Output is correct
18 Correct 7 ms 308 KB Output is correct
19 Correct 9 ms 308 KB Output is correct
20 Correct 9 ms 288 KB Output is correct
21 Correct 4 ms 304 KB Output is correct
22 Correct 2 ms 208 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 2 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 8 ms 208 KB Output is correct
9 Correct 6 ms 208 KB Output is correct
10 Correct 4 ms 284 KB Output is correct
11 Correct 1 ms 304 KB Output is correct
12 Correct 6 ms 304 KB Output is correct
13 Correct 5 ms 208 KB Output is correct
14 Correct 7 ms 308 KB Output is correct
15 Correct 5 ms 308 KB Output is correct
16 Correct 6 ms 304 KB Output is correct
17 Correct 8 ms 296 KB Output is correct
18 Correct 7 ms 308 KB Output is correct
19 Correct 9 ms 308 KB Output is correct
20 Correct 9 ms 288 KB Output is correct
21 Correct 4 ms 304 KB Output is correct
22 Correct 2 ms 208 KB Output is correct
23 Correct 9 ms 208 KB Output is correct
24 Correct 7 ms 336 KB Output is correct
25 Correct 50 ms 308 KB Output is correct
26 Correct 50 ms 304 KB Output is correct
27 Correct 17 ms 300 KB Output is correct
28 Correct 10 ms 320 KB Output is correct
29 Correct 19 ms 308 KB Output is correct
30 Correct 48 ms 312 KB Output is correct
31 Correct 28 ms 308 KB Output is correct
32 Correct 26 ms 300 KB Output is correct
33 Correct 32 ms 308 KB Output is correct
34 Correct 28 ms 308 KB Output is correct
35 Correct 33 ms 304 KB Output is correct
36 Correct 47 ms 316 KB Output is correct
37 Correct 56 ms 312 KB Output is correct
38 Correct 60 ms 208 KB Output is correct
39 Correct 50 ms 324 KB Output is correct
40 Correct 49 ms 336 KB Output is correct
41 Correct 8 ms 300 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 15 ms 300 KB Output is correct
8 Correct 17 ms 360 KB Output is correct
9 Partially correct 113 ms 312 KB Output is partially correct
10 Partially correct 93 ms 348 KB Output is partially correct
11 Correct 27 ms 324 KB Output is correct
12 Partially correct 101 ms 336 KB Output is partially correct
13 Partially correct 46 ms 324 KB Output is partially correct
14 Partially correct 126 ms 316 KB Output is partially correct
15 Partially correct 55 ms 340 KB Output is partially correct
16 Partially correct 39 ms 304 KB Output is partially correct
17 Partially correct 60 ms 324 KB Output is partially correct
18 Partially correct 64 ms 304 KB Output is partially correct
19 Partially correct 86 ms 340 KB Output is partially correct
20 Partially correct 72 ms 304 KB Output is partially correct
21 Partially correct 72 ms 344 KB Output is partially correct
22 Partially correct 131 ms 308 KB Output is partially correct
23 Partially correct 76 ms 348 KB Output is partially correct
24 Partially correct 98 ms 572 KB Output is partially correct
25 Partially correct 112 ms 388 KB Output is partially correct
26 Correct 15 ms 352 KB Output is correct
27 Partially correct 102 ms 324 KB Output is partially correct
28 Partially correct 71 ms 328 KB Output is partially correct
29 Partially correct 84 ms 336 KB Output is partially correct
30 Partially correct 82 ms 336 KB Output is partially correct
31 Partially correct 86 ms 324 KB Output is partially correct
32 Partially correct 100 ms 332 KB Output is partially correct
33 Partially correct 107 ms 456 KB Output is partially correct
34 Partially correct 127 ms 340 KB Output is partially correct
35 Partially correct 114 ms 328 KB Output is partially correct
36 Partially correct 98 ms 340 KB Output is partially correct
37 Partially correct 110 ms 336 KB Output is partially correct
38 Partially correct 86 ms 456 KB Output is partially correct
39 Partially correct 98 ms 336 KB Output is partially correct
40 Partially correct 96 ms 308 KB Output is partially correct
41 Partially correct 120 ms 328 KB Output is partially correct
42 Partially correct 100 ms 336 KB Output is partially correct
43 Partially correct 19 ms 304 KB Output is partially correct
44 Partially correct 29 ms 336 KB Output is partially correct
45 Correct 36 ms 308 KB Output is correct
46 Partially correct 83 ms 432 KB Output is partially correct
47 Partially correct 92 ms 728 KB Output is partially correct
48 Partially correct 105 ms 508 KB Output is partially correct