oj.uz

Submission #362255

# Submission time Handle Problem Language Result Execution time Memory
362255 2021-02-02T11:06:26 Z alextodoran Cat in a tree (BOI17_catinatree) C++17
100 / 100
 304 ms 171756 KB 
/**
 ____ ____ ____ ____ ____
||a |||t |||o |||d |||o ||
||__|||__|||__|||__|||__||
|/__\|/__\|/__\|/__\|/__\|

**/

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int N_MAX = 200002;

const int BUFFER_SIZE = 100000;

char buffer[BUFFER_SIZE];
int bpos = BUFFER_SIZE - 1;

char read_char ()
{
    bpos++;
    if(bpos == BUFFER_SIZE)
    {
        fread(buffer, sizeof(char), BUFFER_SIZE, stdin);
        bpos = 0;
    }
    return buffer[bpos];
}

bool isDigit[] = {
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0};

int read_int ()
{
    char c;
    while(!isDigit[c = read_char()]);
    int ans = 0;
    while(isDigit[c])
    {
        ans = ans * 10 + c - '0';
        c = read_char();
    }
    return ans;
}

int n, maxd;

int parent[N_MAX];

vector <int> sons[N_MAX];

int depth[N_MAX];

deque <int> dp[N_MAX];

int vsum[N_MAX];
int vmax[N_MAX];

void solve (int u)
{
    if(sons[u].empty() == true)
    {
        dp[u].push_back(1);
        return;
    }
    for(int v : sons[u])
    {
        solve(v);
        depth[u] = max(depth[u], depth[v] + 1);
    }
    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]);
    for(int d = 0; d <= min(maxd / 2, secondDepth + 1); d++)
        vsum[d] = vmax[d] = 0;
    for(int v : sons[u])
    {
        int lim = min({maxd / 2, depth[v] + 1, secondDepth + 1});
        for(int d = 1; d <= lim; d++)
        {
            int val = 0;
            if(maxd - d - 1 <= depth[v])
                val = dp[v][maxd - d - 1];
            vsum[d] += val;
            vmax[d] = max(vmax[d], dp[v][d - 1] - val);
        }
    }
    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])
        if(maxd - 1 <= depth[v])
            sum += dp[v][maxd - 1];
    swap(dp[u], dp[deepSon]);
    dp[u].push_front(sum);
    for(int v : sons[u])
        if(v != deepSon)
        {
            int lim = min(maxd - 1, depth[v] + 1);
            for(int d = (maxd + 1) / 2; d <= lim; 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);
    n = read_int();
    maxd = read_int();
    for(int i = 2; i <= n; i++)
        parent[i] = read_int() + 1;
    for(int i = 2; i <= n; i++)
        sons[parent[i]].push_back(i);
    solve(1);
    cout << dp[1][0] << "\n";
    return 0;
}

Compilation message

catinatree.cpp: In function 'int read_int()':
catinatree.cpp:54:22: warning: array subscript has type 'char' [-Wchar-subscripts]
   54 |     while(!isDigit[c = read_char()]);
      |                    ~~^~~~~~~~~~~~~
catinatree.cpp:56:19: warning: array subscript has type 'char' [-Wchar-subscripts]
   56 |     while(isDigit[c])
      |                   ^
catinatree.cpp: In function 'char read_char()':
catinatree.cpp:27:14: warning: ignoring return value of 'size_t fread(void*, size_t, size_t, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   27 |         fread(buffer, sizeof(char), BUFFER_SIZE, stdin);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 104 ms 139756 KB Output is correct
2 Correct 104 ms 139756 KB Output is correct
3 Correct 103 ms 139756 KB Output is correct
4 Correct 103 ms 139756 KB Output is correct
5 Correct 106 ms 139756 KB Output is correct
6 Correct 105 ms 139756 KB Output is correct
7 Correct 104 ms 139756 KB Output is correct
8 Correct 111 ms 139756 KB Output is correct
9 Correct 117 ms 139756 KB Output is correct
10 Correct 103 ms 139756 KB Output is correct
11 Correct 112 ms 139756 KB Output is correct
12 Correct 114 ms 139756 KB Output is correct
13 Correct 106 ms 139756 KB Output is correct
14 Correct 103 ms 139756 KB Output is correct
15 Correct 106 ms 139756 KB Output is correct
16 Correct 106 ms 139592 KB Output is correct
17 Correct 106 ms 139756 KB Output is correct
18 Correct 105 ms 139756 KB Output is correct
19 Correct 104 ms 139756 KB Output is correct
20 Correct 112 ms 139756 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 104 ms 139756 KB Output is correct
2 Correct 104 ms 139756 KB Output is correct
3 Correct 103 ms 139756 KB Output is correct
4 Correct 103 ms 139756 KB Output is correct
5 Correct 106 ms 139756 KB Output is correct
6 Correct 105 ms 139756 KB Output is correct
7 Correct 104 ms 139756 KB Output is correct
8 Correct 111 ms 139756 KB Output is correct
9 Correct 117 ms 139756 KB Output is correct
10 Correct 103 ms 139756 KB Output is correct
11 Correct 112 ms 139756 KB Output is correct
12 Correct 114 ms 139756 KB Output is correct
13 Correct 106 ms 139756 KB Output is correct
14 Correct 103 ms 139756 KB Output is correct
15 Correct 106 ms 139756 KB Output is correct
16 Correct 106 ms 139592 KB Output is correct
17 Correct 106 ms 139756 KB Output is correct
18 Correct 105 ms 139756 KB Output is correct
19 Correct 104 ms 139756 KB Output is correct
20 Correct 112 ms 139756 KB Output is correct
21 Correct 113 ms 140012 KB Output is correct
22 Correct 111 ms 139756 KB Output is correct
23 Correct 112 ms 139756 KB Output is correct
24 Correct 112 ms 139756 KB Output is correct
25 Correct 114 ms 139884 KB Output is correct
26 Correct 116 ms 139896 KB Output is correct
27 Correct 112 ms 139884 KB Output is correct
28 Correct 115 ms 139884 KB Output is correct
29 Correct 113 ms 139884 KB Output is correct
30 Correct 114 ms 139884 KB Output is correct
31 Correct 112 ms 139884 KB Output is correct
32 Correct 114 ms 139756 KB Output is correct
33 Correct 119 ms 139756 KB Output is correct
34 Correct 114 ms 139884 KB Output is correct
35 Correct 113 ms 139756 KB Output is correct
36 Correct 113 ms 139756 KB Output is correct
37 Correct 114 ms 139756 KB Output is correct
38 Correct 112 ms 139756 KB Output is correct
39 Correct 113 ms 139756 KB Output is correct
40 Correct 112 ms 140012 KB Output is correct

