oj.uz

Submission #850203

# Submission time Handle Problem Language Result Execution time Memory
850203 2023-09-16T03:34:45 Z ThMinh_ Cat in a tree (BOI17_catinatree) C++14
100 / 100
 60 ms 24236 KB 
#include<bits/stdc++.h>
#define forin(i, a, b) for(int i = a; i <= b; ++i)
using namespace std;
const int N = 2e5 + 10;
int n, d;
int g[N], f[N], cnt[N];
vector<int> adj[N];
void dfs(int u = 1, int p = 0) {
   f[u] = 1e9;
   for(auto v : adj[u]) if(v != p) {
      dfs(v, u);
      cnt[u] += cnt[v];
      f[u] = min(f[u], f[v] + 1);
      if(g[v]) {
         if(g[v] * 2 >= d) {
            f[u] = min(f[u], g[v] + 1);
            cnt[u]++;
         }
         else g[u] = max(g[u], g[v] + 1);
      }
   }
   if(g[u] + f[u] - 2 < d) g[u] = 0;
   if(!g[u] && f[u] - 1 >= d) g[u] = 1;
}
int main () {
   cin.tie(0)->sync_with_stdio(0);
   if(fopen("Task.inp","r")) {
      freopen("Task.inp","r",stdin);
      freopen("WA.out","w",stdout);
   }
   if(fopen("Durian.inp","r")) {
      freopen("Durian.inp","r",stdin);
      freopen("Durian.out","w",stdout);
   }
   cin>>n>>d;
   forin(i, 1, n - 1) {
      int x; cin>>x;
      adj[i + 1].push_back(x + 1);
      adj[x + 1].push_back(i + 1);
   }
//   forin(i, 1, n - 1) {
//      int u, v; cin>>u>>v;
//      adj[u].push_back(v);
//      adj[v].push_back(u);
//   }
   dfs();
   cout<<cnt[1] + bool (g[1]);
}

Compilation message

catinatree.cpp: In function 'int main()':
catinatree.cpp:28:14: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   28 |       freopen("Task.inp","r",stdin);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
catinatree.cpp:29:14: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   29 |       freopen("WA.out","w",stdout);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
catinatree.cpp:32:14: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   32 |       freopen("Durian.inp","r",stdin);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
catinatree.cpp:33:14: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   33 |       freopen("Durian.out","w",stdout);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6744 KB Output is correct
2 Correct 1 ms 6748 KB Output is correct
3 Correct 1 ms 6744 KB Output is correct
4 Correct 1 ms 6744 KB Output is correct
5 Correct 1 ms 6744 KB Output is correct
6 Correct 1 ms 6744 KB Output is correct
7 Correct 2 ms 6748 KB Output is correct
8 Correct 1 ms 6744 KB Output is correct
9 Correct 2 ms 7000 KB Output is correct
10 Correct 1 ms 6744 KB Output is correct
11 Correct 2 ms 6744 KB Output is correct
12 Correct 1 ms 6792 KB Output is correct
13 Correct 1 ms 6744 KB Output is correct
14 Correct 2 ms 6796 KB Output is correct
15 Correct 2 ms 6744 KB Output is correct
16 Correct 1 ms 6744 KB Output is correct
17 Correct 2 ms 6744 KB Output is correct
18 Correct 2 ms 6748 KB Output is correct
19 Correct 2 ms 6744 KB Output is correct
20 Correct 1 ms 6744 KB Output is correct
21 Correct 2 ms 6744 KB Output is correct
22 Correct 2 ms 6748 KB Output is correct
23 Correct 1 ms 6748 KB Output is correct
24 Correct 1 ms 6744 KB Output is correct
25 Correct 2 ms 6744 KB Output is correct
26 Correct 2 ms 6744 KB Output is correct
27 Correct 1 ms 6744 KB Output is correct
28 Correct 1 ms 6748 KB Output is correct
29 Correct 2 ms 6744 KB Output is correct
30 Correct 2 ms 6748 KB Output is correct
31 Correct 2 ms 6744 KB Output is correct
32 Correct 1 ms 6744 KB Output is correct
33 Correct 1 ms 6744 KB Output is correct
34 Correct 2 ms 6748 KB Output is correct
35 Correct 2 ms 6948 KB Output is correct
36 Correct 2 ms 6748 KB Output is correct
37 Correct 2 ms 6804 KB Output is correct
38 Correct 2 ms 6748 KB Output is correct
39 Correct 1 ms 7000 KB Output is correct
40 Correct 2 ms 6760 KB Output is correct

