답안 #681916

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
681916	2023-01-14T21:07:18 Z	Kahou	Cat in a tree (BOI17_catinatree)	C++14	11 / 100	9 ms	8904 KB

catinatree

#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define endl '\n'
#define mk make_pair
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int N = 20, M = (1<<20);
int n, d, nb[N], dp[M];
vector<int> adj[N];

void dfs(int u, int p, int t, int r) {
	if (t >= d) return;
	nb[r] ^= (1<<u);
	for (int v:adj[u]) {
		if (v == p) continue;
		dfs(v, u, t+1, r);
	}
}

void solve() {
	cin >> n >> d;
	for (int u = 1; u < n; u++) {
		int p;
		cin >> p;
		adj[u].push_back(p);
		adj[p].push_back(u);
	}
	for (int u = 0; u < n; u++) {
		dfs(u, -1, 0, u);
	}
	dp[0] = 0;
	for (int mask = 1; mask < (1<<n); mask++) {
		int u = __builtin_ctz(mask);
		dp[mask] = max(dp[mask^(1<<u)], dp[mask^(mask&nb[u])]+1);
	}
	cout << dp[(1<<n)-1] << endl;
}
int main() {
	ios::sync_with_stdio(0), cin.tie(0);
	solve();
	return 0;
}

Subtask #1

11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	328 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	1 ms	328 KB	Output is correct
7	Correct	1 ms	468 KB	Output is correct
8	Correct	1 ms	468 KB	Output is correct
9	Correct	2 ms	1236 KB	Output is correct
10	Correct	2 ms	1348 KB	Output is correct
11	Correct	1 ms	1356 KB	Output is correct
12	Correct	4 ms	1356 KB	Output is correct
13	Correct	1 ms	836 KB	Output is correct
14	Correct	1 ms	840 KB	Output is correct
15	Correct	2 ms	1236 KB	Output is correct
16	Correct	2 ms	1236 KB	Output is correct
17	Correct	1 ms	1348 KB	Output is correct
18	Correct	1 ms	1236 KB	Output is correct
19	Correct	1 ms	1236 KB	Output is correct
20	Correct	1 ms	1236 KB	Output is correct

Subtask #2

0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	328 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	1 ms	328 KB	Output is correct
7	Correct	1 ms	468 KB	Output is correct
8	Correct	1 ms	468 KB	Output is correct
9	Correct	2 ms	1236 KB	Output is correct
10	Correct	2 ms	1348 KB	Output is correct
11	Correct	1 ms	1356 KB	Output is correct
12	Correct	4 ms	1356 KB	Output is correct
13	Correct	1 ms	836 KB	Output is correct
14	Correct	1 ms	840 KB	Output is correct
15	Correct	2 ms	1236 KB	Output is correct
16	Correct	2 ms	1236 KB	Output is correct
17	Correct	1 ms	1348 KB	Output is correct
18	Correct	1 ms	1236 KB	Output is correct
19	Correct	1 ms	1236 KB	Output is correct
20	Correct	1 ms	1236 KB	Output is correct
21	Runtime error	9 ms	8904 KB	Execution killed with signal 11
22	Halted	0 ms	0 KB	-

Subtask #3

0 / 49.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	328 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	1 ms	328 KB	Output is correct
7	Correct	1 ms	468 KB	Output is correct
8	Correct	1 ms	468 KB	Output is correct
9	Correct	2 ms	1236 KB	Output is correct
10	Correct	2 ms	1348 KB	Output is correct
11	Correct	1 ms	1356 KB	Output is correct
12	Correct	4 ms	1356 KB	Output is correct
13	Correct	1 ms	836 KB	Output is correct
14	Correct	1 ms	840 KB	Output is correct
15	Correct	2 ms	1236 KB	Output is correct
16	Correct	2 ms	1236 KB	Output is correct
17	Correct	1 ms	1348 KB	Output is correct
18	Correct	1 ms	1236 KB	Output is correct
19	Correct	1 ms	1236 KB	Output is correct
20	Correct	1 ms	1236 KB	Output is correct
21	Runtime error	9 ms	8904 KB	Execution killed with signal 11
22	Halted	0 ms	0 KB	-