Subtask #3
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 104 ms 139756 KB Output is correct
2 Correct 104 ms 139756 KB Output is correct
3 Correct 103 ms 139756 KB Output is correct
4 Correct 103 ms 139756 KB Output is correct
5 Correct 106 ms 139756 KB Output is correct
6 Correct 105 ms 139756 KB Output is correct
7 Correct 104 ms 139756 KB Output is correct
8 Correct 111 ms 139756 KB Output is correct
9 Correct 117 ms 139756 KB Output is correct
10 Correct 103 ms 139756 KB Output is correct
11 Correct 112 ms 139756 KB Output is correct
12 Correct 114 ms 139756 KB Output is correct
13 Correct 106 ms 139756 KB Output is correct
14 Correct 103 ms 139756 KB Output is correct
15 Correct 106 ms 139756 KB Output is correct
16 Correct 106 ms 139592 KB Output is correct
17 Correct 106 ms 139756 KB Output is correct
18 Correct 105 ms 139756 KB Output is correct
19 Correct 104 ms 139756 KB Output is correct
20 Correct 112 ms 139756 KB Output is correct
21 Correct 113 ms 140012 KB Output is correct
22 Correct 111 ms 139756 KB Output is correct
23 Correct 112 ms 139756 KB Output is correct
24 Correct 112 ms 139756 KB Output is correct
25 Correct 114 ms 139884 KB Output is correct
26 Correct 116 ms 139896 KB Output is correct
27 Correct 112 ms 139884 KB Output is correct
28 Correct 115 ms 139884 KB Output is correct
29 Correct 113 ms 139884 KB Output is correct
30 Correct 114 ms 139884 KB Output is correct
31 Correct 112 ms 139884 KB Output is correct
32 Correct 114 ms 139756 KB Output is correct
33 Correct 119 ms 139756 KB Output is correct
34 Correct 114 ms 139884 KB Output is correct
35 Correct 113 ms 139756 KB Output is correct
36 Correct 113 ms 139756 KB Output is correct
37 Correct 114 ms 139756 KB Output is correct
38 Correct 112 ms 139756 KB Output is correct
39 Correct 113 ms 139756 KB Output is correct
40 Correct 112 ms 140012 KB Output is correct
41 Correct 200 ms 171756 KB Output is correct
42 Correct 197 ms 153452 KB Output is correct
43 Correct 193 ms 153580 KB Output is correct
44 Correct 194 ms 153580 KB Output is correct
45 Correct 194 ms 153592 KB Output is correct
46 Correct 304 ms 167148 KB Output is correct
47 Correct 290 ms 167020 KB Output is correct
48 Correct 297 ms 167148 KB Output is correct
49 Correct 295 ms 167148 KB Output is correct
50 Correct 137 ms 141036 KB Output is correct
51 Correct 138 ms 141036 KB Output is correct
52 Correct 140 ms 141164 KB Output is correct
53 Correct 167 ms 141932 KB Output is correct
54 Correct 163 ms 141932 KB Output is correct
55 Correct 163 ms 141932 KB Output is correct
56 Correct 113 ms 139884 KB Output is correct
57 Correct 119 ms 143844 KB Output is correct
58 Correct 139 ms 157804 KB Output is correct
59 Correct 182 ms 160236 KB Output is correct
60 Correct 193 ms 168168 KB Output is correct
61 Correct 192 ms 153964 KB Output is correct