oj.uz

Submission #554179

# Submission time Handle Problem Language Result Execution time Memory
554179 2022-04-27T19:42:37 Z Alexandruabcde Cat in a tree (BOI17_catinatree) C++14
100 / 100
 73 ms 24308 KB 
#include <bits/stdc++.h>

using namespace std;

constexpr int NMAX = 2e5 + 5;

int N, D;
vector <int> G[NMAX];

void Read () {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    cin >> N >> D;

    for (int i = 2; i <= N; ++ i ) {
        int x;
        cin >> x;
        ++ x;

        G[x].push_back(i);
    }
}

int dp[NMAX];
int dist[NMAX];
int Last[NMAX];
bool used[NMAX];

bool cmp (int a, int b) {
    return dist[a] < dist[b];
}

void Dfs (int Node, int dad = 0) {
    bool fr = 1;
    for (auto it : G[Node]) {
        if (it == dad) continue;

        fr = 0;
        Dfs(it, Node);
    }

    if (fr) {
        used[Node] = true;
        Last[Node] = Node;
        dp[Node] = 1;
        dist[Node] = 0;
        return;
    }

    vector <int> sons;
    for (auto it : G[Node]) {
        if (it == dad) continue;

        dp[Node] += dp[it];
        sons.push_back(it);
    }

    sort(sons.begin(), sons.end(), cmp);
    int worst = sons[0];
    for (int i = 1; i < sons.size(); ++ i ) {
        if (dist[worst] + dist[sons[i]] + 2 < D) {
            used[Last[worst]] = false;
            worst = sons[i];
            -- dp[Node];
        }
    }

    Last[Node] = Last[worst];
    dist[Node] = dist[worst] + 1;

    if (dist[Node] >= D) {
        dp[Node] ++;
        dist[Node] = 0;
        Last[Node] = Node;
        used[Node] = true;
    }
}

int main () {
    Read();
    Dfs(1);

    cout << dp[1] << '\n';

    /*
    for (int i = 1; i <= N; ++ i )
        if (used[i]) cout << i << " ";
    */

    return 0;
}

Compilation message

catinatree.cpp: In function 'void Dfs(int, int)':
catinatree.cpp:61:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   61 |     for (int i = 1; i < sons.size(); ++ i ) {
      |                     ~~^~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
40.0 / 40.0

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

Subtask #3
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 5020 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 5016 KB Output is correct
9 Correct 3 ms 5020 KB Output is correct
10 Correct 3 ms 5024 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 4920 KB Output is correct
15 Correct 3 ms 5028 KB Output is correct
16 Correct 3 ms 4948 KB Output is correct
17 Correct 4 ms 5024 KB Output is correct
18 Correct 3 ms 5028 KB Output is correct
19 Correct 3 ms 5016 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 3 ms 5284 KB Output is correct
22 Correct 3 ms 5024 KB Output is correct
23 Correct 3 ms 4948 KB Output is correct
24 Correct 3 ms 4948 KB Output is correct
25 Correct 3 ms 4948 KB Output is correct
26 Correct 3 ms 5020 KB Output is correct
27 Correct 3 ms 5024 KB Output is correct
28 Correct 3 ms 5028 KB Output is correct
29 Correct 3 ms 5076 KB Output is correct
30 Correct 3 ms 5060 KB Output is correct
31 Correct 4 ms 5076 KB Output is correct
32 Correct 3 ms 4948 KB Output is correct
33 Correct 3 ms 5076 KB Output is correct
34 Correct 3 ms 5076 KB Output is correct
35 Correct 3 ms 4948 KB Output is correct
36 Correct 3 ms 5076 KB Output is correct
37 Correct 3 ms 5076 KB Output is correct
38 Correct 3 ms 5076 KB Output is correct
39 Correct 3 ms 5076 KB Output is correct
40 Correct 3 ms 5204 KB Output is correct
41 Correct 40 ms 12580 KB Output is correct
42 Correct 27 ms 8532 KB Output is correct
43 Correct 27 ms 8408 KB Output is correct
44 Correct 26 ms 8460 KB Output is correct
45 Correct 26 ms 8468 KB Output is correct
46 Correct 70 ms 11936 KB Output is correct
47 Correct 73 ms 11980 KB Output is correct
48 Correct 70 ms 11940 KB Output is correct
49 Correct 69 ms 11988 KB Output is correct
50 Correct 15 ms 7196 KB Output is correct
51 Correct 14 ms 7156 KB Output is correct
52 Correct 15 ms 7252 KB Output is correct
53 Correct 30 ms 9452 KB Output is correct
54 Correct 28 ms 9372 KB Output is correct
55 Correct 29 ms 9384 KB Output is correct
56 Correct 3 ms 5204 KB Output is correct
57 Correct 8 ms 8492 KB Output is correct
58 Correct 27 ms 20836 KB Output is correct
59 Correct 57 ms 24308 KB Output is correct
60 Correct 41 ms 13096 KB Output is correct
61 Correct 51 ms 12556 KB Output is correct