oj.uz

답안 #649178

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
649178 2022-10-09T14:24:24 Z LeonaRaging Cat in a tree (BOI17_catinatree) C++14
100 / 100
 338 ms 36296 KB 
#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define ll long long
#define pb push_back
#define db(val) "[" #val " = " << (val) << "] "

const ll mod = 1e9 + 7;
const int maxn = 2e5 + 4;
const int INF = 1e9;
const int N = 18;

int n, d, h[maxn], par[maxn], mn[maxn], dis[maxn][20], cen_dep[maxn];
vector<int> adj[maxn], nodes;
bool used[maxn];

void dfs(int u, int p) {
    for (int v : adj[u])
        if (v != p) {
            h[v] = h[u] + 1;
            dfs(v, u);
        }
}

void Solve(int u, int p, int dep, int c) {
    dis[u][c] = dep;
    for (int v : adj[u])
        if (v != p && !used[v]) 
            Solve(v, u, dep + 1, c);
}

struct Centroid_Decomposition {
    int sz[maxn];
    int dfs(int u, int p) {
        sz[u] = 1;
        for (int v : adj[u])
            if (v != p && !used[v])
                sz[u] += dfs(v, u);
        return sz[u];
    }
    int Centroid(int u, int p, int tot) {
        for (int v : adj[u])
            if (v != p && !used[v] && sz[v] > tot / 2)
                return Centroid(v, u, tot);
        return u;
    }
    void build(int u, int p, int dep) {
        int c = Centroid(u, 0, dfs(u, 0));
        cen_dep[c] = dep;
        Solve(c, 0, 0, dep);
        used[c] = 1;
        par[c] = p;
        for (int v : adj[c]) 
            if (!used[v])
                build(v, c, dep + 1);
    }
} Cen;

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    //freopen(".INP", "r", stdin);
    //freopen(".OUT", "w", stdout);
    cin >> n >> d;
    for (int u = 2; u <= n; u++) {
        int v; cin >> v; v++;
        adj[u].pb(v);
        adj[v].pb(u);
    }
    dfs(1, 0);
    Cen.build(1, 0, 0);
    for (int u = 1; u <= n; u++)
        nodes.pb(u);
    sort(nodes.begin(), nodes.end(),[&](int u, int v) {
        return h[u] > h[v];
    });
    int res = 0;
    memset(mn, 63, sizeof mn);
    for (int u : nodes) {
        int dep = mn[0], v = u;
        while (v) {
            dep = min(dep, dis[u][cen_dep[v]] + mn[v]);
            v = par[v];
        }
        if (dep < d) continue;
        res++;
        v = u;
        while (v) {
            mn[v] = min(mn[v], dis[u][cen_dep[v]]);
            v = par[v];
        }
    }   
    cout << res;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 5716 KB Output is correct
2 Correct 5 ms 5716 KB Output is correct
3 Correct 4 ms 5832 KB Output is correct
4 Correct 3 ms 5716 KB Output is correct
5 Correct 3 ms 5716 KB Output is correct
6 Correct 3 ms 5716 KB Output is correct
7 Correct 3 ms 5716 KB Output is correct
8 Correct 4 ms 5716 KB Output is correct
9 Correct 3 ms 5716 KB Output is correct
10 Correct 3 ms 5716 KB Output is correct
11 Correct 3 ms 5716 KB Output is correct
12 Correct 3 ms 5716 KB Output is correct
13 Correct 3 ms 5716 KB Output is correct
14 Correct 3 ms 5716 KB Output is correct
15 Correct 4 ms 5716 KB Output is correct
16 Correct 3 ms 5716 KB Output is correct
17 Correct 3 ms 5716 KB Output is correct
18 Correct 3 ms 5716 KB Output is correct
19 Correct 3 ms 5716 KB Output is correct
20 Correct 3 ms 5716 KB Output is correct

