Submission #481323

# Submission time Handle Problem Language Result Execution time Memory
481323 2021-10-20T11:41:36 Z DJeniUp Cat in a tree (BOI17_catinatree) C++17
51 / 100
92 ms 23996 KB
//#pragma GCC Optimize("O3")
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll>pairll;
typedef pair<ll,pairll>pairlll;
typedef pair<pairll,pairll>pairllll;
typedef long double ld;
typedef pair<ll,string>pairls;

#define INF 1000000000000007
#define MOD 1000000007
#define pb push_back
#define fr first
#define sc second
#define endl '\n'

ll n,m,t[1507][1507],res;

vector<ll>v[1507];

void S(ll x,ll y){

    for(int i=0;i<int(v[x].size());i++){
        if(v[x][i]!=y)S(v[x][i],x);
    }
    
    for(int i=m-1;i>=1;i--){
        if(i*2<m){
            t[x][i]=0;
            ll h=0;
            for(int j=0;j<int(v[x].size());j++){
                if(v[x][j]!=y)h+=t[v[x][j]][m-i-1];
            }
            for(int j=0;j<int(v[x].size());j++){
                if(v[x][j]!=y){
                    t[x][i]=max(t[x][i],h-t[v[x][j]][m-i-1]+t[v[x][j]][i-1]);
                }
            }
        }else{
            t[x][i]=0;
            for(int j=0;j<int(v[x].size());j++){
                if(v[x][j]!=y)t[x][i]+=t[v[x][j]][i-1];
            }
        }
        t[x][i]=max(t[x][i],t[x][i+1]);
    }
    t[x][0]=1;
    for(int i=0;i<int(v[x].size());i++){
        if(v[x][i]!=y)t[x][0]+=t[v[x][i]][m-1];
    }
    t[x][0]=max(t[x][0],t[x][1]);
    return ;
}

int main() {
    
    cin>>n>>m;
    m=min(n,m);
    for(int i=1;i<n;i++){
        ll l;
        cin>>l;
        v[l].pb(i);
        v[i].pb(l);
    }
    S(0,0);
    res=0;
    
    for(int i=0;i<m;i++){
        res=max(res,t[0][i]);
    }
    cout<<res<<endl;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 15 ms 18124 KB Output is correct
22 Correct 2 ms 2252 KB Output is correct
23 Correct 2 ms 2380 KB Output is correct
24 Correct 1 ms 2380 KB Output is correct
25 Correct 3 ms 4300 KB Output is correct
26 Correct 3 ms 4428 KB Output is correct
27 Correct 3 ms 4428 KB Output is correct
28 Correct 4 ms 6476 KB Output is correct
29 Correct 4 ms 6476 KB Output is correct
30 Correct 4 ms 6476 KB Output is correct
31 Correct 4 ms 6860 KB Output is correct
32 Correct 4 ms 6364 KB Output is correct
33 Correct 4 ms 6348 KB Output is correct
34 Correct 3 ms 6092 KB Output is correct
35 Correct 3 ms 6100 KB Output is correct
36 Correct 4 ms 6476 KB Output is correct
37 Correct 5 ms 6476 KB Output is correct
38 Correct 4 ms 6988 KB Output is correct
39 Correct 5 ms 7172 KB Output is correct
40 Correct 4 ms 6604 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 15 ms 18124 KB Output is correct
22 Correct 2 ms 2252 KB Output is correct
23 Correct 2 ms 2380 KB Output is correct
24 Correct 1 ms 2380 KB Output is correct
25 Correct 3 ms 4300 KB Output is correct
26 Correct 3 ms 4428 KB Output is correct
27 Correct 3 ms 4428 KB Output is correct
28 Correct 4 ms 6476 KB Output is correct
29 Correct 4 ms 6476 KB Output is correct
30 Correct 4 ms 6476 KB Output is correct
31 Correct 4 ms 6860 KB Output is correct
32 Correct 4 ms 6364 KB Output is correct
33 Correct 4 ms 6348 KB Output is correct
34 Correct 3 ms 6092 KB Output is correct
35 Correct 3 ms 6100 KB Output is correct
36 Correct 4 ms 6476 KB Output is correct
37 Correct 5 ms 6476 KB Output is correct
38 Correct 4 ms 6988 KB Output is correct
39 Correct 5 ms 7172 KB Output is correct
40 Correct 4 ms 6604 KB Output is correct
41 Runtime error 92 ms 23996 KB Execution killed with signal 11
42 Halted 0 ms 0 KB -