Submission #163536

# Submission time Handle Problem Language Result Execution time Memory
163536 2019-11-13T18:45:26 Z Kalam Cat in a tree (BOI17_catinatree) C++11
100 / 100
121 ms 20344 KB
// KALAM
# include<bits/stdc++.h>

using namespace std;

const int N = 200000 + 77;
int n , d , dp[N] , dist[N];
vector < int > adj[N];
void dfs(int v) {
   vector < int > V;
   for(int u : adj[v])
      dfs(u) , V.push_back(dist[u] + 1) , dp[v] += dp[u];
   if(V.empty()) { dp[v] = 1; dist[v] = 0; return ; }
   sort(V.begin() , V.end() , [&](int x , int y) { return x > y; });
   while(V.size() > 1 && V.back() + V[(int) V.size() - 2] < d) -- dp[v] , V.pop_back();
   if(V.empty() || V.back() >= d) ++ dp[v] , V.push_back(0);
   dist[v] = V.back();
}
int main() {
   scanf("%d %d" , & n , & d);
   for(int x , i = 2;i <= n;++ i)
      scanf("%d" , & x) , adj[x + 1].push_back(i);
   dfs(1);
   printf("%d\n" , dp[1]);
   return 0;
}

Compilation message

catinatree.cpp: In function 'int main()':
catinatree.cpp:20:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d %d" , & n , & d);
    ~~~~~^~~~~~~~~~~~~~~~~~~~~
catinatree.cpp:22:25: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
       scanf("%d" , & x) , adj[x + 1].push_back(i);
       ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 6 ms 5112 KB Output is correct
2 Correct 6 ms 5112 KB Output is correct
3 Correct 6 ms 5160 KB Output is correct
4 Correct 6 ms 4984 KB Output is correct
5 Correct 6 ms 4956 KB Output is correct
6 Correct 6 ms 5112 KB Output is correct
7 Correct 6 ms 4984 KB Output is correct
8 Correct 6 ms 4984 KB Output is correct
9 Correct 6 ms 4984 KB Output is correct
10 Correct 6 ms 5084 KB Output is correct
11 Correct 6 ms 4984 KB Output is correct
12 Correct 6 ms 5112 KB Output is correct
13 Correct 6 ms 4984 KB Output is correct
14 Correct 6 ms 5112 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 5016 KB Output is correct
18 Correct 6 ms 5112 KB Output is correct
19 Correct 6 ms 4984 KB Output is correct
20 Correct 6 ms 5112 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 6 ms 5112 KB Output is correct
2 Correct 6 ms 5112 KB Output is correct
3 Correct 6 ms 5160 KB Output is correct
4 Correct 6 ms 4984 KB Output is correct
5 Correct 6 ms 4956 KB Output is correct
6 Correct 6 ms 5112 KB Output is correct
7 Correct 6 ms 4984 KB Output is correct
8 Correct 6 ms 4984 KB Output is correct
9 Correct 6 ms 4984 KB Output is correct
10 Correct 6 ms 5084 KB Output is correct
11 Correct 6 ms 4984 KB Output is correct
12 Correct 6 ms 5112 KB Output is correct
13 Correct 6 ms 4984 KB Output is correct
14 Correct 6 ms 5112 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 5016 KB Output is correct
18 Correct 6 ms 5112 KB Output is correct
19 Correct 6 ms 4984 KB Output is correct
20 Correct 6 ms 5112 KB Output is correct
21 Correct 7 ms 5240 KB Output is correct
22 Correct 6 ms 5240 KB Output is correct
23 Correct 6 ms 4984 KB Output is correct
24 Correct 7 ms 4984 KB Output is correct
25 Correct 7 ms 4984 KB Output is correct
26 Correct 6 ms 4984 KB Output is correct
27 Correct 6 ms 4984 KB Output is correct
28 Correct 7 ms 5112 KB Output is correct
29 Correct 6 ms 5112 KB Output is correct
30 Correct 7 ms 5112 KB Output is correct
31 Correct 7 ms 5112 KB Output is correct
32 Correct 6 ms 5112 KB Output is correct
33 Correct 7 ms 4984 KB Output is correct
34 Correct 7 ms 4984 KB Output is correct
35 Correct 6 ms 5112 KB Output is correct
36 Correct 6 ms 5112 KB Output is correct
37 Correct 6 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 5240 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 6 ms 5112 KB Output is correct
2 Correct 6 ms 5112 KB Output is correct
3 Correct 6 ms 5160 KB Output is correct
4 Correct 6 ms 4984 KB Output is correct
5 Correct 6 ms 4956 KB Output is correct
6 Correct 6 ms 5112 KB Output is correct
7 Correct 6 ms 4984 KB Output is correct
8 Correct 6 ms 4984 KB Output is correct
9 Correct 6 ms 4984 KB Output is correct
10 Correct 6 ms 5084 KB Output is correct
11 Correct 6 ms 4984 KB Output is correct
12 Correct 6 ms 5112 KB Output is correct
13 Correct 6 ms 4984 KB Output is correct
14 Correct 6 ms 5112 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 5016 KB Output is correct
18 Correct 6 ms 5112 KB Output is correct
19 Correct 6 ms 4984 KB Output is correct
20 Correct 6 ms 5112 KB Output is correct
21 Correct 7 ms 5240 KB Output is correct
22 Correct 6 ms 5240 KB Output is correct
23 Correct 6 ms 4984 KB Output is correct
24 Correct 7 ms 4984 KB Output is correct
25 Correct 7 ms 4984 KB Output is correct
26 Correct 6 ms 4984 KB Output is correct
27 Correct 6 ms 4984 KB Output is correct
28 Correct 7 ms 5112 KB Output is correct
29 Correct 6 ms 5112 KB Output is correct
30 Correct 7 ms 5112 KB Output is correct
31 Correct 7 ms 5112 KB Output is correct
32 Correct 6 ms 5112 KB Output is correct
33 Correct 7 ms 4984 KB Output is correct
34 Correct 7 ms 4984 KB Output is correct
35 Correct 6 ms 5112 KB Output is correct
36 Correct 6 ms 5112 KB Output is correct
37 Correct 6 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 5240 KB Output is correct
41 Correct 71 ms 11608 KB Output is correct
42 Correct 54 ms 8044 KB Output is correct
43 Correct 50 ms 8056 KB Output is correct
44 Correct 53 ms 7928 KB Output is correct
45 Correct 46 ms 7956 KB Output is correct
46 Correct 112 ms 11004 KB Output is correct
47 Correct 114 ms 11000 KB Output is correct
48 Correct 121 ms 11000 KB Output is correct
49 Correct 117 ms 11000 KB Output is correct
50 Correct 28 ms 6776 KB Output is correct
51 Correct 26 ms 6752 KB Output is correct
52 Correct 25 ms 6776 KB Output is correct
53 Correct 44 ms 8440 KB Output is correct
54 Correct 44 ms 8440 KB Output is correct
55 Correct 50 ms 8440 KB Output is correct
56 Correct 7 ms 5240 KB Output is correct
57 Correct 14 ms 7800 KB Output is correct
58 Correct 44 ms 17628 KB Output is correct
59 Correct 100 ms 20344 KB Output is correct
60 Correct 73 ms 12276 KB Output is correct
61 Correct 89 ms 11640 KB Output is correct