oj.uz

Submission #134259

# Submission time Handle Problem Language Result Execution time Memory
134259 2019-07-22T09:57:42 Z Kastanda Cat in a tree (BOI17_catinatree) C++11
100 / 100
 153 ms 25456 KB 
#include<bits/stdc++.h>
using namespace std;
const int N = 200005;
int n, d;
vector < int > D[N], Adj[N];
inline int Get(int v, int i)
{
    i = (int)D[v].size() - 1 - max(i, 0);
    if (i < 0)
        return 0;
    return (D[v][i]);
}
void DFS(int v)
{
    for (int &u : Adj[v])
    {
        DFS(u);
        if (D[v].size() < D[u].size())
            D[v].swap(D[u]);
        vector < int > vec(D[u].size(), 0);
        for (int i = 0; i < D[u].size(); i++)
        {
            vec[i] = max(vec[i], Get(u, i) + Get(v, max(d - i - 2, i)));
            vec[i] = max(vec[i], Get(v, i) + Get(u, max(d - i - 2, i)));
        }
        for (int i = (int)D[u].size() - 1; ~ i; i --)
        {
            int id = (int)D[v].size() - 1 - i;
            D[v][id] = max(D[v][id], vec[i]);
            if (id) D[v][id] = max(D[v][id], D[v][id - 1]);
        }
        D[u].clear(); vec.clear();
    }
    D[v].push_back(max(1 + Get(v, d - 1), Get(v, 0)));
}
int main()
{
    scanf("%d%d", &n, &d);
    for (int i = 1, p; i < n; i++)
    {
        scanf("%d", &p);
        Adj[p].push_back(i);
    }
    DFS(0);
    return !printf("%d\n", Get(0, 0));
}

Compilation message

catinatree.cpp: In function 'void DFS(int)':
catinatree.cpp:21:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int i = 0; i < D[u].size(); i++)
                         ~~^~~~~~~~~~~~~
catinatree.cpp: In function 'int main()':
catinatree.cpp:38:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d", &n, &d);
     ~~~~~^~~~~~~~~~~~~~~~
catinatree.cpp:41:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &p);
         ~~~~~^~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 9848 KB Output is correct
2 Correct 10 ms 9720 KB Output is correct
3 Correct 10 ms 9720 KB Output is correct
4 Correct 10 ms 9720 KB Output is correct
5 Correct 10 ms 9720 KB Output is correct
6 Correct 11 ms 9720 KB Output is correct
7 Correct 10 ms 9720 KB Output is correct
8 Correct 10 ms 9664 KB Output is correct
9 Correct 10 ms 9720 KB Output is correct
10 Correct 10 ms 9720 KB Output is correct
11 Correct 10 ms 9720 KB Output is correct
12 Correct 11 ms 9724 KB Output is correct
13 Correct 10 ms 9720 KB Output is correct
14 Correct 10 ms 9724 KB Output is correct
15 Correct 10 ms 9720 KB Output is correct
16 Correct 10 ms 9720 KB Output is correct
17 Correct 10 ms 9720 KB Output is correct
18 Correct 10 ms 9720 KB Output is correct
19 Correct 10 ms 9720 KB Output is correct
20 Correct 10 ms 9720 KB Output is correct
21 Correct 10 ms 9848 KB Output is correct
22 Correct 10 ms 9720 KB Output is correct
23 Correct 13 ms 9720 KB Output is correct
24 Correct 10 ms 9720 KB Output is correct
25 Correct 10 ms 9720 KB Output is correct
26 Correct 11 ms 9720 KB Output is correct
27 Correct 12 ms 9848 KB Output is correct
28 Correct 11 ms 9844 KB Output is correct
29 Correct 11 ms 9720 KB Output is correct
30 Correct 11 ms 9848 KB Output is correct
31 Correct 13 ms 9848 KB Output is correct
32 Correct 13 ms 9852 KB Output is correct
33 Correct 14 ms 9848 KB Output is correct
34 Correct 11 ms 9768 KB Output is correct
35 Correct 11 ms 9720 KB Output is correct
36 Correct 10 ms 9720 KB Output is correct
37 Correct 11 ms 9848 KB Output is correct
38 Correct 10 ms 9720 KB Output is correct
39 Correct 11 ms 9848 KB Output is correct
40 Correct 11 ms 9844 KB Output is correct

Subtask #3
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 9848 KB Output is correct
2 Correct 10 ms 9720 KB Output is correct
3 Correct 10 ms 9720 KB Output is correct
4 Correct 10 ms 9720 KB Output is correct
5 Correct 10 ms 9720 KB Output is correct
6 Correct 11 ms 9720 KB Output is correct
7 Correct 10 ms 9720 KB Output is correct
8 Correct 10 ms 9664 KB Output is correct
9 Correct 10 ms 9720 KB Output is correct
10 Correct 10 ms 9720 KB Output is correct
11 Correct 10 ms 9720 KB Output is correct
12 Correct 11 ms 9724 KB Output is correct
13 Correct 10 ms 9720 KB Output is correct
14 Correct 10 ms 9724 KB Output is correct
15 Correct 10 ms 9720 KB Output is correct
16 Correct 10 ms 9720 KB Output is correct
17 Correct 10 ms 9720 KB Output is correct
18 Correct 10 ms 9720 KB Output is correct
19 Correct 10 ms 9720 KB Output is correct
20 Correct 10 ms 9720 KB Output is correct
21 Correct 10 ms 9848 KB Output is correct
22 Correct 10 ms 9720 KB Output is correct
23 Correct 13 ms 9720 KB Output is correct
24 Correct 10 ms 9720 KB Output is correct
25 Correct 10 ms 9720 KB Output is correct
26 Correct 11 ms 9720 KB Output is correct
27 Correct 12 ms 9848 KB Output is correct
28 Correct 11 ms 9844 KB Output is correct
29 Correct 11 ms 9720 KB Output is correct
30 Correct 11 ms 9848 KB Output is correct
31 Correct 13 ms 9848 KB Output is correct
32 Correct 13 ms 9852 KB Output is correct
33 Correct 14 ms 9848 KB Output is correct
34 Correct 11 ms 9768 KB Output is correct
35 Correct 11 ms 9720 KB Output is correct
36 Correct 10 ms 9720 KB Output is correct
37 Correct 11 ms 9848 KB Output is correct
38 Correct 10 ms 9720 KB Output is correct
39 Correct 11 ms 9848 KB Output is correct
40 Correct 11 ms 9844 KB Output is correct
41 Correct 86 ms 16920 KB Output is correct
42 Correct 85 ms 13540 KB Output is correct
43 Correct 68 ms 13560 KB Output is correct
44 Correct 67 ms 13560 KB Output is correct
45 Correct 91 ms 13588 KB Output is correct
46 Correct 144 ms 17400 KB Output is correct
47 Correct 144 ms 17400 KB Output is correct
48 Correct 146 ms 17400 KB Output is correct
49 Correct 139 ms 17480 KB Output is correct
50 Correct 50 ms 13688 KB Output is correct
51 Correct 64 ms 13796 KB Output is correct
52 Correct 51 ms 13708 KB Output is correct
53 Correct 153 ms 17656 KB Output is correct
54 Correct 116 ms 17784 KB Output is correct
55 Correct 117 ms 17784 KB Output is correct
56 Correct 11 ms 9848 KB Output is correct
57 Correct 17 ms 12152 KB Output is correct
58 Correct 44 ms 20852 KB Output is correct
59 Correct 118 ms 25456 KB Output is correct
60 Correct 80 ms 17140 KB Output is correct
61 Correct 102 ms 17272 KB Output is correct