oj.uz

Submission #164591

# Submission time Handle Problem Language Result Execution time Memory
164591 2019-11-21T19:18:15 Z dolphingarlic Cat in a tree (BOI17_catinatree) C++14
100 / 100
 184 ms 18040 KB 
#include <bits/stdc++.h>
#define FOR(i, x, y) for (int i = x; i < y; i++)
typedef long long ll;
using namespace std;

int n, d;
vector<int> graph[200001];
// dp: Maximum number of marked nodes in subtree of i
// to_root: Minimum length of path from a marked node to the root
// mn_dist: Maximum length of path from a marked node to the root after
// the erasing of another marked node
int dp[200001], to_root[200001], mn_dist[200001];

void dfs(int node = 0) {
    if (graph[node].size()) {
        int v = graph[node][0];
        dfs(v);

        if (to_root[v] + 1 >= d) {
            // We mark the root
            dp[node] = dp[v] + 1;
            to_root[node] = 0;
            mn_dist[node] = to_root[v] + 1;
        } else {
            // We don't
            dp[node] = dp[v];
            to_root[node] = to_root[v] + 1;
            mn_dist[node] = mn_dist[v] + 1;
        }

        FOR(i, 1, graph[node].size()) {
            int v = graph[node][i];
            dfs(v);

            int doo = to_root[node] + to_root[v] + 1;
            int mdoo = min(to_root[node], to_root[v] + 1);
            
            int dos = to_root[node] + mn_dist[v] + 1;
            int mdos = min(to_root[node], mn_dist[v] + 1);
    
            int dso = mn_dist[node] + to_root[v] + 1;
            int mdso = min(mn_dist[node], to_root[v] + 1);
    
            int dss = mn_dist[node] + mn_dist[v] + 1;
            int mdss = min(mn_dist[node], mn_dist[v] + 1);

            if (doo >= d) {
                dp[node] += dp[v];
                to_root[node] = mdoo;
                mn_dist[node] = max(mdos, mdso);
            } else {
                dp[node] += dp[v] - 1;

                if (dos >= d) to_root[node] = mdos;
                else to_root[node] = 0;

                if (dso >= d) to_root[node] = max(to_root[node], mdso);

                mn_dist[node] = mdss;
            }
        }
    } else {
        dp[node] = 1;
        to_root[node] = 0;
        mn_dist[node] = d;
    }
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> n >> d;
    FOR(i, 1, n) {
        int p;
        cin >> p;
        graph[p].push_back(i);
    }

    dfs();
    cout << dp[0];
    return 0;
}

Compilation message

catinatree.cpp: In function 'void dfs(int)':
catinatree.cpp:2:40: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define FOR(i, x, y) for (int i = x; i < y; i++)
catinatree.cpp:31:13:
         FOR(i, 1, graph[node].size()) {
             ~~~~~~~~~~~~~~~~~~~~~~~~    
catinatree.cpp:31:9: note: in expansion of macro 'FOR'
         FOR(i, 1, graph[node].size()) {
         ^~~
catinatree.cpp:44:17: warning: unused variable 'dss' [-Wunused-variable]
             int dss = mn_dist[node] + mn_dist[v] + 1;
                 ^~~

Subtask #1
11.0 / 11.0

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

Subtask #2
40.0 / 40.0

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

Subtask #3
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4984 KB Output is correct
2 Correct 6 ms 5112 KB Output is correct
3 Correct 6 ms 5112 KB Output is correct
4 Correct 6 ms 5116 KB Output is correct
5 Correct 7 ms 5112 KB Output is correct
6 Correct 6 ms 5112 KB Output is correct
7 Correct 6 ms 5112 KB Output is correct
8 Correct 6 ms 5112 KB Output is correct
9 Correct 6 ms 5112 KB Output is correct
10 Correct 6 ms 4984 KB Output is correct
11 Correct 6 ms 4984 KB Output is correct
12 Correct 6 ms 4984 KB Output is correct
13 Correct 6 ms 5112 KB Output is correct
14 Correct 6 ms 4984 KB Output is correct
15 Correct 6 ms 5112 KB Output is correct
16 Correct 9 ms 4984 KB Output is correct
17 Correct 6 ms 4984 KB Output is correct
18 Correct 6 ms 5112 KB Output is correct
19 Correct 6 ms 5112 KB Output is correct
20 Correct 6 ms 4984 KB Output is correct
21 Correct 7 ms 5240 KB Output is correct
22 Correct 6 ms 4984 KB Output is correct
23 Correct 6 ms 4984 KB Output is correct
24 Correct 6 ms 5084 KB Output is correct
25 Correct 6 ms 5112 KB Output is correct
26 Correct 6 ms 5112 KB Output is correct
27 Correct 6 ms 5112 KB Output is correct
28 Correct 6 ms 5112 KB Output is correct
29 Correct 6 ms 5112 KB Output is correct
30 Correct 6 ms 5112 KB Output is correct
31 Correct 6 ms 5112 KB Output is correct
32 Correct 6 ms 5116 KB Output is correct
33 Correct 6 ms 5112 KB Output is correct
34 Correct 6 ms 5112 KB Output is correct
35 Correct 6 ms 5112 KB Output is correct
36 Correct 6 ms 5112 KB Output is correct
37 Correct 8 ms 5120 KB Output is correct
38 Correct 7 ms 5112 KB Output is correct
39 Correct 6 ms 5112 KB Output is correct
40 Correct 6 ms 5240 KB Output is correct
41 Correct 60 ms 12040 KB Output is correct
42 Correct 35 ms 8440 KB Output is correct
43 Correct 35 ms 8440 KB Output is correct
44 Correct 36 ms 8312 KB Output is correct
45 Correct 87 ms 8356 KB Output is correct
46 Correct 184 ms 11760 KB Output is correct
47 Correct 88 ms 11768 KB Output is correct
48 Correct 77 ms 11768 KB Output is correct
49 Correct 88 ms 11768 KB Output is correct
50 Correct 21 ms 7160 KB Output is correct
51 Correct 21 ms 7160 KB Output is correct
52 Correct 21 ms 7160 KB Output is correct
53 Correct 36 ms 9208 KB Output is correct
54 Correct 37 ms 9260 KB Output is correct
55 Correct 37 ms 9336 KB Output is correct
56 Correct 6 ms 5112 KB Output is correct
57 Correct 12 ms 7292 KB Output is correct
58 Correct 34 ms 15224 KB Output is correct
59 Correct 75 ms 18040 KB Output is correct
60 Correct 53 ms 12576 KB Output is correct
61 Correct 65 ms 12408 KB Output is correct