oj.uz

Submission #756160

# Submission time Handle Problem Language Result Execution time Memory
756160 2023-06-11T08:42:30 Z badont Cat in a tree (BOI17_catinatree) C++17
100 / 100
 280 ms 41948 KB 
#include<bits/stdc++.h>
using namespace std;
 
void dbg_out() { cout << endl; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cout << ' ' << H; dbg_out(T...); }
 
#ifdef LOCAL
#define debug(...) cout << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#else
#define debug(...) "zzz"
#endif
 
using ll = long long;
using ld = long double;
using pii = pair<ll,ll>;
 
#define FOR(i, n) for(int i = 1; i<=n; i++)
#define F0R(i, n) for(int i = 0; i<n; i++)
#define all(x) x.begin(), x.end()
#define mp make_pair
#define pb push_back
#define f first
#define s second
 
template<typename T, typename = void> struct is_iterable : false_type {};
template<typename T> struct is_iterable<T, void_t<decltype(begin(declval<T>())),decltype(end(declval<T>()))>> : true_type {};
template<typename T> typename enable_if<is_iterable<T>::value&&!is_same<T, string>::value,ostream&>::type operator<<(ostream &cout, T const &v);
template<typename A, typename B> ostream& operator<<(ostream &cout, pair<A, B> const &p) { return cout << "(" << p.f << ", " << p.s << ")"; }
template<typename T> typename enable_if<is_iterable<T>::value&&!is_same<T, string>::value,ostream&>::type operator<<(ostream &cout, T const &v) {
	cout << "["; 
	for (auto it = v.begin(); it != v.end();) {
		cout << *it;
		if (++it != v.end()) cout << ", ";
	}
	return cout << "]";
}
 
//var 
ll T;
 
vector<ll> depth;
struct cmp {
	bool operator()(const ll& a, const ll& b) const {
		if (depth[a] == depth[b]) return a < b;
		return depth[a] > depth[b];
	};
};
 
void solve() {
	ll n, d; cin >> n >> d;
 
	vector e(n, vector<ll>());
	for (int i = 1; i < n; i++) {
		ll p; cin >> p;
		e[i].pb(p);
		e[p].pb(i);
	}
 
	depth.resize(n);
	auto dfs_depth = [&](auto& dfs, ll g, ll p, ll d) -> void {
		depth[g] = d;
		for (const auto& u : e[g]) if (u != p) {
			dfs(dfs, u, g, d + 1);
		}
	};
	dfs_depth(dfs_depth, 0, -1, 0);
	using Info = set<ll, cmp>;
 
	auto dfs = [&](auto& dfs, ll g, ll p) -> Info {
		Info ret;
		ret.insert(g);
		for (auto u : e[g]) if (u != p) { 
			Info o = dfs(dfs, u, g);
 
			if (o.size() > ret.size()) {
				swap(o, ret);
			}
 
			auto last = [](const auto& st) -> ll {
				return *prev(st.end());
			};
 
			ll need_at_least = 2LL * depth[g] + d;
			for (auto x : o) {
				while (!ret.empty() and 
					depth[last(ret)] + depth[x] < need_at_least and
					depth[last(ret)] < depth[x]) {
					ret.erase(last(ret));
				}
				if (ret.empty() or depth[last(ret)] + depth[x] >= need_at_least) {
					ret.insert(x);
				}
			}
			o.clear();
		}
		return ret;
	};
 
	Info ret = dfs(dfs, 0, -1);
	cout << ret.size() << "\n";
	/*
	for (const auto& u : ret)
		cout << u + 1 << " ";
	cout << "\n";
	*/
}
 
int main() {
	ios_base::sync_with_stdio(0); 
	cin.tie(0);
 
	T = 1;
	//cin >> T;
	FOR(t, T)
		solve();
 
	cout.flush();
	return 0;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
40.0 / 40.0

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

Subtask #3
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 316 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 324 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 2 ms 724 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 320 KB Output is correct
25 Correct 1 ms 316 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 316 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 320 KB Output is correct
36 Correct 2 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 448 KB Output is correct
39 Correct 1 ms 468 KB Output is correct
40 Correct 1 ms 724 KB Output is correct
41 Correct 76 ms 16236 KB Output is correct
42 Correct 140 ms 12972 KB Output is correct
43 Correct 62 ms 7736 KB Output is correct
44 Correct 66 ms 7756 KB Output is correct
45 Correct 48 ms 7728 KB Output is correct
46 Correct 280 ms 21736 KB Output is correct
47 Correct 156 ms 15224 KB Output is correct
48 Correct 144 ms 15232 KB Output is correct
49 Correct 114 ms 15220 KB Output is correct
50 Correct 40 ms 8072 KB Output is correct
51 Correct 45 ms 8140 KB Output is correct
52 Correct 46 ms 8004 KB Output is correct
53 Correct 78 ms 15592 KB Output is correct
54 Correct 78 ms 15552 KB Output is correct
55 Correct 87 ms 15580 KB Output is correct
56 Correct 1 ms 724 KB Output is correct
57 Correct 9 ms 7124 KB Output is correct
58 Correct 43 ms 31220 KB Output is correct
59 Correct 130 ms 41948 KB Output is correct
60 Correct 82 ms 16076 KB Output is correct
61 Correct 97 ms 14204 KB Output is correct