Submission #145004

# Submission time Handle Problem Language Result Execution time Memory
145004 2019-08-18T11:20:51 Z evpipis Cat in a tree (BOI17_catinatree) C++14
100 / 100
105 ms 20344 KB
#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define mp make_pair
#define pb push_back
typedef pair<int, int> ii;

const int len = 2e5+5;
int n, d, dis[len], opt[len];
vector<int> adj[len];

bool comp(int a, int b){
    return (dis[a] < dis[b]);
}

void dfs(int u){
    //printf("dfs: u = %d\n", u);
    for (int j = 0; j < adj[u].size(); j++){
        int v = adj[u][j];
        dfs(v);
        dis[v]++;
    }

    sort(adj[u].begin(), adj[u].end(), comp);

    opt[u] = 1;
    dis[u] = 0;
    int sum = 0;
    for (int j = 0; j < adj[u].size(); j++){
        int v = adj[u][j];
        opt[u] += opt[v];
        if (dis[v] < d)
            opt[u]--;

        sum += opt[v];
    }

    for (int i = (int)adj[u].size()-1, j = 0; i >= 0; i--){
        int v = adj[u][i];
        while (j < adj[u].size() && dis[adj[u][j]] < d-dis[v])
            j++;

        int dis2 = dis[v], opt2 = sum-i;
        if (j > i)
            opt2 = sum-(j-1);

        if (mp(opt2, dis2) > mp(opt[u], dis[u]))
            opt[u] = opt2, dis[u] = dis2;
    }
}

int main(){
    scanf("%d %d", &n, &d);
    for (int i = 1; i < n; i++){
        int temp;
        scanf("%d", &temp);
        adj[temp].pb(i);
    }

    dfs(0);

    printf("%d\n", opt[0]);
    return 0;
}

Compilation message

catinatree.cpp: In function 'void dfs(int)':
catinatree.cpp:20:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int j = 0; j < adj[u].size(); j++){
                     ~~^~~~~~~~~~~~~~~
catinatree.cpp:31:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int j = 0; j < adj[u].size(); j++){
                     ~~^~~~~~~~~~~~~~~
catinatree.cpp:42:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         while (j < adj[u].size() && dis[adj[u][j]] < d-dis[v])
                ~~^~~~~~~~~~~~~~~
catinatree.cpp: In function 'int main()':
catinatree.cpp:55: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:58:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &temp);
         ~~~~~^~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 6 ms 4984 KB Output is correct
