Submission #725757

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
725757	2023-04-18T02:35:28 Z	pavement	Cat in a tree (BOI17_catinatree)	C++17	100 / 100	72 ms	22860 KB

catinatree

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define ppb pop_back
#define eb emplace_back
#define g0(a) get<0>(a)
#define g1(a) get<1>(a)
#define g2(a) get<2>(a)
#define g3(a) get<3>(a)
#define g4(a) get<4>(a)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
using db = double;
using ll = long long;
using ld = long double;
using ii = pair<int, int>;
using iii = tuple<int, int, int>;
using iiii = tuple<int, int, int, int>;
using iiiii = tuple<int, int, int, int, int>;
template<class key, class value = null_type, class cmp = less<key> >
using ordered_set = tree<key, value, cmp, rb_tree_tag, tree_order_statistics_node_update>;

int N, D;
vector<int> adj[200005];

ii dp(int n) {
	int sum = 0;
	bool bad = 0;
	ii tot = mp(0, 0);
	vector<ii> vec;
	for (auto u : adj[n]) {
		auto cur = dp(u);
		cur.first++;
		if (cur.first < D) bad = 1;
		sum += cur.second;
		vec.pb(cur);
	}
	if (!bad) {
		//~ cout << "NODE " << n << ' ' << 0 << ' ' << sum + 1 << '\n';
		return mp(0, sum + 1);
	} else {
		sort(vec.begin(), vec.end());
		tot = mp(vec.back().first, sum - ((int)vec.size() - 1));
		for (int i = (int)vec.size() - 1; i >= 1; i--) {
			if (vec[i].first + vec[i - 1].first >= D) {
				auto cand = mp(vec[i - 1].first, sum - (i - 1));
				if (cand.second > tot.second) tot = cand;
				else if (cand.second == tot.second) tot = max(tot, cand);
			}
		}
		//~ cout << "NODE " << n << ' ' << tot.first << ' ' << tot.second << '\n';
		return tot;
	}
}

main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> N >> D;
	for (int i = 1, p; i < N; i++) {
		cin >> p;
		adj[p].pb(i);
	}
	cout << dp(0).second << '\n';
}

Compilation message

