oj.uz

Submission #746776

# Submission time Handle Problem Language Result Execution time Memory
746776 2023-05-23T05:09:06 Z GrindMachine Cat in a tree (BOI17_catinatree) C++17
51 / 100
 40 ms 35788 KB 
// Om Namah Shivaya

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a, b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a, b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*

stress tested with:
https://oj.uz/submission/739417

*/

const int MOD = 1e9 + 7;
const int N = 1500 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

vector<ll> adj[N];
ll n,d;
ll dp[N][N][2]; // dp[u][j][0/1] = max #of nodes that can be picked in the subtree of u satisfying the condition if the depth of the closest node to u in the subtree is j and 3rd state represents if any guy with depth = j is taken or not

void dfs(ll u, ll p){
    dp[u][0][1] = 1;

    trav(v,adj[u]){
        dfs(v, u);

        vector<ll> suff(n+5);
        rev(j,n,0){
            suff[j+1] = dp[v][j][1];    
        }
        rev(j,n,0){
            amax(suff[j], suff[j+1]);
        }

        rep(j,n+1){
            ll val = -inf2;
            if(j-1 >= 0){
                val = dp[u][j][0] + dp[v][j-1][1];
            }

            ll mnj = max(d-j, (ll) j);

            dp[u][j][0] += suff[mnj];
            dp[u][j][1] += suff[mnj];

            amax(dp[u][j][1], val);
        }
    }
}

void solve(int test_case)
{
    cin >> n >> d;
    amin(d,n+1);

    rep1(i,n-1){
        ll p; cin >> p;
        adj[p].pb(i);
    }

    dfs(0,-1);
    
    // rep(i,n){
    //     rep(j,n+1){
    //         cout << dp[i][j][1] << " ";
    //     }
    //     cout << endl;
    // }

    // cout << endl;

    ll ans = 0;

    rep(j,n+1){
        amax(ans,dp[0][j][1]);
    }

    cout << ans << endl;
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 360 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 368 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 368 KB Output is correct
9 Correct 1 ms 424 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 360 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 36 ms 35720 KB Output is correct
22 Correct 4 ms 4180 KB Output is correct
23 Correct 5 ms 4332 KB Output is correct
24 Correct 5 ms 4276 KB Output is correct
25 Correct 16 ms 12244 KB Output is correct
26 Correct 15 ms 12292 KB Output is correct
27 Correct 16 ms 12244 KB Output is correct
28 Correct 40 ms 20948 KB Output is correct
29 Correct 33 ms 21992 KB Output is correct
30 Correct 32 ms 21088 KB Output is correct
31 Correct 31 ms 20632 KB Output is correct
32 Correct 22 ms 6740 KB Output is correct
33 Correct 21 ms 6676 KB Output is correct
34 Correct 20 ms 7888 KB Output is correct
35 Correct 22 ms 7932 KB Output is correct
36 Correct 23 ms 8336 KB Output is correct
37 Correct 22 ms 8432 KB Output is correct
38 Correct 24 ms 12264 KB Output is correct
39 Correct 26 ms 16204 KB Output is correct
40 Correct 33 ms 35788 KB Output is correct

Subtask #3
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 360 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 368 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 368 KB Output is correct
9 Correct 1 ms 424 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 360 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 36 ms 35720 KB Output is correct
22 Correct 4 ms 4180 KB Output is correct
23 Correct 5 ms 4332 KB Output is correct
24 Correct 5 ms 4276 KB Output is correct
25 Correct 16 ms 12244 KB Output is correct
26 Correct 15 ms 12292 KB Output is correct
27 Correct 16 ms 12244 KB Output is correct
28 Correct 40 ms 20948 KB Output is correct
29 Correct 33 ms 21992 KB Output is correct
30 Correct 32 ms 21088 KB Output is correct
31 Correct 31 ms 20632 KB Output is correct
32 Correct 22 ms 6740 KB Output is correct
33 Correct 21 ms 6676 KB Output is correct
34 Correct 20 ms 7888 KB Output is correct
35 Correct 22 ms 7932 KB Output is correct
36 Correct 23 ms 8336 KB Output is correct
37 Correct 22 ms 8432 KB Output is correct
38 Correct 24 ms 12264 KB Output is correct
39 Correct 26 ms 16204 KB Output is correct
40 Correct 33 ms 35788 KB Output is correct
41 Runtime error 2 ms 596 KB Execution killed with signal 11
42 Halted 0 ms 0 KB -