oj.uz

Submission #362249

# Submission time Handle Problem Language Result Execution time Memory
362249 2021-02-02T10:45:38 Z alextodoran Cat in a tree (BOI17_catinatree) C++17
51 / 100
 1000 ms 174268 KB 
/**
 ____ ____ ____ ____ ____
||a |||t |||o |||d |||o ||
||__|||__|||__|||__|||__||
|/__\|/__\|/__\|/__\|/__\|

**/

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int N_MAX = 200002;

int n, maxd;

int parent[N_MAX];

vector <int> sons[N_MAX];

int depth[N_MAX];

void dfs (int u)
{
    depth[u] = 1;
    for(int v : sons[u])
    {
        dfs(v);
        depth[u] = max(depth[u], depth[v] + 1);
    }
}

int null = 0;

class safe_deque
{
public:
    deque <int> dq;
    int& operator[] (int index)
    {
        if(index >= (int)this->dq.size())
            return null;
        return this->dq[index];
    }
    void push_back (int val)
    {
        this->dq.push_back(val);
    }
    void push_front (int val)
    {
        this->dq.push_front(val);
    }
};

safe_deque dp[N_MAX];

void solve (int u)
{
    if(depth[u] == 1)
    {
        dp[u].push_back(1);
        return;
    }
    for(int v : sons[u])
        solve(v);
    int secondDepth = -1;
    bool firstDepth = false;
    for(int v : sons[u])
        if(depth[v] + 1 == depth[u] && firstDepth == false)
            firstDepth = true;
        else
            secondDepth = max(secondDepth, depth[v]);
    vector <int> vsum(min(maxd / 2, secondDepth + 1) + 1);
    vector <int> vmax(min(maxd / 2, secondDepth + 1) + 1);
    for(int v : sons[u])
    {
        int lim = min({maxd / 2, depth[v] + 1, secondDepth + 1});
        for(int d = 1; d <= lim; d++)
        {
            vsum[d] += dp[v][maxd - d - 1];
            vmax[d] = max(vmax[d], dp[v][d - 1] - dp[v][maxd - d - 1]);
        }
    }
    int deepSon = -1;
    for(int v : sons[u])
        if(deepSon == -1 || depth[v] > depth[deepSon])
            deepSon = v;
    int sum = 1;
    for(int v : sons[u])
        sum += dp[v][maxd - 1];
    swap(dp[u], dp[deepSon]);
    dp[u].push_front(sum);
    for(int v : sons[u])
        if(v != deepSon)
        {
            for(int d = (maxd + 1) / 2; d <= maxd - 1; d++)
                dp[u][d] += dp[v][d - 1];
        }
    for(int d = 1; d <= min(maxd / 2, secondDepth + 1); d++)
        dp[u][d] = vsum[d] + vmax[d];
    for(int d = min(maxd - 2, secondDepth + 1); d >= 0; d--)
        dp[u][d] = max(dp[u][d], dp[u][d + 1]);
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin >> n >> maxd;
    for(int i = 2; i <= n; i++)
    {
        cin >> parent[i];
        parent[i]++;
    }
    for(int i = 2; i <= n; i++)
        sons[parent[i]].push_back(i);
    dfs(1);
    solve(1);
    cout << dp[1][0] << "\n";
    return 0;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 105 ms 139756 KB Output is correct
2 Correct 105 ms 139628 KB Output is correct
3 Correct 107 ms 139628 KB Output is correct
4 Correct 120 ms 139628 KB Output is correct
5 Correct 105 ms 139756 KB Output is correct
6 Correct 105 ms 139628 KB Output is correct
7 Correct 104 ms 139628 KB Output is correct
8 Correct 105 ms 139628 KB Output is correct
9 Correct 104 ms 139740 KB Output is correct
10 Correct 104 ms 139628 KB Output is correct
11 Correct 104 ms 139628 KB Output is correct
12 Correct 113 ms 139628 KB Output is correct
13 Correct 104 ms 139628 KB Output is correct
14 Correct 106 ms 139628 KB Output is correct
15 Correct 107 ms 139628 KB Output is correct
16 Correct 105 ms 139628 KB Output is correct
17 Correct 106 ms 139628 KB Output is correct
18 Correct 104 ms 139628 KB Output is correct
19 Correct 104 ms 139756 KB Output is correct
20 Correct 106 ms 139628 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 105 ms 139756 KB Output is correct
2 Correct 105 ms 139628 KB Output is correct
3 Correct 107 ms 139628 KB Output is correct
4 Correct 120 ms 139628 KB Output is correct
5 Correct 105 ms 139756 KB Output is correct
6 Correct 105 ms 139628 KB Output is correct
7 Correct 104 ms 139628 KB Output is correct
8 Correct 105 ms 139628 KB Output is correct
9 Correct 104 ms 139740 KB Output is correct
10 Correct 104 ms 139628 KB Output is correct
11 Correct 104 ms 139628 KB Output is correct
12 Correct 113 ms 139628 KB Output is correct
13 Correct 104 ms 139628 KB Output is correct
14 Correct 106 ms 139628 KB Output is correct
15 Correct 107 ms 139628 KB Output is correct
16 Correct 105 ms 139628 KB Output is correct
17 Correct 106 ms 139628 KB Output is correct
18 Correct 104 ms 139628 KB Output is correct
19 Correct 104 ms 139756 KB Output is correct
20 Correct 106 ms 139628 KB Output is correct
21 Correct 113 ms 140140 KB Output is correct
22 Correct 110 ms 139804 KB Output is correct
23 Correct 105 ms 139756 KB Output is correct
24 Correct 104 ms 139756 KB Output is correct
25 Correct 118 ms 139880 KB Output is correct
26 Correct 114 ms 139756 KB Output is correct
27 Correct 114 ms 139756 KB Output is correct
28 Correct 119 ms 140036 KB Output is correct
29 Correct 114 ms 139884 KB Output is correct
30 Correct 113 ms 140012 KB Output is correct
31 Correct 115 ms 139884 KB Output is correct
32 Correct 106 ms 139884 KB Output is correct
33 Correct 107 ms 139756 KB Output is correct
34 Correct 110 ms 139756 KB Output is correct
35 Correct 105 ms 139756 KB Output is correct
36 Correct 104 ms 139756 KB Output is correct
37 Correct 105 ms 139756 KB Output is correct
38 Correct 105 ms 139756 KB Output is correct
39 Correct 107 ms 139884 KB Output is correct
40 Correct 106 ms 140140 KB Output is correct

Subtask #3
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 105 ms 139756 KB Output is correct
2 Correct 105 ms 139628 KB Output is correct
3 Correct 107 ms 139628 KB Output is correct
4 Correct 120 ms 139628 KB Output is correct
5 Correct 105 ms 139756 KB Output is correct
6 Correct 105 ms 139628 KB Output is correct
7 Correct 104 ms 139628 KB Output is correct
8 Correct 105 ms 139628 KB Output is correct
9 Correct 104 ms 139740 KB Output is correct
10 Correct 104 ms 139628 KB Output is correct
11 Correct 104 ms 139628 KB Output is correct
12 Correct 113 ms 139628 KB Output is correct
13 Correct 104 ms 139628 KB Output is correct
14 Correct 106 ms 139628 KB Output is correct
15 Correct 107 ms 139628 KB Output is correct
16 Correct 105 ms 139628 KB Output is correct
17 Correct 106 ms 139628 KB Output is correct
18 Correct 104 ms 139628 KB Output is correct
19 Correct 104 ms 139756 KB Output is correct
20 Correct 106 ms 139628 KB Output is correct
21 Correct 113 ms 140140 KB Output is correct
22 Correct 110 ms 139804 KB Output is correct
23 Correct 105 ms 139756 KB Output is correct
24 Correct 104 ms 139756 KB Output is correct
25 Correct 118 ms 139880 KB Output is correct
26 Correct 114 ms 139756 KB Output is correct
27 Correct 114 ms 139756 KB Output is correct
28 Correct 119 ms 140036 KB Output is correct
29 Correct 114 ms 139884 KB Output is correct
30 Correct 113 ms 140012 KB Output is correct
31 Correct 115 ms 139884 KB Output is correct
32 Correct 106 ms 139884 KB Output is correct
33 Correct 107 ms 139756 KB Output is correct
34 Correct 110 ms 139756 KB Output is correct
35 Correct 105 ms 139756 KB Output is correct
36 Correct 104 ms 139756 KB Output is correct
37 Correct 105 ms 139756 KB Output is correct
38 Correct 105 ms 139756 KB Output is correct
39 Correct 107 ms 139884 KB Output is correct
40 Correct 106 ms 140140 KB Output is correct
41 Correct 246 ms 172648 KB Output is correct
42 Correct 217 ms 153964 KB Output is correct
43 Correct 221 ms 153964 KB Output is correct
44 Correct 219 ms 153964 KB Output is correct
45 Correct 231 ms 154092 KB Output is correct
46 Correct 339 ms 168172 KB Output is correct
47 Correct 360 ms 168300 KB Output is correct
48 Correct 361 ms 168300 KB Output is correct
49 Correct 387 ms 168160 KB Output is correct
50 Correct 149 ms 141676 KB Output is correct
51 Correct 148 ms 141804 KB Output is correct
52 Correct 148 ms 141676 KB Output is correct
53 Correct 186 ms 143468 KB Output is correct
54 Correct 185 ms 143492 KB Output is correct
55 Correct 188 ms 143468 KB Output is correct
56 Correct 106 ms 140188 KB Output is correct
57 Correct 135 ms 146284 KB Output is correct
58 Correct 500 ms 169836 KB Output is correct
59 Execution timed out 1065 ms 174268 KB Time limit exceeded
60 Halted 0 ms 0 KB -