oj.uz

Submission #286927

# Submission time Handle Problem Language Result Execution time Memory
286927 2020-08-31T07:20:05 Z AlexLuchianov Cat in a tree (BOI17_catinatree) C++14
100 / 100
 235 ms 19576 KB 
#include <iostream>
#include <vector>
#include <cassert>
#include <cmath>
#include <algorithm>

using ll = long long;
#define MIN(a, b) (((a) < (b)) ? (a) : (b))
#define MAX(a, b) (((a) < (b)) ? (b) : (a))

int const nmax = 200000;
std::vector<int> g[1 + nmax];
int level[1 + nmax], marked[1 + nmax];

void dfs(int node, int parent) {
  for(int h = 0; h < g[node].size(); h++) {
    int to = g[node][h];
    if(to != parent) {
      level[to] = level[node] + 1;
      dfs(to, node);
    }
  }
}

bool compare(int x, int y) {
  return level[x] < level[y];
}

void mark(int node, int power) {
  if(power <= marked[node])
    return ;
  marked[node] = power;
  if(1 < power) {
    for(int h = 0; h < g[node].size(); h++)
      mark(g[node][h], power - 1);
  }
}

int main() {
  std::ios::sync_with_stdio(0);
  std::cin.tie(0);

  int n, d;
  std::cin >> n >> d;
  for(int i = 1;i < n; i++) {
    int parent;
    std::cin >> parent;
    g[parent].push_back(i);
    g[i].push_back(parent);
  }
  dfs(0, -1);
  std::vector<int> id(n);
  for(int i = 0; i < n; i++)
    id[i] = i;
  std::sort(id.begin(), id.end(), compare);
  std::reverse(id.begin(), id.end());
  int result = 0;
  
  for(int i = 0; i < id.size(); i++ ){
    int node = id[i];
    if(marked[node] == 0) {
      result++;
      mark(node, d);
    }
  }
  std::cout << result;
  return 0;
}

Compilation message

catinatree.cpp: In function 'void dfs(int, int)':
catinatree.cpp:16:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   16 |   for(int h = 0; h < g[node].size(); h++) {
      |                  ~~^~~~~~~~~~~~~~~~
catinatree.cpp: In function 'void mark(int, int)':
catinatree.cpp:34:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   34 |     for(int h = 0; h < g[node].size(); h++)
      |                    ~~^~~~~~~~~~~~~~~~
catinatree.cpp: In function 'int main()':
catinatree.cpp:59:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   59 |   for(int i = 0; i < id.size(); i++ ){
      |                  ~~^~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
40.0 / 40.0

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

Subtask #3
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4992 KB Output is correct
2 Correct 3 ms 4992 KB Output is correct
3 Correct 3 ms 4992 KB Output is correct
4 Correct 3 ms 4992 KB Output is correct
5 Correct 3 ms 4992 KB Output is correct
6 Correct 4 ms 4992 KB Output is correct
7 Correct 4 ms 5120 KB Output is correct
8 Correct 4 ms 4992 KB Output is correct
9 Correct 3 ms 4992 KB Output is correct
10 Correct 3 ms 4992 KB Output is correct
11 Correct 4 ms 4992 KB Output is correct
12 Correct 3 ms 4992 KB Output is correct
13 Correct 4 ms 4992 KB Output is correct
14 Correct 4 ms 4992 KB Output is correct
15 Correct 3 ms 4992 KB Output is correct
16 Correct 4 ms 4992 KB Output is correct
17 Correct 4 ms 4992 KB Output is correct
18 Correct 3 ms 4992 KB Output is correct
19 Correct 3 ms 4992 KB Output is correct
20 Correct 3 ms 4992 KB Output is correct
21 Correct 4 ms 5120 KB Output is correct
22 Correct 3 ms 5120 KB Output is correct
23 Correct 4 ms 4992 KB Output is correct
24 Correct 3 ms 5120 KB Output is correct
25 Correct 4 ms 5120 KB Output is correct
26 Correct 4 ms 5120 KB Output is correct
27 Correct 4 ms 5120 KB Output is correct
28 Correct 4 ms 5120 KB Output is correct
29 Correct 4 ms 5120 KB Output is correct
30 Correct 6 ms 5120 KB Output is correct
31 Correct 5 ms 5120 KB Output is correct
32 Correct 6 ms 5120 KB Output is correct
33 Correct 4 ms 5120 KB Output is correct
34 Correct 5 ms 5120 KB Output is correct
35 Correct 4 ms 5120 KB Output is correct
36 Correct 5 ms 5120 KB Output is correct
37 Correct 4 ms 5120 KB Output is correct
38 Correct 4 ms 5120 KB Output is correct
39 Correct 4 ms 5120 KB Output is correct
40 Correct 7 ms 5120 KB Output is correct
41 Correct 79 ms 14408 KB Output is correct
42 Correct 46 ms 10040 KB Output is correct
43 Correct 64 ms 9976 KB Output is correct
44 Correct 58 ms 9992 KB Output is correct
45 Correct 55 ms 9976 KB Output is correct
46 Correct 135 ms 14968 KB Output is correct
47 Correct 235 ms 14968 KB Output is correct
48 Correct 147 ms 14968 KB Output is correct
49 Correct 158 ms 15096 KB Output is correct
50 Correct 47 ms 10232 KB Output is correct
51 Correct 40 ms 10232 KB Output is correct
52 Correct 41 ms 10232 KB Output is correct
53 Correct 75 ms 15480 KB Output is correct
54 Correct 84 ms 15480 KB Output is correct
55 Correct 89 ms 15480 KB Output is correct
56 Correct 4 ms 5248 KB Output is correct
57 Correct 11 ms 7040 KB Output is correct
58 Correct 45 ms 14072 KB Output is correct
59 Correct 132 ms 19576 KB Output is correct
60 Correct 78 ms 14580 KB Output is correct
61 Correct 119 ms 14328 KB Output is correct