답안 #976674

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
976674 2024-05-07T02:10:14 Z Halym2007 Cat in a tree (BOI17_catinatree) C++17
100 / 100
72 ms 24916 KB
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ff first
#define ss second
#define pii pair<int, int>
#define sz size()
const int N = 2e5 + 5;
pii dp[N];
vector <int> v[N];
int n, d;
void solve (int x) {
	dp[x] = {0, d};
	int val = 0;
	vector <int> q;
	for (int i : v[x]) {
		solve (i);
		val += dp[i].ff;
		q.pb (dp[i].ss + 1);
	}
	sort (q.begin(), q.end());
	for (int i = 0; i < (int)q.sz; ++i) {
		int j = lower_bound (q.begin(), q.end(), d - q[i]) - q.begin();
		if (i < j) j--;
		else {
			j = i;
		}
		dp[x] = max (dp[x], {val - j, q[i]});
	}
	if (dp[x].ss >= d) {
		dp[x].ff++;
		dp[x].ss = 0;
	}
}


int main () {
	cin >> n >> d;
	for (int i = 1; i < n; ++i) {
		int par;
		cin >> par;
		v[par].pb (i);
	}
	solve (0);
	cout << dp[0].ff;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4952 KB Output is correct
2 Correct 1 ms 4952 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 1 ms 4956 KB Output is correct
5 Correct 3 ms 5140 KB Output is correct
6 Correct 3 ms 4956 KB Output is correct
7 Correct 1 ms 5208 KB Output is correct
8 Correct 3 ms 4956 KB Output is correct
9 Correct 1 ms 4956 KB Output is correct
10 Correct 1 ms 4956 KB Output is correct
11 Correct 2 ms 4952 KB Output is correct
12 Correct 2 ms 4956 KB Output is correct
13 Correct 1 ms 4956 KB Output is correct
14 Correct 1 ms 4956 KB Output is correct
15 Correct 1 ms 4956 KB Output is correct
16 Correct 1 ms 4952 KB Output is correct
17 Correct 2 ms 4956 KB Output is correct
18 Correct 2 ms 4956 KB Output is correct
19 Correct 1 ms 4956 KB Output is correct
20 Correct 2 ms 4952 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4952 KB Output is correct
2 Correct 1 ms 4952 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 1 ms 4956 KB Output is correct
5 Correct 3 ms 5140 KB Output is correct
6 Correct 3 ms 4956 KB Output is correct
7 Correct 1 ms 5208 KB Output is correct
8 Correct 3 ms 4956 KB Output is correct
9 Correct 1 ms 4956 KB Output is correct
10 Correct 1 ms 4956 KB Output is correct
11 Correct 2 ms 4952 KB Output is correct
12 Correct 2 ms 4956 KB Output is correct
13 Correct 1 ms 4956 KB Output is correct
14 Correct 1 ms 4956 KB Output is correct
15 Correct 1 ms 4956 KB Output is correct
16 Correct 1 ms 4952 KB Output is correct
17 Correct 2 ms 4956 KB Output is correct
18 Correct 2 ms 4956 KB Output is correct
19 Correct 1 ms 4956 KB Output is correct
20 Correct 2 ms 4952 KB Output is correct
21 Correct 2 ms 5212 KB Output is correct
22 Correct 1 ms 4956 KB Output is correct
23 Correct 2 ms 4956 KB Output is correct
24 Correct 1 ms 4956 KB Output is correct
25 Correct 2 ms 4956 KB Output is correct
26 Correct 2 ms 4952 KB Output is correct
27 Correct 2 ms 4956 KB Output is correct
28 Correct 2 ms 4952 KB Output is correct
29 Correct 2 ms 4956 KB Output is correct
30 Correct 2 ms 4956 KB Output is correct
31 Correct 2 ms 4956 KB Output is correct
32 Correct 2 ms 5208 KB Output is correct
33 Correct 2 ms 4956 KB Output is correct
34 Correct 2 ms 5140 KB Output is correct
35 Correct 2 ms 4956 KB Output is correct
36 Correct 2 ms 5140 KB Output is correct
37 Correct 2 ms 4956 KB Output is correct
38 Correct 2 ms 4956 KB Output is correct
39 Correct 2 ms 5212 KB Output is correct
40 Correct 2 ms 5212 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4952 KB Output is correct
2 Correct 1 ms 4952 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 1 ms 4956 KB Output is correct
5 Correct 3 ms 5140 KB Output is correct
6 Correct 3 ms 4956 KB Output is correct
7 Correct 1 ms 5208 KB Output is correct
8 Correct 3 ms 4956 KB Output is correct
9 Correct 1 ms 4956 KB Output is correct
10 Correct 1 ms 4956 KB Output is correct
11 Correct 2 ms 4952 KB Output is correct
12 Correct 2 ms 4956 KB Output is correct
13 Correct 1 ms 4956 KB Output is correct
14 Correct 1 ms 4956 KB Output is correct
15 Correct 1 ms 4956 KB Output is correct
16 Correct 1 ms 4952 KB Output is correct
17 Correct 2 ms 4956 KB Output is correct
18 Correct 2 ms 4956 KB Output is correct
19 Correct 1 ms 4956 KB Output is correct
20 Correct 2 ms 4952 KB Output is correct
21 Correct 2 ms 5212 KB Output is correct
22 Correct 1 ms 4956 KB Output is correct
23 Correct 2 ms 4956 KB Output is correct
24 Correct 1 ms 4956 KB Output is correct
25 Correct 2 ms 4956 KB Output is correct
26 Correct 2 ms 4952 KB Output is correct
27 Correct 2 ms 4956 KB Output is correct
28 Correct 2 ms 4952 KB Output is correct
29 Correct 2 ms 4956 KB Output is correct
30 Correct 2 ms 4956 KB Output is correct
31 Correct 2 ms 4956 KB Output is correct
32 Correct 2 ms 5208 KB Output is correct
33 Correct 2 ms 4956 KB Output is correct
34 Correct 2 ms 5140 KB Output is correct
35 Correct 2 ms 4956 KB Output is correct
36 Correct 2 ms 5140 KB Output is correct
37 Correct 2 ms 4956 KB Output is correct
38 Correct 2 ms 4956 KB Output is correct
39 Correct 2 ms 5212 KB Output is correct
40 Correct 2 ms 5212 KB Output is correct
41 Correct 58 ms 11580 KB Output is correct
42 Correct 38 ms 8028 KB Output is correct
43 Correct 32 ms 8012 KB Output is correct
44 Correct 31 ms 8016 KB Output is correct
45 Correct 32 ms 7816 KB Output is correct
46 Correct 71 ms 10836 KB Output is correct
47 Correct 70 ms 11084 KB Output is correct
48 Correct 65 ms 10836 KB Output is correct
49 Correct 70 ms 10872 KB Output is correct
50 Correct 22 ms 6748 KB Output is correct
51 Correct 23 ms 6748 KB Output is correct
52 Correct 20 ms 6744 KB Output is correct
53 Correct 37 ms 8528 KB Output is correct
54 Correct 49 ms 8528 KB Output is correct
55 Correct 38 ms 8528 KB Output is correct
56 Correct 2 ms 5208 KB Output is correct
57 Correct 9 ms 9048 KB Output is correct
58 Correct 36 ms 21840 KB Output is correct
59 Correct 72 ms 24916 KB Output is correct
60 Correct 59 ms 12176 KB Output is correct
61 Correct 56 ms 11600 KB Output is correct