oj.uz

Submission #883419

# Submission time Handle Problem Language Result Execution time Memory
883419 2023-12-05T09:13:01 Z dimashhh Cat in a tree (BOI17_catinatree) C++17
51 / 100
 28 ms 17132 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1501,MOD = 1e9 + 7;

int n,d,dp[N][N];
vector<int> g[N];
void dfs(int v,int pr = -1){
    dp[v][0] = 1;
    for(int to:g[v]){
        if(to == pr) continue;
        dfs(to,v);
        dp[v][0] += dp[to][d - 1];
    }
    for(int dep = 1;dep <= n;dep++){
        if(d - dep - 1 < dep - 1){
            for(int to:g[v]){
                dp[v][dep] += dp[to][dep - 1];
            }
            continue;
        }
        int mx = 0;
        for(int to:g[v]){
            if(to == pr) continue;
            dp[v][dep] += dp[to][d - dep - 1];
            mx = max(mx,dp[to][dep - 1] - dp[to][d - dep -1 ]);
        }
        dp[v][dep] += mx;
    }
    for(int i = n - 1;i >= 0;i--){
        dp[v][i] = max(dp[v][i + 1],dp[v][i]);
        // cout << v << ' ' << dp[v][i] << '\n';
    }
}
void test(){
    cin >> n >> d;
    if(d > n) d = n;
    for(int i = 2;i <= n;i++){
        int x;
        cin >> x;
        ++x;
        g[x].push_back(i);
    }
    dfs(1);
    cout << dp[1][0];
}
main(){
    ios_base::sync_with_stdio(0);cin.tie(0);
    int T = 1;
    // cin >> T;
    while(T--)
        test();
}

Compilation message

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

Subtask #1
11.0 / 11.0

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

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 12 ms 9304 KB Output is correct
22 Correct 2 ms 4696 KB Output is correct
23 Correct 2 ms 4700 KB Output is correct
24 Correct 2 ms 4700 KB Output is correct
25 Correct 5 ms 6692 KB Output is correct
26 Correct 5 ms 6748 KB Output is correct
27 Correct 5 ms 6748 KB Output is correct
28 Correct 11 ms 9308 KB Output is correct
29 Correct 10 ms 9308 KB Output is correct
30 Correct 10 ms 9148 KB Output is correct
31 Correct 10 ms 9308 KB Output is correct
32 Correct 11 ms 9048 KB Output is correct
33 Correct 11 ms 9052 KB Output is correct
34 Correct 9 ms 8796 KB Output is correct
35 Correct 9 ms 8796 KB Output is correct
36 Correct 11 ms 9560 KB Output is correct
37 Correct 11 ms 9308 KB Output is correct
38 Correct 11 ms 9108 KB Output is correct
39 Correct 11 ms 9304 KB Output is correct
40 Correct 10 ms 9308 KB Output is correct

Subtask #3
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 12 ms 9304 KB Output is correct
22 Correct 2 ms 4696 KB Output is correct
23 Correct 2 ms 4700 KB Output is correct
24 Correct 2 ms 4700 KB Output is correct
25 Correct 5 ms 6692 KB Output is correct
26 Correct 5 ms 6748 KB Output is correct
27 Correct 5 ms 6748 KB Output is correct
28 Correct 11 ms 9308 KB Output is correct
29 Correct 10 ms 9308 KB Output is correct
30 Correct 10 ms 9148 KB Output is correct
31 Correct 10 ms 9308 KB Output is correct
32 Correct 11 ms 9048 KB Output is correct
33 Correct 11 ms 9052 KB Output is correct
34 Correct 9 ms 8796 KB Output is correct
35 Correct 9 ms 8796 KB Output is correct
36 Correct 11 ms 9560 KB Output is correct
37 Correct 11 ms 9308 KB Output is correct
38 Correct 11 ms 9108 KB Output is correct
39 Correct 11 ms 9304 KB Output is correct
40 Correct 10 ms 9308 KB Output is correct
41 Runtime error 28 ms 17132 KB Execution killed with signal 11
42 Halted 0 ms 0 KB -