Submission #799613

# Submission time Handle Problem Language Result Execution time Memory
799613 2023-07-31T16:37:50 Z winthemcut3 Cat in a tree (BOI17_catinatree) C++14
100 / 100
60 ms 28072 KB
#include <bits/stdc++.h>
#define FastIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define ll long long
#define PB push_back
#define ALL(v) (v).begin(), (v).end()
#define FOR(i, a, b) for (int i = (a), _b = (b); i <= _b; i++)
#define FORD(i, b, a) for (int i = (b), _a = (a); i >= _a; i--)
#define fi   first
#define se   second
#define BIT(x, i) (((x) >> (i)) & 1)
using namespace std;

/** END OF TEMPLATE **/

const int mxN = 2e5 + 5;
typedef pair<int, int> pii;
int n, k;
vector<int> g[mxN];
int f[mxN], d[mxN];
void dfs(int u, int par) {
    f[u] = 1;
    vector<int> t{0};
    for(int &v : g[u]) {
        if(v == par) continue;
        dfs(v, u);
        t.PB(d[v]);
        f[u] += f[v];
    }
    sort(ALL(t));
    //cerr << u << ' ' << t.size() << ' ' << f[u] << '\n';
    int pos = t.size() - 1;
    for(int i = 0; i <= (int)t.size()-2; i++) {
        if(t[i] + t[i+1] < k) f[u]--;
        else {
            pos = i;
            break;
        }
    }
    d[u] = t[pos] + 1;
   // cerr << u << ' ' << d[u] << ' ' << f[u] << '\n';
}
int main()
{
    FastIO;
    //freopen(".inp", "r", stdin);
    //freopen(".out", "w", stdout);
    cin >> n >> k;
    FOR(i, 2, n) {
        int x; cin >> x;
        g[i].PB(x+1); g[x+1].PB(i);
    }
    dfs(1, 0);
    cout << f[1];
    return 0;
}

/*

*/
# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4928 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 3 ms 5024 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 2 ms 5020 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Correct 2 ms 4948 KB Output is correct
11 Correct 2 ms 5020 KB Output is correct
12 Correct 2 ms 4948 KB Output is correct
13 Correct 2 ms 4948 KB Output is correct
14 Correct 2 ms 4948 KB Output is correct
15 Correct 2 ms 4948 KB Output is correct
16 Correct 2 ms 5028 KB Output is correct
17 Correct 2 ms 4948 KB Output is correct
18 Correct 2 ms 4948 KB Output is correct
19 Correct 3 ms 5024 KB Output is correct
20 Correct 2 ms 5024 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4928 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 3 ms 5024 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 2 ms 5020 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Correct 2 ms 4948 KB Output is correct
11 Correct 2 ms 5020 KB Output is correct
12 Correct 2 ms 4948 KB Output is correct
13 Correct 2 ms 4948 KB Output is correct
14 Correct 2 ms 4948 KB Output is correct
15 Correct 2 ms 4948 KB Output is correct
16 Correct 2 ms 5028 KB Output is correct
17 Correct 2 ms 4948 KB Output is correct
18 Correct 2 ms 4948 KB Output is correct
19 Correct 3 ms 5024 KB Output is correct
20 Correct 2 ms 5024 KB Output is correct
21 Correct 3 ms 5204 KB Output is correct
22 Correct 3 ms 5020 KB Output is correct
23 Correct 2 ms 4948 KB Output is correct
24 Correct 2 ms 4948 KB Output is correct
25 Correct 3 ms 4948 KB Output is correct
26 Correct 3 ms 5076 KB Output is correct
27 Correct 3 ms 4948 KB Output is correct
28 Correct 3 ms 5076 KB Output is correct
29 Correct 3 ms 5076 KB Output is correct
30 Correct 3 ms 5076 KB Output is correct
31 Correct 3 ms 5032 KB Output is correct
32 Correct 2 ms 5076 KB Output is correct
33 Correct 2 ms 5076 KB Output is correct
34 Correct 3 ms 5076 KB Output is correct
35 Correct 2 ms 5076 KB Output is correct
36 Correct 2 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
# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4928 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 3 ms 5024 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 2 ms 5020 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Correct 2 ms 4948 KB Output is correct
11 Correct 2 ms 5020 KB Output is correct
12 Correct 2 ms 4948 KB Output is correct
13 Correct 2 ms 4948 KB Output is correct
14 Correct 2 ms 4948 KB Output is correct
15 Correct 2 ms 4948 KB Output is correct
16 Correct 2 ms 5028 KB Output is correct
17 Correct 2 ms 4948 KB Output is correct
18 Correct 2 ms 4948 KB Output is correct
19 Correct 3 ms 5024 KB Output is correct
20 Correct 2 ms 5024 KB Output is correct
21 Correct 3 ms 5204 KB Output is correct
22 Correct 3 ms 5020 KB Output is correct
23 Correct 2 ms 4948 KB Output is correct
24 Correct 2 ms 4948 KB Output is correct
25 Correct 3 ms 4948 KB Output is correct
26 Correct 3 ms 5076 KB Output is correct
27 Correct 3 ms 4948 KB Output is correct
28 Correct 3 ms 5076 KB Output is correct
29 Correct 3 ms 5076 KB Output is correct
30 Correct 3 ms 5076 KB Output is correct
31 Correct 3 ms 5032 KB Output is correct
32 Correct 2 ms 5076 KB Output is correct
33 Correct 2 ms 5076 KB Output is correct
34 Correct 3 ms 5076 KB Output is correct
35 Correct 2 ms 5076 KB Output is correct
36 Correct 2 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 41 ms 14020 KB Output is correct
42 Correct 24 ms 9556 KB Output is correct
43 Correct 23 ms 9556 KB Output is correct
44 Correct 24 ms 9588 KB Output is correct
45 Correct 24 ms 9556 KB Output is correct
46 Correct 53 ms 14164 KB Output is correct
47 Correct 54 ms 14208 KB Output is correct
48 Correct 54 ms 14196 KB Output is correct
49 Correct 53 ms 14212 KB Output is correct
50 Correct 17 ms 9812 KB Output is correct
51 Correct 19 ms 9776 KB Output is correct
52 Correct 16 ms 9752 KB Output is correct
53 Correct 38 ms 14652 KB Output is correct
54 Correct 41 ms 14652 KB Output is correct
55 Correct 45 ms 14628 KB Output is correct
56 Correct 3 ms 5204 KB Output is correct
57 Correct 7 ms 8788 KB Output is correct
58 Correct 27 ms 22060 KB Output is correct
59 Correct 60 ms 28072 KB Output is correct
60 Correct 39 ms 14148 KB Output is correct
61 Correct 44 ms 13560 KB Output is correct