oj.uz

Submission #569072

# Submission time Handle Problem Language Result Execution time Memory
569072 2022-05-26T15:01:53 Z minhcool Cat in a tree (BOI17_catinatree) C++17
100 / 100
 103 ms 38456 KB 
#include<bits/stdc++.h>
using namespace std;

#define int long long
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define foru(i, l, r) for(int i = l; i <= r; i++)
#define ford(i, r, l) for(int i = r; i >= l; i--)

typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef pair<ii, ii> iiii;

const int N = 2e5 + 5;

const int oo = 1e18 + 7, mod = 1e9 + 7;

int n, d;

vector<int> Adj[N];

int dp[N];

ii small[N];

void dfs(int u){
	//cout << "OK " << u << "\n";
	for(auto v : Adj[u]){
		dfs(v);
		small[v].fi++, small[v].se++;
	}
	set<ii> se;
	for(auto v : Adj[u]){
		if(small[v].fi * 2 >= d){
			se.insert({small[v].fi, v});
		}
		else{
			se.insert({small[v].se, v});
		}
	}
	if(!se.size()){
		dp[u] = 1;
		small[u] = {0, oo};
		return;
	}
	int mx = -oo;
	for(auto v : Adj[u]){
		if(small[v].fi * 2 >= d){
			dp[u] += dp[v];
			continue;
		}
		dp[u] += (dp[v] - 1);
		if(small[v].fi * 2 >= d){
			se.erase({small[v].fi, v});
		}
		else{
			se.erase({small[v].se, v});
		}
		//cout << se.size() << "\n";
		//if(se.size()) cout << ((*se.begin())).fi << "\n";
		if(!se.size() || ((*se.begin()).fi + small[v].fi) >= d) mx = max(mx, small[v].fi);
		if(small[v].fi * 2 >= d){
			se.insert({small[v].fi, v});
		}
		else{
			se.insert({small[v].se, v});
		}
	}
	//cout << dp[u] << " " << mx << "\n";
	if(mx != -oo){
		dp[u]++;
		small[u] = {mx, (*se.begin()).fi};
	}
	else{
		small[u].fi = (*se.begin()).fi;
		se.erase(se.begin());
		if(se.size()) small[u].se = (*se.begin()).fi;
		else small[u].se = oo;
	}
	//cout << dp[u] << "\n";
	if(small[u].fi >= d){
		dp[u]++;
		small[u].fi = 0, small[u].se = d;
	}
	//cout << u << " " << dp[u] << " " << small[u].fi << " " << small[u].se << "\n";
}

void process(){
	cin >> n >> d;
	//cout << n << " " << d << "\n";
	for(int i = 2; i <= n; i++){
		int x;
		cin >> x;
		Adj[x + 1].pb(i);
		//cout << x << " " << i << "\n";
	}
	dfs(1);
	cout << dp[1];
}

signed main(){
	ios_base::sync_with_stdio(0);
	//freopen("cat.inp", "r", stdin);
	//freopen("cat.out", "w", stdout);
	process();
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 4 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 3 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 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 4968 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 3 ms 4948 KB Output is correct
16 Correct 3 ms 4948 KB Output is correct
17 Correct 3 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 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 4 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 3 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 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 4968 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 3 ms 4948 KB Output is correct
16 Correct 3 ms 4948 KB Output is correct
17 Correct 3 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 5460 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 2 ms 4948 KB Output is correct
24 Correct 4 ms 5024 KB Output is correct
25 Correct 4 ms 5024 KB Output is correct
26 Correct 3 ms 5076 KB Output is correct
27 Correct 4 ms 5028 KB Output is correct
28 Correct 5 ms 5076 KB Output is correct
29 Correct 4 ms 5076 KB Output is correct
30 Correct 5 ms 5076 KB Output is correct
31 Correct 3 ms 5076 KB Output is correct
32 Correct 4 ms 5076 KB Output is correct
33 Correct 3 ms 5076 KB Output is correct
34 Correct 3 ms 5076 KB Output is correct
35 Correct 3 ms 5076 KB Output is correct
36 Correct 3 ms 5076 KB Output is correct
37 Correct 3 ms 5076 KB Output is correct
38 Correct 3 ms 5076 KB Output is correct
39 Correct 3 ms 5160 KB Output is correct
40 Correct 4 ms 5460 KB Output is correct

Subtask #3
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 4 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 3 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 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 4968 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 3 ms 4948 KB Output is correct
16 Correct 3 ms 4948 KB Output is correct
17 Correct 3 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 5460 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 2 ms 4948 KB Output is correct
24 Correct 4 ms 5024 KB Output is correct
25 Correct 4 ms 5024 KB Output is correct
26 Correct 3 ms 5076 KB Output is correct
27 Correct 4 ms 5028 KB Output is correct
28 Correct 5 ms 5076 KB Output is correct
29 Correct 4 ms 5076 KB Output is correct
30 Correct 5 ms 5076 KB Output is correct
31 Correct 3 ms 5076 KB Output is correct
32 Correct 4 ms 5076 KB Output is correct
33 Correct 3 ms 5076 KB Output is correct
34 Correct 3 ms 5076 KB Output is correct
35 Correct 3 ms 5076 KB Output is correct
36 Correct 3 ms 5076 KB Output is correct
37 Correct 3 ms 5076 KB Output is correct
38 Correct 3 ms 5076 KB Output is correct
39 Correct 3 ms 5160 KB Output is correct
40 Correct 4 ms 5460 KB Output is correct
41 Correct 68 ms 17532 KB Output is correct
42 Correct 44 ms 9776 KB Output is correct
43 Correct 57 ms 9672 KB Output is correct
44 Correct 45 ms 9784 KB Output is correct
45 Correct 42 ms 9784 KB Output is correct
46 Correct 93 ms 14588 KB Output is correct
47 Correct 91 ms 14600 KB Output is correct
48 Correct 93 ms 14524 KB Output is correct
49 Correct 103 ms 14608 KB Output is correct
50 Correct 48 ms 8788 KB Output is correct
51 Correct 37 ms 8788 KB Output is correct
52 Correct 40 ms 8888 KB Output is correct
53 Correct 75 ms 12636 KB Output is correct
54 Correct 84 ms 12620 KB Output is correct
55 Correct 101 ms 12712 KB Output is correct
56 Correct 4 ms 5332 KB Output is correct
57 Correct 11 ms 10964 KB Output is correct
58 Correct 40 ms 31820 KB Output is correct
59 Correct 88 ms 38456 KB Output is correct
60 Correct 56 ms 17452 KB Output is correct
61 Correct 76 ms 14764 KB Output is correct