oj.uz

답안 #970826

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
970826 2024-04-27T10:56:11 Z vjudge1 Meetings 2 (JOI21_meetings2) C++17
100 / 100
 406 ms 26308 KB 
#include<bits/stdc++.h>

using namespace std;

int n, u, v, subtree[200005], ans[200005], l[200005], l2[200005];
vector<int> adj[200005];
bool rm[200005];

void build(int u, int par) {
    subtree[u] = 1;
    for (int node: adj[u]) {
        if(node == par || rm[node]) continue;
        build(node, u);
        subtree[u] += subtree[node];
    }
}

int centroid(int u, int par, int sz) {
    for (int node: adj[u]) {
        if(node == par || rm[node]) continue;
        if(subtree[node] > sz / 2) return centroid(node, u, sz);
    }
    return u;
}

void dfs(int u, int par, int dis) {
    l[subtree[u]] = max(l[subtree[u]], dis + 1);
    //cout << "CHECK " << u << ' ' << subtree[u] << ' ' << dis + 1 << '\n';
    for (int node: adj[u]) {
        if(node == par || rm[node]) continue;
        dfs(node, u, dis + 1);
    }
}

void build2(int u, int par) {
    subtree[u] = 1;
    for (int node: adj[u]) {
        if(node == par || rm[node]) continue;
        build2(node, u);
        subtree[u] += subtree[node];
    }
}

void solve(int u) {
    build(u, -1);
    int C = centroid(u, -1, subtree[u]);
    build2(C, -1);
    rm[C] = true;
    int mx = 0;
    //cout << "C: " << C << '\n';
    for (int i = 1; i <= subtree[C]; i++) l2[i] = 1;
    for (int node: adj[C]) {
        if(rm[node]) continue;
        dfs(node, C, 1);
        mx = max(mx, subtree[node] + 5);
        for (int i = subtree[node] - 1; i >= 1; i--) l[i] = max(l[i], l[i + 1]);
        //if(C == 1) cout << l[1] << ' ' << l2[1] << '\n';
        for (int i = subtree[node]; i >= 1; i--) {
            ans[i * 2] = max(ans[i * 2], l2[i] + l[i] - 1);
            l2[i] = max(l2[i], l[i]);
            l[i] = 0;
        }
    }
    for (int i = 1; i <= mx; i++) l2[i] = l[i] = 0;
    for (int node: adj[C]) {
        if(rm[node]) continue;
        solve(node);
    }
}