2 Correct 6 ms 4984 KB Output is correct
3 Correct 6 ms 4984 KB Output is correct
4 Correct 7 ms 4984 KB Output is correct
5 Correct 6 ms 4984 KB Output is correct
6 Correct 6 ms 4984 KB Output is correct
7 Correct 8 ms 4984 KB Output is correct
8 Correct 8 ms 4984 KB Output is correct
9 Correct 8 ms 4984 KB Output is correct
10 Correct 6 ms 4984 KB Output is correct
11 Correct 6 ms 4984 KB Output is correct
12 Correct 10 ms 4984 KB Output is correct
13 Correct 8 ms 4984 KB Output is correct
14 Correct 7 ms 4984 KB Output is correct
15 Correct 6 ms 4984 KB Output is correct
16 Correct 6 ms 4984 KB Output is correct
17 Correct 6 ms 4984 KB Output is correct
18 Correct 6 ms 4984 KB Output is correct
19 Correct 6 ms 4984 KB Output is correct
20 Correct 6 ms 4984 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 6 ms 4984 KB Output is correct
2 Correct 6 ms 4984 KB Output is correct
3 Correct 6 ms 4984 KB Output is correct
4 Correct 7 ms 4984 KB Output is correct
5 Correct 6 ms 4984 KB Output is correct
6 Correct 6 ms 4984 KB Output is correct
7 Correct 8 ms 4984 KB Output is correct
8 Correct 8 ms 4984 KB Output is correct
9 Correct 8 ms 4984 KB Output is correct
10 Correct 6 ms 4984 KB Output is correct
11 Correct 6 ms 4984 KB Output is correct
12 Correct 10 ms 4984 KB Output is correct
13 Correct 8 ms 4984 KB Output is correct
14 Correct 7 ms 4984 KB Output is correct
15 Correct 6 ms 4984 KB Output is correct
16 Correct 6 ms 4984 KB Output is correct
17 Correct 6 ms 4984 KB Output is correct
18 Correct 6 ms 4984 KB Output is correct
19 Correct 6 ms 4984 KB Output is correct
20 Correct 6 ms 4984 KB Output is correct
21 Correct 6 ms 5192 KB Output is correct
22 Correct 7 ms 5112 KB Output is correct
23 Correct 6 ms 4984 KB Output is correct
24 Correct 7 ms 5112 KB Output is correct
25 Correct 10 ms 5112 KB Output is correct
26 Correct 10 ms 5112 KB Output is correct
27 Correct 6 ms 4984 KB Output is correct
28 Correct 7 ms 5112 KB Output is correct
29 Correct 7 ms 5112 KB Output is correct
30 Correct 7 ms 4984 KB Output is correct
31 Correct 6 ms 5112 KB Output is correct
32 Correct 7 ms 5112 KB Output is correct
33 Correct 6 ms 4984 KB Output is correct
34 Correct 7 ms 5112 KB Output is correct
35 Correct 6 ms 5112 KB Output is correct
36 Correct 7 ms 5112 KB Output is correct
37 Correct 7 ms 5112 KB Output is correct
38 Correct 6 ms 5112 KB Output is correct
39 Correct 6 ms 5112 KB Output is correct
40 Correct 7 ms 5368 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 6 ms 4984 KB Output is correct
2 Correct 6 ms 4984 KB Output is correct
3 Correct 6 ms 4984 KB Output is correct
4 Correct 7 ms 4984 KB Output is correct
5 Correct 6 ms 4984 KB Output is correct
6 Correct 6 ms 4984 KB Output is correct
7 Correct 8 ms 4984 KB Output is correct
8 Correct 8 ms 4984 KB Output is correct
9 Correct 8 ms 4984 KB Output is correct
10 Correct 6 ms 4984 KB Output is correct
11 Correct 6 ms 4984 KB Output is correct
12 Correct 10 ms 4984 KB Output is correct
13 Correct 8 ms 4984 KB Output is correct
14 Correct 7 ms 4984 KB Output is correct
15 Correct 6 ms 4984 KB Output is correct
16 Correct 6 ms 4984 KB Output is correct
17 Correct 6 ms 4984 KB Output is correct
18 Correct 6 ms 4984 KB Output is correct
19 Correct 6 ms 4984 KB Output is correct
20 Correct 6 ms 4984 KB Output is correct
21 Correct 6 ms 5192 KB Output is correct
22 Correct 7 ms 5112 KB Output is correct
23 Correct 6 ms 4984 KB Output is correct
24 Correct 7 ms 5112 KB Output is correct
25 Correct 10 ms 5112 KB Output is correct
26 Correct 10 ms 5112 KB Output is correct
27 Correct 6 ms 4984 KB Output is correct
28 Correct 7 ms 5112 KB Output is correct
29 Correct 7 ms 5112 KB Output is correct
30 Correct 7 ms 4984 KB Output is correct
31 Correct 6 ms 5112 KB Output is correct
32 Correct 7 ms 5112 KB Output is correct
33 Correct 6 ms 4984 KB Output is correct
34 Correct 7 ms 5112 KB Output is correct
35 Correct 6 ms 5112 KB Output is correct
36 Correct 7 ms 5112 KB Output is correct
37 Correct 7 ms 5112 KB Output is correct
38 Correct 6 ms 5112 KB Output is correct
39 Correct 6 ms 5112 KB Output is correct
40 Correct 7 ms 5368 KB Output is correct
41 Correct 64 ms 11332 KB Output is correct
42 Correct 55 ms 7964 KB Output is correct
43 Correct 64 ms 8056 KB Output is correct
44 Correct 41 ms 7928 KB Output is correct
45 Correct 43 ms 7928 KB Output is correct
46 Correct 98 ms 11000 KB Output is correct
47 Correct 101 ms 11000 KB Output is correct
48 Correct 102 ms 11000 KB Output is correct
49 Correct 105 ms 11092 KB Output is correct
50 Correct 26 ms 6776 KB Output is correct
51 Correct 26 ms 6776 KB Output is correct
52 Correct 26 ms 6776 KB Output is correct
53 Correct 46 ms 8440 KB Output is correct
54 Correct 46 ms 8440 KB Output is correct
55 Correct 44 ms 8440 KB Output is correct
56 Correct 7 ms 5116 KB Output is correct
57 Correct 13 ms 7800 KB Output is correct
58 Correct 41 ms 17656 KB Output is correct
59 Correct 88 ms 20344 KB Output is correct
60 Correct 64 ms 11864 KB Output is correct
61 Correct 79 ms 11524 KB Output is correct