catinatree.cpp:61:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   61 | main() {
      | ^~~~

Subtask #1
11.0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	4948 KB	Output is correct
2	Correct	3 ms	4948 KB	Output is correct
3	Correct	3 ms	4948 KB	Output is correct
4	Correct	3 ms	4948 KB	Output is correct
5	Correct	3 ms	4948 KB	Output is correct
6	Correct	3 ms	4948 KB	Output is correct
7	Correct	3 ms	4948 KB	Output is correct
8	Correct	2 ms	4948 KB	Output is correct
9	Correct	2 ms	4948 KB	Output is correct
10	Correct	2 ms	4948 KB	Output is correct
11	Correct	3 ms	4948 KB	Output is correct
12	Correct	3 ms	4948 KB	Output is correct
13	Correct	3 ms	4948 KB	Output is correct
14	Correct	3 ms	4948 KB	Output is correct
15	Correct	2 ms	4948 KB	Output is correct
16	Correct	3 ms	4948 KB	Output is correct
17	Correct	2 ms	4948 KB	Output is correct
18	Correct	3 ms	4948 KB	Output is correct
19	Correct	2 ms	4948 KB	Output is correct
20	Correct	3 ms	4948 KB	Output is correct

Subtask #2
40.0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	4948 KB	Output is correct
2	Correct	3 ms	4948 KB	Output is correct
3	Correct	3 ms	4948 KB	Output is correct
4	Correct	3 ms	4948 KB	Output is correct
5	Correct	3 ms	4948 KB	Output is correct
6	Correct	3 ms	4948 KB	Output is correct
7	Correct	3 ms	4948 KB	Output is correct
8	Correct	2 ms	4948 KB	Output is correct
9	Correct	2 ms	4948 KB	Output is correct
10	Correct	2 ms	4948 KB	Output is correct
11	Correct	3 ms	4948 KB	Output is correct
12	Correct	3 ms	4948 KB	Output is correct
13	Correct	3 ms	4948 KB	Output is correct
14	Correct	3 ms	4948 KB	Output is correct
15	Correct	2 ms	4948 KB	Output is correct
16	Correct	3 ms	4948 KB	Output is correct
17	Correct	2 ms	4948 KB	Output is correct
18	Correct	3 ms	4948 KB	Output is correct
19	Correct	2 ms	4948 KB	Output is correct
20	Correct	3 ms	4948 KB	Output is correct
21	Correct	3 ms	5204 KB	Output is correct
22	Correct	3 ms	4948 KB	Output is correct
23	Correct	3 ms	4948 KB	Output is correct
24	Correct	3 ms	4948 KB	Output is correct
25	Correct	3 ms	4948 KB	Output is correct
26	Correct	3 ms	4948 KB	Output is correct
27	Correct	3 ms	5024 KB	Output is correct
28	Correct	3 ms	4948 KB	Output is correct
29	Correct	3 ms	4948 KB	Output is correct
30	Correct	3 ms	5032 KB	Output is correct
31	Correct	3 ms	4948 KB	Output is correct
32	Correct	3 ms	4948 KB	Output is correct
33	Correct	3 ms	4948 KB	Output is correct
34	Correct	3 ms	4948 KB	Output is correct
35	Correct	3 ms	4948 KB	Output is correct
36	Correct	3 ms	4948 KB	Output is correct
37	Correct	4 ms	4948 KB	Output is correct
38	Correct	3 ms	5076 KB	Output is correct
39	Correct	4 ms	5076 KB	Output is correct
40	Correct	3 ms	5204 KB	Output is correct

Subtask #3
49.0 / 49.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	4948 KB	Output is correct
2	Correct	3 ms	4948 KB	Output is correct
3	Correct	3 ms	4948 KB	Output is correct
4	Correct	3 ms	4948 KB	Output is correct
5	Correct	3 ms	4948 KB	Output is correct
6	Correct	3 ms	4948 KB	Output is correct
7	Correct	3 ms	4948 KB	Output is correct
8	Correct	2 ms	4948 KB	Output is correct
9	Correct	2 ms	4948 KB	Output is correct
10	Correct	2 ms	4948 KB	Output is correct
11	Correct	3 ms	4948 KB	Output is correct
12	Correct	3 ms	4948 KB	Output is correct
13	Correct	3 ms	4948 KB	Output is correct
14	Correct	3 ms	4948 KB	Output is correct
15	Correct	2 ms	4948 KB	Output is correct
16	Correct	3 ms	4948 KB	Output is correct
17	Correct	2 ms	4948 KB	Output is correct
18	Correct	3 ms	4948 KB	Output is correct
19	Correct	2 ms	4948 KB	Output is correct
20	Correct	3 ms	4948 KB	Output is correct
21	Correct	3 ms	5204 KB	Output is correct
22	Correct	3 ms	4948 KB	Output is correct
23	Correct	3 ms	4948 KB	Output is correct
24	Correct	3 ms	4948 KB	Output is correct
25	Correct	3 ms	4948 KB	Output is correct
26	Correct	3 ms	4948 KB	Output is correct
27	Correct	3 ms	5024 KB	Output is correct
28	Correct	3 ms	4948 KB	Output is correct
29	Correct	3 ms	4948 KB	Output is correct
30	Correct	3 ms	5032 KB	Output is correct
31	Correct	3 ms	4948 KB	Output is correct
32	Correct	3 ms	4948 KB	Output is correct
33	Correct	3 ms	4948 KB	Output is correct
34	Correct	3 ms	4948 KB	Output is correct
35	Correct	3 ms	4948 KB	Output is correct
36	Correct	3 ms	4948 KB	Output is correct
37	Correct	4 ms	4948 KB	Output is correct
38	Correct	3 ms	5076 KB	Output is correct
39	Correct	4 ms	5076 KB	Output is correct
40	Correct	3 ms	5204 KB	Output is correct
41	Correct	39 ms	11076 KB	Output is correct
42	Correct	24 ms	7428 KB	Output is correct
43	Correct	24 ms	7328 KB	Output is correct
44	Correct	32 ms	7388 KB	Output is correct
45	Correct	27 ms	7380 KB	Output is correct
46	Correct	56 ms	9888 KB	Output is correct
47	Correct	70 ms	9908 KB	Output is correct
48	Correct	65 ms	9892 KB	Output is correct
49	Correct	72 ms	9928 KB	Output is correct
50	Correct	14 ms	6540 KB	Output is correct
51	Correct	14 ms	6536 KB	Output is correct
52	Correct	13 ms	6556 KB	Output is correct
53	Correct	24 ms	8076 KB	Output is correct
54	Correct	24 ms	8020 KB	Output is correct
55	Correct	24 ms	7940 KB	Output is correct
56	Correct	3 ms	5204 KB	Output is correct
57	Correct	7 ms	8148 KB	Output is correct
58	Correct	28 ms	19660 KB	Output is correct
59	Correct	60 ms	22860 KB	Output is correct
60	Correct	40 ms	11588 KB	Output is correct
61	Correct	47 ms	10224 KB	Output is correct

Submission #725757

Compilation message

Subtask #1 11.0 / 11.0

Subtask #2 40.0 / 40.0

Subtask #3 49.0 / 49.0

Subtask #1
11.0 / 11.0

Subtask #2
40.0 / 40.0

Subtask #3
49.0 / 49.0