oj.uz

답안 #924924

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
924924 2024-02-10T05:00:57 Z Ghulam_Junaid Cat in a tree (BOI17_catinatree) C++17
100 / 100
 667 ms 38088 KB 
#include <bits/stdc++.h>
using namespace std;
 
const int N = 2e5 + 10;
const int LG = 18;
const int T = 100;

int n, d, par[N][LG], dist[N], vis[N], h[N];
bool mark[N];

vector<int> g[N], buffer;
 
void dfs(int v, int p = -1){
    for (int u : g[v]){
        if (u == p) continue;
        dist[u] = dist[v] + 1;
        
        h[u] = h[v] + 1;
        for (int i = 1; i < LG; i ++)
            if (par[u][i] != -1)
                par[u][i] = par[par[u][i - 1]][i - 1];

        dfs(u, v);
    }
}

inline int lca(int u, int v){
    if (h[u] > h[v])
        swap(u, v);

    int d = h[v] - h[u];
    for (int i = 0; i < LG; i ++)
        if ((1 << i) & d)
            v = par[v][i];

    if (u == v) return v;

    for (int i = LG - 1; i >= 0; i --)
        if (par[u][i] != par[v][i])
            u = par[u][i], v = par[v][i];

    return par[v][0];
}

inline int distance(int u, int v){
    return h[u] + h[v] - 2 * h[lca(u, v)];
}
 
inline void bfs(){
    for (int i = 0; i < n; i ++)
        dist[i] = n + 100;

    queue<int> q;
    for (int x : buffer){
        q.push(x);
        dist[x] = 0;
    }

    while (!q.empty()){
        int v = q.front();
        q.pop();

        for (int u : g[v]){
            if (dist[u] > dist[v] + 1){
                dist[u] = dist[v] + 1;
                if (dist[u] < d)
                    q.push(u);
            }
        }
    }

    for (int i = 0; i < n; i ++)
        vis[i] |= (dist[i] < d);
}
 
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    cin >> n >> d;
    for (int i = 1; i < n; i ++){
        cin >> par[i][0];
        g[par[i][0]].push_back(i);
        g[i].push_back(par[i][0]);
    }
 
    dfs(0);
 
    vector<pair<int, int>> vec;
    for (int i = 0; i < n; i ++)
        vec.push_back({dist[i], i});
    sort(vec.begin(), vec.end());

    for (int i = 0; i < n; i ++)
        dist[i] = d + 1;

    int ans = 0;
    while (!vec.empty()){
        auto p = vec.back();
        vec.pop_back();
 
        int v = p.second;
        // cout << v << " : " << dist[v] << endl;
        if (vis[v])
            continue;
 
        bool bad = 0;
        for (int x : buffer){
            if (distance(x, v) < d){
                bad = 1;
                break;
            }
        }

        if (bad) continue;

        buffer.push_back(v);
        ans++;

        if (buffer.size() > T){
            bfs();
            buffer.clear();
        }
    }
 
    cout << ans << endl;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
40.0 / 40.0

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

Subtask #3
49.0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 8792 KB Output is correct
2 Correct 2 ms 8796 KB Output is correct
3 Correct 1 ms 8796 KB Output is correct
4 Correct 2 ms 8796 KB Output is correct
5 Correct 2 ms 8792 KB Output is correct
6 Correct 2 ms 8796 KB Output is correct
7 Correct 2 ms 8792 KB Output is correct
8 Correct 2 ms 8796 KB Output is correct
9 Correct 2 ms 8792 KB Output is correct
10 Correct 2 ms 8796 KB Output is correct
11 Correct 2 ms 8796 KB Output is correct
12 Correct 1 ms 8796 KB Output is correct
13 Correct 2 ms 8796 KB Output is correct
14 Correct 1 ms 8796 KB Output is correct
15 Correct 2 ms 8800 KB Output is correct
16 Correct 2 ms 9044 KB Output is correct
17 Correct 2 ms 8792 KB Output is correct
18 Correct 2 ms 8796 KB Output is correct
19 Correct 2 ms 8792 KB Output is correct
20 Correct 2 ms 8792 KB Output is correct
21 Correct 2 ms 8792 KB Output is correct
22 Correct 3 ms 8796 KB Output is correct
23 Correct 2 ms 8772 KB Output is correct
24 Correct 2 ms 8796 KB Output is correct
25 Correct 4 ms 8796 KB Output is correct
26 Correct 3 ms 8796 KB Output is correct
27 Correct 3 ms 8792 KB Output is correct
28 Correct 6 ms 8996 KB Output is correct
29 Correct 5 ms 8796 KB Output is correct
30 Correct 2 ms 8796 KB Output is correct
31 Correct 2 ms 8796 KB Output is correct
32 Correct 2 ms 8792 KB Output is correct
33 Correct 2 ms 8796 KB Output is correct
34 Correct 2 ms 8932 KB Output is correct
35 Correct 2 ms 8792 KB Output is correct
36 Correct 3 ms 8852 KB Output is correct
37 Correct 3 ms 8796 KB Output is correct
38 Correct 2 ms 8796 KB Output is correct
39 Correct 2 ms 8796 KB Output is correct
40 Correct 4 ms 8792 KB Output is correct
41 Correct 482 ms 29376 KB Output is correct
42 Correct 396 ms 19144 KB Output is correct
43 Correct 48 ms 19412 KB Output is correct
44 Correct 46 ms 19412 KB Output is correct
45 Correct 44 ms 19412 KB Output is correct
46 Correct 667 ms 30416 KB Output is correct
47 Correct 127 ms 30416 KB Output is correct
48 Correct 130 ms 30412 KB Output is correct
49 Correct 151 ms 30420 KB Output is correct
50 Correct 72 ms 19660 KB Output is correct
51 Correct 180 ms 19656 KB Output is correct
52 Correct 67 ms 19860 KB Output is correct
53 Correct 253 ms 31252 KB Output is correct
54 Correct 262 ms 31220 KB Output is correct
55 Correct 141 ms 31176 KB Output is correct
56 Correct 7 ms 9048 KB Output is correct
57 Correct 16 ms 13404 KB Output is correct
58 Correct 71 ms 26144 KB Output is correct
59 Correct 188 ms 38088 KB Output is correct
60 Correct 610 ms 29892 KB Output is correct
61 Correct 133 ms 29132 KB Output is correct