Subtask #2
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 5716 KB Output is correct
2 Correct 5 ms 5716 KB Output is correct
3 Correct 4 ms 5832 KB Output is correct
4 Correct 3 ms 5716 KB Output is correct
5 Correct 3 ms 5716 KB Output is correct
6 Correct 3 ms 5716 KB Output is correct
7 Correct 3 ms 5716 KB Output is correct
8 Correct 4 ms 5716 KB Output is correct
9 Correct 3 ms 5716 KB Output is correct
10 Correct 3 ms 5716 KB Output is correct
11 Correct 3 ms 5716 KB Output is correct
12 Correct 3 ms 5716 KB Output is correct
13 Correct 3 ms 5716 KB Output is correct
14 Correct 3 ms 5716 KB Output is correct
15 Correct 4 ms 5716 KB Output is correct
16 Correct 3 ms 5716 KB Output is correct
17 Correct 3 ms 5716 KB Output is correct
18 Correct 3 ms 5716 KB Output is correct
19 Correct 3 ms 5716 KB Output is correct
20 Correct 3 ms 5716 KB Output is correct
21 Correct 4 ms 5972 KB Output is correct
22 Correct 3 ms 5844 KB Output is correct
23 Correct 5 ms 5844 KB Output is correct
24 Correct 4 ms 5844 KB Output is correct
25 Correct 4 ms 5972 KB Output is correct
26 Correct 4 ms 5972 KB Output is correct
27 Correct 4 ms 5972 KB Output is correct
28 Correct 4 ms 5972 KB Output is correct
29 Correct 4 ms 6044 KB Output is correct
30 Correct 5 ms 6048 KB Output is correct
31 Correct 5 ms 5972 KB Output is correct
32 Correct 4 ms 5972 KB Output is correct
33 Correct 6 ms 6044 KB Output is correct
34 Correct 4 ms 5972 KB Output is correct
35 Correct 4 ms 5972 KB Output is correct
36 Correct 4 ms 5972 KB Output is correct
37 Correct 4 ms 5972 KB Output is correct
38 Correct 4 ms 5972 KB Output is correct
39 Correct 4 ms 5972 KB Output is correct
40 Correct 4 ms 5972 KB Output is correct

Subtask #3
49.0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 5716 KB Output is correct
2 Correct 5 ms 5716 KB Output is correct
3 Correct 4 ms 5832 KB Output is correct
4 Correct 3 ms 5716 KB Output is correct
5 Correct 3 ms 5716 KB Output is correct
6 Correct 3 ms 5716 KB Output is correct
7 Correct 3 ms 5716 KB Output is correct
8 Correct 4 ms 5716 KB Output is correct
9 Correct 3 ms 5716 KB Output is correct
10 Correct 3 ms 5716 KB Output is correct
11 Correct 3 ms 5716 KB Output is correct
12 Correct 3 ms 5716 KB Output is correct
13 Correct 3 ms 5716 KB Output is correct
14 Correct 3 ms 5716 KB Output is correct
15 Correct 4 ms 5716 KB Output is correct
16 Correct 3 ms 5716 KB Output is correct
17 Correct 3 ms 5716 KB Output is correct
18 Correct 3 ms 5716 KB Output is correct
19 Correct 3 ms 5716 KB Output is correct
20 Correct 3 ms 5716 KB Output is correct
21 Correct 4 ms 5972 KB Output is correct
22 Correct 3 ms 5844 KB Output is correct
23 Correct 5 ms 5844 KB Output is correct
24 Correct 4 ms 5844 KB Output is correct
25 Correct 4 ms 5972 KB Output is correct
26 Correct 4 ms 5972 KB Output is correct
27 Correct 4 ms 5972 KB Output is correct
28 Correct 4 ms 5972 KB Output is correct
29 Correct 4 ms 6044 KB Output is correct
30 Correct 5 ms 6048 KB Output is correct
31 Correct 5 ms 5972 KB Output is correct
32 Correct 4 ms 5972 KB Output is correct
33 Correct 6 ms 6044 KB Output is correct
34 Correct 4 ms 5972 KB Output is correct
35 Correct 4 ms 5972 KB Output is correct
36 Correct 4 ms 5972 KB Output is correct
37 Correct 4 ms 5972 KB Output is correct
38 Correct 4 ms 5972 KB Output is correct
39 Correct 4 ms 5972 KB Output is correct
40 Correct 4 ms 5972 KB Output is correct
41 Correct 94 ms 31016 KB Output is correct
42 Correct 104 ms 19040 KB Output is correct
43 Correct 132 ms 19036 KB Output is correct
44 Correct 107 ms 19012 KB Output is correct
45 Correct 102 ms 19020 KB Output is correct
46 Correct 338 ms 32108 KB Output is correct
47 Correct 297 ms 32112 KB Output is correct
48 Correct 309 ms 32296 KB Output is correct
49 Correct 284 ms 32064 KB Output is correct
50 Correct 63 ms 19400 KB Output is correct
51 Correct 58 ms 19508 KB Output is correct
52 Correct 64 ms 19480 KB Output is correct
53 Correct 158 ms 32960 KB Output is correct
54 Correct 155 ms 33008 KB Output is correct
55 Correct 153 ms 32920 KB Output is correct
56 Correct 4 ms 6100 KB Output is correct
57 Correct 16 ms 9300 KB Output is correct
58 Correct 75 ms 21728 KB Output is correct
59 Correct 273 ms 36296 KB Output is correct
60 Correct 94 ms 32576 KB Output is correct
61 Correct 155 ms 31812 KB Output is correct