Subtask #3
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6744 KB Output is correct
2 Correct 1 ms 6748 KB Output is correct
3 Correct 1 ms 6744 KB Output is correct
4 Correct 1 ms 6744 KB Output is correct
5 Correct 1 ms 6744 KB Output is correct
6 Correct 1 ms 6744 KB Output is correct
7 Correct 2 ms 6748 KB Output is correct
8 Correct 1 ms 6744 KB Output is correct
9 Correct 2 ms 7000 KB Output is correct
10 Correct 1 ms 6744 KB Output is correct
11 Correct 2 ms 6744 KB Output is correct
12 Correct 1 ms 6792 KB Output is correct
13 Correct 1 ms 6744 KB Output is correct
14 Correct 2 ms 6796 KB Output is correct
15 Correct 2 ms 6744 KB Output is correct
16 Correct 1 ms 6744 KB Output is correct
17 Correct 2 ms 6744 KB Output is correct
18 Correct 2 ms 6748 KB Output is correct
19 Correct 2 ms 6744 KB Output is correct
20 Correct 1 ms 6744 KB Output is correct
21 Correct 2 ms 6744 KB Output is correct
22 Correct 2 ms 6748 KB Output is correct
23 Correct 1 ms 6748 KB Output is correct
24 Correct 1 ms 6744 KB Output is correct
25 Correct 2 ms 6744 KB Output is correct
26 Correct 2 ms 6744 KB Output is correct
27 Correct 1 ms 6744 KB Output is correct
28 Correct 1 ms 6748 KB Output is correct
29 Correct 2 ms 6744 KB Output is correct
30 Correct 2 ms 6748 KB Output is correct
31 Correct 2 ms 6744 KB Output is correct
32 Correct 1 ms 6744 KB Output is correct
33 Correct 1 ms 6744 KB Output is correct
34 Correct 2 ms 6748 KB Output is correct
35 Correct 2 ms 6948 KB Output is correct
36 Correct 2 ms 6748 KB Output is correct
37 Correct 2 ms 6804 KB Output is correct
38 Correct 2 ms 6748 KB Output is correct
39 Correct 1 ms 7000 KB Output is correct
40 Correct 2 ms 6760 KB Output is correct
41 Correct 29 ms 14548 KB Output is correct
42 Correct 18 ms 10840 KB Output is correct
43 Correct 19 ms 10840 KB Output is correct
44 Correct 17 ms 10840 KB Output is correct
45 Correct 20 ms 10832 KB Output is correct
46 Correct 53 ms 14960 KB Output is correct
47 Correct 52 ms 14928 KB Output is correct
48 Correct 50 ms 15120 KB Output is correct
49 Correct 60 ms 14928 KB Output is correct
50 Correct 13 ms 11096 KB Output is correct
51 Correct 18 ms 11352 KB Output is correct
52 Correct 14 ms 11160 KB Output is correct
53 Correct 30 ms 15532 KB Output is correct
54 Correct 28 ms 15548 KB Output is correct
55 Correct 30 ms 15440 KB Output is correct
56 Correct 2 ms 6744 KB Output is correct
57 Correct 5 ms 9304 KB Output is correct
58 Correct 21 ms 19068 KB Output is correct
59 Correct 44 ms 24236 KB Output is correct
60 Correct 31 ms 14536 KB Output is correct
61 Correct 37 ms 14552 KB Output is correct