답안 #835025

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
835025	2023-08-23T06:12:02 Z	pavement	드문 곤충 (IOI22_insects)	C++17	10 / 100	89 ms	508 KB

insects

#include "insects.h"
#include <bits/stdc++.h>
using namespace std;

#define pb push_back

vector<int> cur_v, perm;

int qry(vector<int> v) {
	sort(v.begin(), v.end());
	vector<int> chng;
	set_symmetric_difference(v.begin(), v.end(), cur_v.begin(), cur_v.end(), back_inserter(chng));
	for (int i : chng) {
		if (binary_search(v.begin(), v.end(), i)) {
			move_inside(perm[i]);
		} else {
			move_outside(perm[i]);
		}
	}
	cur_v = v;
	return press_button();
}

mt19937 rng(998244353);

int min_cardinality(int N) {
	perm.resize(N);
	iota(perm.begin(), perm.end(), 0);
	shuffle(perm.begin(), perm.end(), rng);
	vector<int> rep, cnt(N, 0), lnk(N, -1);
	for (int i = 0; i < N; i++) {
		{
			shuffle(rep.begin(), rep.end(), rng);
			int lo = 0, hi = (int)rep.size() - 1;
			while (lo <= hi) {
				int mid = (lo + hi) / 2;
				vector<int> cur;
				for (int j = 0; j <= mid; j++) {
					cur.pb(rep[j]);
				}
				int q1 = qry(cur);
				cur.pb(i);
				int q2 = qry(cur);
				if (q1 != q2) {
					lnk[i] = rep[mid];
					hi = mid - 1;
				} else {
					lo = mid + 1;
				}
			}
		}
		if (lnk[i] != -1) {
			rep.erase(find(rep.begin(), rep.end(), lnk[i]));
		}
		rep.pb(i);
	}
	int ret = N;
	for (int i = N - 1; i >= 0; i--) {
		cnt[i]++;
		if (lnk[i] == -1) {
			ret = min(ret, cnt[i]);
		} else {
			cnt[lnk[i]] += cnt[i];
		}
	}
	return ret;
}

Subtask #1

10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 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	1 ms	208 KB	Output is correct
6	Correct	4 ms	208 KB	Output is correct
7	Correct	33 ms	444 KB	Output is correct
8	Correct	12 ms	208 KB	Output is correct
9	Correct	13 ms	208 KB	Output is correct
10	Correct	3 ms	208 KB	Output is correct
11	Correct	23 ms	304 KB	Output is correct
12	Correct	7 ms	208 KB	Output is correct
13	Correct	13 ms	208 KB	Output is correct
14	Correct	7 ms	208 KB	Output is correct
15	Correct	11 ms	208 KB	Output is correct
16	Correct	12 ms	208 KB	Output is correct
17	Correct	13 ms	208 KB	Output is correct
18	Correct	12 ms	208 KB	Output is correct
19	Correct	15 ms	208 KB	Output is correct
20	Correct	17 ms	208 KB	Output is correct
21	Correct	22 ms	292 KB	Output is correct
22	Correct	29 ms	308 KB	Output is correct

Subtask #2

0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 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	1 ms	208 KB	Output is correct
6	Correct	4 ms	208 KB	Output is correct
7	Correct	33 ms	444 KB	Output is correct
8	Correct	12 ms	208 KB	Output is correct
9	Correct	13 ms	208 KB	Output is correct
10	Correct	3 ms	208 KB	Output is correct
11	Correct	23 ms	304 KB	Output is correct
12	Correct	7 ms	208 KB	Output is correct
13	Correct	13 ms	208 KB	Output is correct
14	Correct	7 ms	208 KB	Output is correct
15	Correct	11 ms	208 KB	Output is correct
16	Correct	12 ms	208 KB	Output is correct
17	Correct	13 ms	208 KB	Output is correct
18	Correct	12 ms	208 KB	Output is correct
19	Correct	15 ms	208 KB	Output is correct
20	Correct	17 ms	208 KB	Output is correct
21	Correct	22 ms	292 KB	Output is correct
22	Correct	29 ms	308 KB	Output is correct
23	Correct	18 ms	208 KB	Output is correct
24	Incorrect	86 ms	460 KB	Too many queries.
25	Halted	0 ms	0 KB	-

Subtask #3

0 / 75.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	252 KB	Output is correct
2	Correct	1 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	26 ms	208 KB	Output is correct
8	Incorrect	89 ms	508 KB	Too many queries.
9	Halted	0 ms	0 KB	-