oj.uz

Submission #237356

# Submission time Handle Problem Language Result Execution time Memory
237356 2020-06-06T05:19:15 Z IgorI Cat in a tree (BOI17_catinatree) C++17
100 / 100
 493 ms 221944 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int N = 200000;
const int K = 800;

int n, d;
int dp[N][N / K + 5];
int p[N];
vector<int> graph[N];

void dfs1(int v)
{
    for (auto u : graph[v]) dfs1(u);
    dp[v][0] = 1;
    for (auto u : graph[v]) dp[v][0] += dp[u][d - 1];
    for (int j = d; j > 0; j--)
    {
        if (2 * j >= d)
        {
            for (auto u : graph[v])
            {
                dp[v][j] += dp[u][j - 1];
            }
        }
        else
        {
            dp[v][j] = dp[v][d - j];
            int r = 0;
            for (auto u : graph[v])
            {
                r = max(r, dp[u][j - 1] - dp[u][d - j - 1]);
            }
            dp[v][j] += r;
        }
    }
    for (int j = d - 1; j >= 0; j--) dp[v][j] = max(dp[v][j], dp[v][j + 1]);
}

int max_place[N];

void dfs2(int v)
{
    for (auto u : graph[v]) dfs2(u);
    // dp[v][k] - nearest to v if placed k
    dp[v][0] = 1e9;
    vector<int> Up;
    for (auto u : graph[v])
    {
        for (int i = 1; dp[u][i] != -1; i++)
        {
            Up.push_back(min(d, dp[u][i] + 1));
        }
    }
    sort(Up.begin(), Up.end());
    reverse(Up.begin(), Up.end());
    int lka = 1e9, rka = 0;
    for (int i = 0; i < Up.size(); i++)
    {
        if (Up[i] * 2 >= d)
        {
            lka = min(lka, i + 1);
            //cout << "set " << i + 1 << " " << Up[i] << endl;
            dp[v][i + 1] = Up[i];
            rka = max(rka, i + 1);
        }
    }
    for (int i = rka - 1; i >= 0; i--) dp[v][i] = max(dp[v][i], dp[v][i + 1]);
    /*for (auto u : graph[v])
    {
        for (int i = 0; dp[u][i] != -1; i++)
        {
            int d1 = dp[u][i] + 1;
            int d2 = max(d1, d - d1);
            int L = lka - 1, R = rka;
            while (L + 1 < R)
            {
                int M = (L + R) / 2;
                if (dp[v][M] >= d2) L = M;
                else R = M;
            }
            if (L == lka - 1)
                L = 0;
            int will_have = L + i;
            for (int j = 0; dp[u][j] != 1; j++)
            {
                if (dp[u][j] >= d2)
                {
                    will_have -= j;
                    cout << "TAPOK ! " << j << endl;
                    break;
                }
            }
            dp[v][will_have] = max(dp[v][will_have], d1);
        }
    }*/

    for (auto u : graph[v])
    {
        for (int i = 1; dp[u][i] != -1; i++)
        {
            int d1 = dp[u][i] + 1;
            int d2 = max(d1, d - d1) - 1;
            int will_have = i;
            for (auto w : graph[v]) if (w != u)
            {
                for (int j = 1; dp[w][j] != -1; j++)
                {
                    if (dp[w][j] >= d2)
                    {
                        will_have++;
                    }
                }
            }
            //cout << u << " " << i << " " << d1 << " " << d2 << " " << will_have << endl;
            //cout << u << "->" << i << " " << will_have << endl;
            dp[v][will_have] = max(dp[v][will_have], d1);
        }
    }

    for (int i = 0; dp[v][i] != -1; i++)
    {
        max_place[v] = i;
        if (dp[v][i] >= d && dp[v][i + 1] == -1)
        {
            dp[v][i + 1] = 0;
        }
    }
    /*cout << v << ": ";
    for (int i = 0; dp[v][i] != -1; i++)
    {
        cout << dp[v][i] << " ";
    }
    cout << endl;*/
}

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin >> n >> d;
    if (d == 1) cout << n, exit(0);
    for (int i = 1; i < n; i++)
    {
        cin >> p[i];
        graph[p[i]].push_back(i);
    }
    if (d < K)
    {
        dfs1(0);
        cout << dp[0][0] << endl;
    }
    else
    {
        for (int i = 0; i < N; i++) for (int j = 0; j < N / K + 5; j++) dp[i][j] = -1;
        dfs2(0);
        cout << max_place[0] << endl;
    }
}

Compilation message

catinatree.cpp: In function 'void dfs2(int)':
catinatree.cpp:61:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < Up.size(); i++)
                     ~~^~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4992 KB Output is correct
