oj.uz

Submission #844929

# Submission time Handle Problem Language Result Execution time Memory
844929 2023-09-06T09:16:28 Z Nhoksocqt1 Cat in a tree (BOI17_catinatree) C++17
100 / 100
 215 ms 50260 KB 
#include<bits/stdc++.h>
using namespace std;

#define inf 0x3f3f3f3f
#define sz(x) int((x).size())
#define fi first
#define se second
typedef long long ll;
typedef pair<int, int> ii;

template<class X, class Y>
	inline bool maximize(X &x, const Y &y) {return (x < y ? x = y, 1 : 0);}
template<class X, class Y>
	inline bool minimize(X &x, const Y &y) {return (x > y ? x = y, 1 : 0);}

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int Random(int l, int r) {
    return uniform_int_distribution<int>(l, r)(rng);
}

const int MAXN = 200005;

ii node[MAXN];
vector<int> adj[MAXN];
int dist[MAXN][20], centroidPar[MAXN], centroidDepth[MAXN];
int sz[MAXN], distc[MAXN], depth[MAXN], pa[MAXN], numNode, minDist;
bool dx[MAXN];

void preDfs(int u) {
    for (int it = 0; it < sz(adj[u]); ++it) {
        int v(adj[u][it]);
        if(v != pa[u]) {
            depth[v] = 1 + depth[u];
            preDfs(v);
        }
    }
}

int dfsSize(int u, int p) {
    sz[u] = 1;
    for (int it = 0; it < sz(adj[u]); ++it) {
        int v(adj[u][it]);
        if(!dx[v] && v != p)
            sz[u] += dfsSize(v, u);
    }

    return sz[u];
}

int centroid(int u, int p, int nSize) {
    for (int it = 0; it < sz(adj[u]); ++it) {
        int v(adj[u][it]);
        if(!dx[v] && v != p && sz[v] > nSize / 2)
            return centroid(v, u, nSize);
    }

    return u;
}

void dfsDist(int u, int p, int depth) {
    for (int it = 0; it < sz(adj[u]); ++it) {
        int v(adj[u][it]);
        if(!dx[v] && v != p) {
            dist[v][depth] = dist[u][depth] + 1;
            dfsDist(v, u, depth);
        }
    }
}

void build(int u, int p, int depth = 0) {
    int nSize = dfsSize(u, p);
    int c = centroid(u, p, nSize);

    centroidPar[c] = p;
    centroidDepth[c] = depth;
    dfsDist(c, -1, depth);

    dx[c] = 1;
    for (int it = 0; it < sz(adj[c]); ++it) {
        int v(adj[c][it]);
        if(dx[v])
            continue;

        build(v, c, depth + 1);
    }
}

set<int> Set[MAXN];

void update(int u) {
    for (int v = u, cnt = centroidDepth[u]; v != 0; --cnt, v = centroidPar[v])
        distc[v] = min(distc[v], dist[u][cnt]);
}

int query(int u) {
    int res(1e9);
    for (int v = u, cnt = centroidDepth[u]; v != 0; --cnt, v = centroidPar[v])
        res = min(res, distc[v] + dist[u][cnt]);

    return res;
}

void process() {
    cin >> numNode >> minDist;
    for (int u = 2; u <= numNode; ++u) {
        cin >> pa[u]; ++pa[u];
        adj[pa[u]].push_back(u);
        adj[u].push_back(pa[u]);
    }

    depth[1] = 1;
    preDfs(1);

    build(1, 0);
    for (int i = 1; i <= numNode; ++i) {
        node[i] = {depth[i], i};
        distc[i] = 1e9;
    }

    int res(0);
    sort(node + 1, node + numNode + 1, greater<ii>());
    for (int i = 1; i <= numNode; ++i) {
        int u(node[i].se);
        if(query(u) < minDist)
            continue;

        update(u);
        ++res;
    }

    cout << res;
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    process();
    return 0;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
40.0 / 40.0

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

Subtask #3
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 21080 KB Output is correct
2 Correct 5 ms 21084 KB Output is correct
3 Correct 4 ms 21080 KB Output is correct
4 Correct 4 ms 21080 KB Output is correct
5 Correct 4 ms 21080 KB Output is correct
6 Correct 4 ms 21080 KB Output is correct
7 Correct 3 ms 21084 KB Output is correct
8 Correct 4 ms 21084 KB Output is correct
9 Correct 4 ms 21080 KB Output is correct
10 Correct 4 ms 21084 KB Output is correct
11 Correct 4 ms 21080 KB Output is correct
12 Correct 3 ms 21080 KB Output is correct
13 Correct 4 ms 21080 KB Output is correct
14 Correct 4 ms 21080 KB Output is correct
15 Correct 5 ms 21152 KB Output is correct
16 Correct 4 ms 21080 KB Output is correct
17 Correct 4 ms 21080 KB Output is correct
18 Correct 4 ms 21080 KB Output is correct
19 Correct 4 ms 21080 KB Output is correct
20 Correct 4 ms 21084 KB Output is correct
21 Correct 4 ms 21080 KB Output is correct
22 Correct 4 ms 21080 KB Output is correct
23 Correct 4 ms 21084 KB Output is correct
24 Correct 4 ms 21080 KB Output is correct
25 Correct 4 ms 21080 KB Output is correct
26 Correct 4 ms 21080 KB Output is correct
27 Correct 5 ms 21080 KB Output is correct
28 Correct 5 ms 21284 KB Output is correct
29 Correct 5 ms 21080 KB Output is correct
30 Correct 7 ms 21080 KB Output is correct
31 Correct 4 ms 21080 KB Output is correct
32 Correct 4 ms 21080 KB Output is correct
33 Correct 4 ms 21080 KB Output is correct
34 Correct 5 ms 21084 KB Output is correct
35 Correct 4 ms 21080 KB Output is correct
36 Correct 4 ms 21080 KB Output is correct
37 Correct 4 ms 21080 KB Output is correct
38 Correct 4 ms 21080 KB Output is correct
39 Correct 4 ms 21080 KB Output is correct
40 Correct 4 ms 21080 KB Output is correct
41 Correct 65 ms 43468 KB Output is correct
42 Correct 74 ms 33396 KB Output is correct
43 Correct 76 ms 33276 KB Output is correct
44 Correct 72 ms 33500 KB Output is correct
45 Correct 78 ms 33364 KB Output is correct
46 Correct 192 ms 44112 KB Output is correct
47 Correct 201 ms 44140 KB Output is correct
48 Correct 213 ms 44280 KB Output is correct
49 Correct 207 ms 44100 KB Output is correct
50 Correct 57 ms 33720 KB Output is correct
51 Correct 49 ms 33616 KB Output is correct
52 Correct 59 ms 33896 KB Output is correct
53 Correct 130 ms 44624 KB Output is correct
54 Correct 133 ms 44624 KB Output is correct
55 Correct 130 ms 44612 KB Output is correct
56 Correct 5 ms 21080 KB Output is correct
57 Correct 15 ms 24408 KB Output is correct
58 Correct 70 ms 38940 KB Output is correct
59 Correct 215 ms 50260 KB Output is correct
60 Correct 71 ms 43808 KB Output is correct
61 Correct 118 ms 43600 KB Output is correct