oj.uz

Submission #937130

# Submission time Handle Problem Language Result Execution time Memory
937130 2024-03-03T14:01:40 Z lucri Cat in a tree (BOI17_catinatree) C++17
51 / 100
 52 ms 27052 KB 
#include <bits/stdc++.h>
using namespace std;
int pd[1510][1510],x,d,ans,n;
vector<vector<int>>a;
void calculeaza(int nod)
{
    int sum[1510],vmax[1510];
    for(int i=0;i<=d;++i)
    {
        sum[i]=0;
        vmax[i]=0;
    }
    for(auto x:a[nod])
    {
        calculeaza(x);
        for(int i=0;i<=d;++i)
        {
            sum[i]+=pd[x][i];
            if(i+2<=d)
                vmax[i]=max(vmax[i],pd[x][i]-pd[x][d-i-2]);
        }
    }
    pd[nod][d+1]=sum[d];
    for(int i=d;i>=d/2+1;--i)
    {
        pd[nod][i]=sum[i-1];
        pd[nod][i]=max(pd[nod][i],pd[nod][i+1]);
    }
    for(int i=d/2;i>=1;--i)
    {
        pd[nod][i]=vmax[i-1]+sum[d-i-1];
        pd[nod][i]=max(pd[nod][i],pd[nod][i+1]);
    }
    pd[nod][0]=1+sum[d-1];
    pd[nod][0]=max(pd[nod][0],pd[nod][1]);
}
int main()
{
    cin>>n>>d;
    a.resize(n+5);
    for(int i=1;i<n;++i)
    {
        cin>>x;
        a[x].push_back(i);
    }
    calculeaza(0);
    for(int i=0;i<=d;++i)
        ans=max(ans,pd[0][i]);
    cout<<ans;
    return 0;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 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 1 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 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 440 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 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 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 1 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 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 440 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 21 ms 27052 KB Output is correct
22 Correct 1 ms 4700 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 1 ms 6748 KB Output is correct
27 Correct 2 ms 6748 KB Output is correct
28 Correct 2 ms 9304 KB Output is correct
29 Correct 2 ms 9308 KB Output is correct
30 Correct 2 ms 9308 KB Output is correct
31 Correct 3 ms 9128 KB Output is correct
32 Correct 2 ms 9052 KB Output is correct
33 Correct 2 ms 9052 KB Output is correct
34 Correct 2 ms 8796 KB Output is correct
35 Correct 2 ms 8796 KB Output is correct
36 Correct 2 ms 9052 KB Output is correct
37 Correct 3 ms 10332 KB Output is correct
38 Correct 4 ms 12636 KB Output is correct
39 Correct 5 ms 15064 KB Output is correct
40 Correct 11 ms 26972 KB Output is correct

Subtask #3
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 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 1 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 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 440 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 21 ms 27052 KB Output is correct
22 Correct 1 ms 4700 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 1 ms 6748 KB Output is correct
27 Correct 2 ms 6748 KB Output is correct
28 Correct 2 ms 9304 KB Output is correct
29 Correct 2 ms 9308 KB Output is correct
30 Correct 2 ms 9308 KB Output is correct
31 Correct 3 ms 9128 KB Output is correct
32 Correct 2 ms 9052 KB Output is correct
33 Correct 2 ms 9052 KB Output is correct
34 Correct 2 ms 8796 KB Output is correct
35 Correct 2 ms 8796 KB Output is correct
36 Correct 2 ms 9052 KB Output is correct
37 Correct 3 ms 10332 KB Output is correct
38 Correct 4 ms 12636 KB Output is correct
39 Correct 5 ms 15064 KB Output is correct
40 Correct 11 ms 26972 KB Output is correct
41 Runtime error 52 ms 18128 KB Execution killed with signal 11
42 Halted 0 ms 0 KB -