2 Correct 7 ms 5120 KB Output is correct
3 Correct 7 ms 4992 KB Output is correct
4 Correct 7 ms 4992 KB Output is correct
5 Correct 7 ms 5096 KB Output is correct
6 Correct 7 ms 4992 KB Output is correct
7 Correct 7 ms 4992 KB Output is correct
8 Correct 7 ms 4992 KB Output is correct
9 Correct 7 ms 4992 KB Output is correct
10 Correct 7 ms 4992 KB Output is correct
11 Correct 7 ms 4992 KB Output is correct
12 Correct 7 ms 4992 KB Output is correct
13 Correct 7 ms 4992 KB Output is correct
14 Correct 8 ms 5120 KB Output is correct
15 Correct 7 ms 4992 KB Output is correct
16 Correct 7 ms 4992 KB Output is correct
17 Correct 7 ms 4992 KB Output is correct
18 Correct 7 ms 4992 KB Output is correct
19 Correct 7 ms 5120 KB Output is correct
20 Correct 7 ms 4992 KB Output is correct
21 Correct 122 ms 204896 KB Output is correct
22 Correct 7 ms 4992 KB Output is correct
23 Correct 7 ms 5504 KB Output is correct
24 Correct 7 ms 5504 KB Output is correct
25 Correct 7 ms 4992 KB Output is correct
26 Correct 8 ms 6016 KB Output is correct
27 Correct 8 ms 6144 KB Output is correct
28 Correct 8 ms 6528 KB Output is correct
29 Correct 8 ms 6528 KB Output is correct
30 Correct 8 ms 6528 KB Output is correct
31 Correct 9 ms 6528 KB Output is correct
32 Correct 8 ms 6528 KB Output is correct
33 Correct 9 ms 6528 KB Output is correct
34 Correct 9 ms 6400 KB Output is correct
35 Correct 9 ms 6400 KB Output is correct
36 Correct 9 ms 6528 KB Output is correct
37 Correct 9 ms 6528 KB Output is correct
38 Correct 9 ms 6656 KB Output is correct
39 Correct 9 ms 6656 KB Output is correct
40 Correct 8 ms 6784 KB Output is correct

Subtask #3
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4992 KB Output is correct
2 Correct 7 ms 5120 KB Output is correct
3 Correct 7 ms 4992 KB Output is correct
4 Correct 7 ms 4992 KB Output is correct
5 Correct 7 ms 5096 KB Output is correct
6 Correct 7 ms 4992 KB Output is correct
7 Correct 7 ms 4992 KB Output is correct
8 Correct 7 ms 4992 KB Output is correct
9 Correct 7 ms 4992 KB Output is correct
10 Correct 7 ms 4992 KB Output is correct
11 Correct 7 ms 4992 KB Output is correct
12 Correct 7 ms 4992 KB Output is correct
13 Correct 7 ms 4992 KB Output is correct
14 Correct 8 ms 5120 KB Output is correct
15 Correct 7 ms 4992 KB Output is correct
16 Correct 7 ms 4992 KB Output is correct
17 Correct 7 ms 4992 KB Output is correct
18 Correct 7 ms 4992 KB Output is correct
19 Correct 7 ms 5120 KB Output is correct
20 Correct 7 ms 4992 KB Output is correct
21 Correct 122 ms 204896 KB Output is correct
22 Correct 7 ms 4992 KB Output is correct
23 Correct 7 ms 5504 KB Output is correct
24 Correct 7 ms 5504 KB Output is correct
25 Correct 7 ms 4992 KB Output is correct
26 Correct 8 ms 6016 KB Output is correct
27 Correct 8 ms 6144 KB Output is correct
28 Correct 8 ms 6528 KB Output is correct
29 Correct 8 ms 6528 KB Output is correct
30 Correct 8 ms 6528 KB Output is correct
31 Correct 9 ms 6528 KB Output is correct
32 Correct 8 ms 6528 KB Output is correct
33 Correct 9 ms 6528 KB Output is correct
34 Correct 9 ms 6400 KB Output is correct
35 Correct 9 ms 6400 KB Output is correct
36 Correct 9 ms 6528 KB Output is correct
37 Correct 9 ms 6528 KB Output is correct
38 Correct 9 ms 6656 KB Output is correct
39 Correct 9 ms 6656 KB Output is correct
40 Correct 8 ms 6784 KB Output is correct
41 Correct 150 ms 199260 KB Output is correct
42 Correct 7 ms 4992 KB Output is correct
43 Correct 107 ms 106872 KB Output is correct
44 Correct 136 ms 106872 KB Output is correct
45 Correct 178 ms 106872 KB Output is correct
46 Correct 186 ms 208632 KB Output is correct
47 Correct 248 ms 208632 KB Output is correct
48 Correct 309 ms 208632 KB Output is correct
49 Correct 493 ms 208888 KB Output is correct
50 Correct 68 ms 105848 KB Output is correct
51 Correct 78 ms 105848 KB Output is correct
52 Correct 84 ms 105848 KB Output is correct
53 Correct 139 ms 206584 KB Output is correct
54 Correct 159 ms 206712 KB Output is correct
55 Correct 171 ms 206584 KB Output is correct
56 Correct 9 ms 7552 KB Output is correct
57 Correct 129 ms 207992 KB Output is correct
58 Correct 172 ms 219512 KB Output is correct
59 Correct 230 ms 221944 KB Output is correct
60 Correct 154 ms 204792 KB Output is correct
61 Correct 428 ms 199544 KB Output is correct