Submission #881305

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
881305	2023-12-01T04:35:56 Z	12345678	Cat in a tree (BOI17_catinatree)	C++17	51 / 100	32 ms	23084 KB

catinatree

#include <bits/stdc++.h>

using namespace std;

const int nx=1505;
int n, x, k, dp[nx][nx];
vector<int> d[nx];

void dfs(int u, int p)
{
    dp[u][0]=1;
    for (auto v:d[u]) if (v!=p) dfs(v, u), dp[u][0]+=dp[v][k-1];
    for (int i=1; i<=k; i++)
    {
        if (k-i-1>=i-1)
        {
            int tmp=0;
            for (auto v:d[u]) if (v!=p) tmp+=dp[v][k-i-1];
            for (auto v:d[u]) if (v!=p) dp[u][i]=max(dp[u][i], tmp-dp[v][k-i-1]+dp[v][i-1]);
        }
        else for (auto v:d[u]) if (v!=p) dp[u][i]+=dp[v][i-1];
    }
    for (int i=k-1; i>=0; i--) dp[u][i]=max(dp[u][i], dp[u][i+1]);
}

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n>>k;
    for (int i=1; i<n; i++) cin>>x, d[i].push_back(x), d[x].push_back(i);
    dfs(0, 0);
    cout<<dp[0][0];
}

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	344 KB	Output is correct
4	Correct	1 ms	344 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	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	344 KB	Output is correct
10	Correct	0 ms	600 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	348 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	492 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	344 KB	Output is correct
4	Correct	1 ms	344 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	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	344 KB	Output is correct
10	Correct	0 ms	600 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	348 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	492 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	11 ms	9480 KB	Output is correct
22	Correct	1 ms	4696 KB	Output is correct
23	Correct	1 ms	4700 KB	Output is correct
24	Correct	1 ms	4700 KB	Output is correct
25	Correct	1 ms	6748 KB	Output is correct
26	Correct	2 ms	6748 KB	Output is correct
27	Correct	1 ms	6748 KB	Output is correct
28	Correct	2 ms	9052 KB	Output is correct
29	Correct	2 ms	9052 KB	Output is correct
30	Correct	2 ms	9052 KB	Output is correct
31	Correct	2 ms	9048 KB	Output is correct
32	Correct	1 ms	9052 KB	Output is correct
33	Correct	2 ms	9048 KB	Output is correct
34	Correct	1 ms	8796 KB	Output is correct
35	Correct	1 ms	8796 KB	Output is correct
36	Correct	2 ms	9052 KB	Output is correct
37	Correct	1 ms	9052 KB	Output is correct
38	Correct	2 ms	9052 KB	Output is correct
39	Correct	2 ms	9048 KB	Output is correct
40	Correct	2 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	344 KB	Output is correct
4	Correct	1 ms	344 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	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	344 KB	Output is correct
10	Correct	0 ms	600 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	348 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	492 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	11 ms	9480 KB	Output is correct
22	Correct	1 ms	4696 KB	Output is correct
23	Correct	1 ms	4700 KB	Output is correct
24	Correct	1 ms	4700 KB	Output is correct
25	Correct	1 ms	6748 KB	Output is correct
26	Correct	2 ms	6748 KB	Output is correct
27	Correct	1 ms	6748 KB	Output is correct
28	Correct	2 ms	9052 KB	Output is correct
29	Correct	2 ms	9052 KB	Output is correct
30	Correct	2 ms	9052 KB	Output is correct
31	Correct	2 ms	9048 KB	Output is correct
32	Correct	1 ms	9052 KB	Output is correct
33	Correct	2 ms	9048 KB	Output is correct
34	Correct	1 ms	8796 KB	Output is correct
35	Correct	1 ms	8796 KB	Output is correct
36	Correct	2 ms	9052 KB	Output is correct
37	Correct	1 ms	9052 KB	Output is correct
38	Correct	2 ms	9052 KB	Output is correct
39	Correct	2 ms	9048 KB	Output is correct
40	Correct	2 ms	9308 KB	Output is correct
41	Runtime error	32 ms	23084 KB	Execution killed with signal 11
42	Halted	0 ms	0 KB	-