oj.uz

Submission #964007

# Submission time Handle Problem Language Result Execution time Memory
964007 2024-04-16T07:39:37 Z batsukh2006 Cat in a tree (BOI17_catinatree) C++17
100 / 100
 106 ms 32584 KB 
#include<iostream>
#include<stdio.h>
#include<math.h>
#include<map>
#include<string>
#include<algorithm>
#include<vector>
#include<string.h>
#include<utility>
#include<set>
#include<cmath>
#include<queue>
#include<deque>
#include<functional>
#include<stack>
#include<limits.h>
#include<iomanip>
#include<unordered_map> 
#include<numeric>
#include<tuple>
#include<bitset>
using namespace std;
 
#define MOD 1000000007
#define int long long
#define ss second
#define ff first
#define endl '\n'
int n,d;
const int mxN=2e5+1;
vector<int> v[mxN];
vector<vector<int> > dp(mxN,vector<int>(2));
void dfs(int a, int p){
	int mx=1e9,cnt=0;
	for(auto node: v[a]){
		if(node!=p){
			dfs(node,a);
			if(mx+dp[node][1]>=d){
				cnt=cnt+dp[node][0];
				mx=min(mx,dp[node][1]);
			}else{
				cnt=cnt+dp[node][0]-1;
				mx=max(mx,dp[node][1]);
			}
		}
	}
	if(mx>=d){
		dp[a][1]=1;
		dp[a][0]=cnt+1;
	}else{
		dp[a][0]=cnt;
		dp[a][1]=mx+1;
	}
}
void solve(){
	cin>>n>>d;
	for(int i=1; i<n; i++){
		int a; cin>>a;
		v[a].push_back(i);
		v[i].push_back(a);
	}
	dfs(0,0);
	cout<<dp[0][0];
}
signed main(){
    // freopen("file.in", "r", stdin);
    // freopen("file.out", "w", stdout);
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    
    int T=1;
    // cin>>T;
    while(T--){
        solve();
        cout<<endl;
    }
    return 0;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 15960 KB Output is correct
2 Correct 13 ms 15964 KB Output is correct
3 Correct 13 ms 16124 KB Output is correct
4 Correct 12 ms 15964 KB Output is correct
5 Correct 12 ms 15964 KB Output is correct
6 Correct 12 ms 15964 KB Output is correct
7 Correct 13 ms 15964 KB Output is correct
8 Correct 12 ms 15964 KB Output is correct
9 Correct 12 ms 15964 KB Output is correct
10 Correct 12 ms 15964 KB Output is correct
11 Correct 13 ms 15964 KB Output is correct
12 Correct 12 ms 15960 KB Output is correct
13 Correct 15 ms 15964 KB Output is correct
14 Correct 12 ms 15964 KB Output is correct
15 Correct 12 ms 15960 KB Output is correct
16 Correct 13 ms 15964 KB Output is correct
17 Correct 13 ms 15960 KB Output is correct
18 Correct 13 ms 16200 KB Output is correct
19 Correct 12 ms 15960 KB Output is correct
20 Correct 12 ms 15964 KB Output is correct
21 Correct 20 ms 16220 KB Output is correct
22 Correct 13 ms 15964 KB Output is correct
23 Correct 13 ms 15964 KB Output is correct
24 Correct 13 ms 15964 KB Output is correct
25 Correct 13 ms 15964 KB Output is correct
26 Correct 12 ms 15964 KB Output is correct
27 Correct 12 ms 15964 KB Output is correct
28 Correct 13 ms 15960 KB Output is correct
29 Correct 13 ms 16080 KB Output is correct
30 Correct 12 ms 15972 KB Output is correct
31 Correct 16 ms 15964 KB Output is correct
32 Correct 12 ms 15964 KB Output is correct
33 Correct 13 ms 15960 KB Output is correct
34 Correct 13 ms 16128 KB Output is correct
35 Correct 14 ms 16140 KB Output is correct
36 Correct 12 ms 15960 KB Output is correct
37 Correct 12 ms 15960 KB Output is correct
38 Correct 13 ms 15964 KB Output is correct
39 Correct 17 ms 16216 KB Output is correct
40 Correct 15 ms 16228 KB Output is correct

Subtask #3
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 15960 KB Output is correct
2 Correct 13 ms 15964 KB Output is correct
3 Correct 13 ms 16124 KB Output is correct
4 Correct 12 ms 15964 KB Output is correct
5 Correct 12 ms 15964 KB Output is correct
6 Correct 12 ms 15964 KB Output is correct
7 Correct 13 ms 15964 KB Output is correct
8 Correct 12 ms 15964 KB Output is correct
9 Correct 12 ms 15964 KB Output is correct
10 Correct 12 ms 15964 KB Output is correct
11 Correct 13 ms 15964 KB Output is correct
12 Correct 12 ms 15960 KB Output is correct
13 Correct 15 ms 15964 KB Output is correct
14 Correct 12 ms 15964 KB Output is correct
15 Correct 12 ms 15960 KB Output is correct
16 Correct 13 ms 15964 KB Output is correct
17 Correct 13 ms 15960 KB Output is correct
18 Correct 13 ms 16200 KB Output is correct
19 Correct 12 ms 15960 KB Output is correct
20 Correct 12 ms 15964 KB Output is correct
21 Correct 20 ms 16220 KB Output is correct
22 Correct 13 ms 15964 KB Output is correct
23 Correct 13 ms 15964 KB Output is correct
24 Correct 13 ms 15964 KB Output is correct
25 Correct 13 ms 15964 KB Output is correct
26 Correct 12 ms 15964 KB Output is correct
27 Correct 12 ms 15964 KB Output is correct
28 Correct 13 ms 15960 KB Output is correct
29 Correct 13 ms 16080 KB Output is correct
30 Correct 12 ms 15972 KB Output is correct
31 Correct 16 ms 15964 KB Output is correct
32 Correct 12 ms 15964 KB Output is correct
33 Correct 13 ms 15960 KB Output is correct
34 Correct 13 ms 16128 KB Output is correct
35 Correct 14 ms 16140 KB Output is correct
36 Correct 12 ms 15960 KB Output is correct
37 Correct 12 ms 15960 KB Output is correct
38 Correct 13 ms 15964 KB Output is correct
39 Correct 17 ms 16216 KB Output is correct
40 Correct 15 ms 16228 KB Output is correct
41 Correct 48 ms 23636 KB Output is correct
42 Correct 35 ms 20304 KB Output is correct
43 Correct 35 ms 20304 KB Output is correct
44 Correct 35 ms 20312 KB Output is correct
45 Correct 37 ms 20392 KB Output is correct
46 Correct 73 ms 24664 KB Output is correct
47 Correct 106 ms 24652 KB Output is correct
48 Correct 71 ms 24556 KB Output is correct
49 Correct 81 ms 24628 KB Output is correct
50 Correct 30 ms 20556 KB Output is correct
51 Correct 27 ms 20496 KB Output is correct
52 Correct 31 ms 20560 KB Output is correct
53 Correct 56 ms 25204 KB Output is correct
54 Correct 54 ms 25180 KB Output is correct
55 Correct 57 ms 25204 KB Output is correct
56 Correct 13 ms 16220 KB Output is correct
57 Correct 18 ms 18312 KB Output is correct
58 Correct 39 ms 26960 KB Output is correct
59 Correct 62 ms 32584 KB Output is correct
60 Correct 45 ms 23756 KB Output is correct
61 Correct 52 ms 24012 KB Output is correct