oj.uz

Submission #892905

# Submission time Handle Problem Language Result Execution time Memory
892905 2023-12-26T07:00:09 Z LCJLY Cat in a tree (BOI17_catinatree) C++14
100 / 100
 84 ms 31588 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define ld long double
#define show(x,y) cout << y << " " << #x << endl;
#define show2(x,y,i,j) cout << y << " " << #x << "  " << j << " " << #i << endl;
#define show3(x,y,i,j,p,q) cout << y << " " << #x << "  " << j << " " << #i << "  " << q << " " << #p << endl; 
#define show4(x,y) for(auto it:x) cout << it << " "; cout << #y << endl;
typedef pair<int,int>pii;
typedef pair<pii,pii>pi2;

int n,k;
vector<int>adj[200005];
int dp[200005];
int d[200005];
int storage[2000005];

void dfs(int index, int par){
	int next=INT_MAX;
	int counter=0;
	vector<int>v;
	for(auto it:adj[index]){
		if(it==par) continue;
		d[it]=d[index]+1;
		dfs(it,index);
		next=min(next,storage[it]-d[index]);
		counter+=dp[it];
		v.push_back(storage[it]);
	}
	
	sort(v.begin(),v.end(),greater<>());
	while(v.size()>=2&&v[v.size()-1]+v[v.size()-2]-2*d[index]<k){
		v.pop_back();
		counter--;
	}
	
	if(next>=k){
		storage[index]=d[index];
		counter++;
	}
	else{
		storage[index]=v.back();
	}
	
	dp[index]=counter;
}

void solve(){	
	cin >> n >> k;
	
	int temp;
	for(int x=1;x<n;x++){
		cin >> temp;
		adj[x].push_back(temp);
		adj[temp].push_back(x);
	}
	
	dfs(1,-1);
	
	int best=0;
	for(int x=0;x<n;x++){
		best=max(best,dp[x]);
	}
	
	cout << best;
	
	
}

int32_t main(){										
	ios::sync_with_stdio(0);	
	cin.tie(0);
	//freopen("in.txt", "r", stdin);
	int t=1;
	//cin >> t;
	while(t--){
		solve();
	}	
}

Subtask #1
11.0 / 11.0

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

Subtask #2
40.0 / 40.0

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

Subtask #3
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 7256 KB Output is correct
2 Correct 2 ms 7260 KB Output is correct
3 Correct 1 ms 7260 KB Output is correct
4 Correct 2 ms 7260 KB Output is correct
5 Correct 2 ms 7260 KB Output is correct
6 Correct 1 ms 7260 KB Output is correct
7 Correct 2 ms 7260 KB Output is correct
8 Correct 2 ms 7260 KB Output is correct
9 Correct 1 ms 7260 KB Output is correct
10 Correct 2 ms 7260 KB Output is correct
11 Correct 2 ms 7260 KB Output is correct
12 Correct 2 ms 7260 KB Output is correct
13 Correct 2 ms 7260 KB Output is correct
14 Correct 2 ms 7260 KB Output is correct
15 Correct 2 ms 7260 KB Output is correct
16 Correct 2 ms 7260 KB Output is correct
17 Correct 2 ms 7344 KB Output is correct
18 Correct 2 ms 7260 KB Output is correct
19 Correct 2 ms 7260 KB Output is correct
20 Correct 2 ms 7508 KB Output is correct
21 Correct 2 ms 7516 KB Output is correct
22 Correct 2 ms 7260 KB Output is correct
23 Correct 2 ms 7260 KB Output is correct
24 Correct 2 ms 7260 KB Output is correct
25 Correct 2 ms 7260 KB Output is correct
26 Correct 2 ms 7256 KB Output is correct
27 Correct 2 ms 7260 KB Output is correct
28 Correct 2 ms 7260 KB Output is correct
29 Correct 2 ms 7352 KB Output is correct
30 Correct 2 ms 7352 KB Output is correct
31 Correct 2 ms 7512 KB Output is correct
32 Correct 2 ms 7260 KB Output is correct
33 Correct 2 ms 7260 KB Output is correct
34 Correct 2 ms 7260 KB Output is correct
35 Correct 2 ms 7260 KB Output is correct
36 Correct 2 ms 7260 KB Output is correct
37 Correct 2 ms 7256 KB Output is correct
38 Correct 2 ms 7260 KB Output is correct
39 Correct 2 ms 7260 KB Output is correct
40 Correct 2 ms 7516 KB Output is correct
41 Correct 36 ms 18592 KB Output is correct
42 Correct 22 ms 14428 KB Output is correct
43 Correct 30 ms 14480 KB Output is correct
44 Correct 31 ms 14476 KB Output is correct
45 Correct 26 ms 14428 KB Output is correct
46 Correct 72 ms 19104 KB Output is correct
47 Correct 72 ms 19144 KB Output is correct
48 Correct 60 ms 18976 KB Output is correct
49 Correct 67 ms 19152 KB Output is correct
50 Correct 16 ms 14940 KB Output is correct
51 Correct 16 ms 14684 KB Output is correct
52 Correct 18 ms 14812 KB Output is correct
53 Correct 50 ms 19604 KB Output is correct
54 Correct 35 ms 19536 KB Output is correct
55 Correct 36 ms 19548 KB Output is correct
56 Correct 2 ms 7516 KB Output is correct
57 Correct 7 ms 10804 KB Output is correct
58 Correct 27 ms 25436 KB Output is correct
59 Correct 84 ms 31588 KB Output is correct
60 Correct 52 ms 18952 KB Output is correct
61 Correct 42 ms 18260 KB Output is correct