signed main() {
    //freopen("fact.inp", "r", stdin);
    //freopen("fact.out", "w", stdout);
    cin >> n;
    for (int i = 1; i < n; i++) {
        cin >> u >> v;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }
    solve(1);
    for (int i = 1; i <= n; i++) {
        ans[i] = max(ans[i], 1);
        if(i % 2 == 1) cout << 1 << '\n';
        else cout << ans[i] << '\n';
    }
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 6488 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6584 KB Output is correct
4 Correct 2 ms 6492 KB Output is correct
5 Correct 2 ms 6492 KB Output is correct
6 Correct 2 ms 6492 KB Output is correct
7 Correct 2 ms 6492 KB Output is correct
8 Correct 2 ms 6492 KB Output is correct
9 Correct 2 ms 6580 KB Output is correct
10 Correct 1 ms 6488 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 2 ms 6748 KB Output is correct
13 Correct 2 ms 6488 KB Output is correct
14 Correct 1 ms 6600 KB Output is correct
15 Correct 2 ms 6492 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 1 ms 6492 KB Output is correct
18 Correct 2 ms 6572 KB Output is correct
19 Correct 1 ms 6596 KB Output is correct
20 Correct 1 ms 6492 KB Output is correct
21 Correct 2 ms 6488 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 6488 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6584 KB Output is correct
4 Correct 2 ms 6492 KB Output is correct
5 Correct 2 ms 6492 KB Output is correct
6 Correct 2 ms 6492 KB Output is correct
7 Correct 2 ms 6492 KB Output is correct
8 Correct 2 ms 6492 KB Output is correct
9 Correct 2 ms 6580 KB Output is correct
10 Correct 1 ms 6488 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 2 ms 6748 KB Output is correct
13 Correct 2 ms 6488 KB Output is correct
14 Correct 1 ms 6600 KB Output is correct
15 Correct 2 ms 6492 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 1 ms 6492 KB Output is correct
18 Correct 2 ms 6572 KB Output is correct
19 Correct 1 ms 6596 KB Output is correct
20 Correct 1 ms 6492 KB Output is correct
21 Correct 2 ms 6488 KB Output is correct
22 Correct 5 ms 6824 KB Output is correct
23 Correct 5 ms 6748 KB Output is correct
24 Correct 4 ms 6608 KB Output is correct
25 Correct 4 ms 7000 KB Output is correct
26 Correct 5 ms 6748 KB Output is correct
27 Correct 4 ms 6748 KB Output is correct
28 Correct 5 ms 6744 KB Output is correct
29 Correct 6 ms 6752 KB Output is correct
30 Correct 4 ms 6744 KB Output is correct
31 Correct 4 ms 6748 KB Output is correct
32 Correct 6 ms 7004 KB Output is correct
33 Correct 7 ms 7000 KB Output is correct
34 Correct 5 ms 6612 KB Output is correct
35 Correct 3 ms 6748 KB Output is correct
36 Correct 4 ms 6744 KB Output is correct
37 Correct 3 ms 6748 KB Output is correct
38 Correct 4 ms 6748 KB Output is correct

Subtask #3
80.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 6488 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6584 KB Output is correct
4 Correct 2 ms 6492 KB Output is correct
5 Correct 2 ms 6492 KB Output is correct
6 Correct 2 ms 6492 KB Output is correct
7 Correct 2 ms 6492 KB Output is correct
8 Correct 2 ms 6492 KB Output is correct
9 Correct 2 ms 6580 KB Output is correct
10 Correct 1 ms 6488 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 2 ms 6748 KB Output is correct
13 Correct 2 ms 6488 KB Output is correct
14 Correct 1 ms 6600 KB Output is correct
15 Correct 2 ms 6492 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 1 ms 6492 KB Output is correct
18 Correct 2 ms 6572 KB Output is correct
19 Correct 1 ms 6596 KB Output is correct
20 Correct 1 ms 6492 KB Output is correct
21 Correct 2 ms 6488 KB Output is correct
22 Correct 5 ms 6824 KB Output is correct
23 Correct 5 ms 6748 KB Output is correct
24 Correct 4 ms 6608 KB Output is correct
25 Correct 4 ms 7000 KB Output is correct
26 Correct 5 ms 6748 KB Output is correct
27 Correct 4 ms 6748 KB Output is correct
28 Correct 5 ms 6744 KB Output is correct
29 Correct 6 ms 6752 KB Output is correct
30 Correct 4 ms 6744 KB Output is correct
31 Correct 4 ms 6748 KB Output is correct
32 Correct 6 ms 7004 KB Output is correct
33 Correct 7 ms 7000 KB Output is correct
34 Correct 5 ms 6612 KB Output is correct
35 Correct 3 ms 6748 KB Output is correct
36 Correct 4 ms 6744 KB Output is correct
37 Correct 3 ms 6748 KB Output is correct
38 Correct 4 ms 6748 KB Output is correct
39 Correct 337 ms 17452 KB Output is correct
40 Correct 253 ms 16976 KB Output is correct
41 Correct 278 ms 17128 KB Output is correct
42 Correct 228 ms 17308 KB Output is correct
43 Correct 265 ms 17496 KB Output is correct
44 Correct 297 ms 17272 KB Output is correct
45 Correct 406 ms 22360 KB Output is correct
46 Correct 341 ms 26308 KB Output is correct
47 Correct 136 ms 17608 KB Output is correct
48 Correct 134 ms 17880 KB Output is correct
49 Correct 258 ms 18064 KB Output is correct
50 Correct 151 ms 17976 KB Output is correct
51 Correct 263 ms 25380 KB Output is correct