oj.uz

Submission #932300

# Submission time Handle Problem Language Result Execution time Memory
932300 2024-02-23T07:35:39 Z Pannda Meetings 2 (JOI21_meetings2) C++17
100 / 100
 153 ms 59568 KB 
#include <bits/stdc++.h>
using namespace std;

struct Tree {
    static int getCentroid(int n, vector<vector<int>> &adj) {
        vector<int> siz(n);
        auto dfs = [&](auto self, int u, int p) -> void {
            siz[u] = 1;
            for (int v : adj[u]) {
                if (v == p) continue;
                self(self, v, u);
                siz[u] += siz[v];
            }
        };
        dfs(dfs, 0, -1);
        auto cen = [&](auto self, int u, int p) -> int {
            for (int v : adj[u]) {
                if (v == p) continue;
                if (siz[v] > n / 2) return self(self, v, u);
            }
            return u;
        };
        return cen(cen, 0, -1);
    }

    vector<int> siz, parent, depth, head;
    Tree(int n, vector<vector<int>> &adj, int root = 0) : siz(n), parent(n), depth(n), head(n) {
        auto dfs = [&](auto self, int u, int p) -> void {
            siz[u] = 1;
            parent[u] = p;
            depth[u] = p == -1 ? 0 : depth[p] + 1;
            for (int v : adj[u]) {
                if (v == p) continue;
                self(self, v, u);
                siz[u] += siz[v];
            }
        };
        dfs(dfs, root, -1);
        auto decompose = [&](auto self, int u, int h) -> void {
            head[u] = h;
            int heavy = -1;
            for (int v : adj[u]) {
                if (v == parent[u]) continue;
                if (heavy == -1 || siz[v] > siz[heavy]) heavy = v;
            }
            if (heavy != -1) self(self, heavy, h);
            for (int v : adj[u]) {
                if (v == parent[u] || v == heavy) continue;
                self(self, v, v);
            }
        };
        decompose(decompose, root, root);
    }

    int getLca(int u, int v) {
        for (; head[u] != head[v]; v = parent[head[v]]) if (depth[head[u]] > depth[head[v]]) swap(u, v);
        if (depth[u] > depth[v]) swap(u, v);
        return u;
    }

    int getDistance(int u, int v) {
        return depth[u] + depth[v] - 2 * depth[getLca(u, v)];
    }

    int getSize(int u) {
        return siz[u];
    }
};

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n;
    cin >> n;
    vector<vector<int>> adj(n);
    for (int i = 0; i < n - 1; i++) {
        int u, v;
        cin >> u >> v;
        u--;
        v--;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }

    vector<int> key = [&]() {
        Tree tree(n, adj, Tree::getCentroid(n, adj));
        vector<int> order(n);
        iota(order.begin(), order.end(), 0);
        sort(order.begin(), order.end(), [&](int u, int v) {
            return tree.getSize(u) > tree.getSize(v);
        });
        int d = 0;
        int v0 = order[0], v1 = order[0];
        vector<int> key(n / 2 + 1, 0);
        for (int i = 1; i < n; i++) {
            int u = order[i];
            int v = tree.getDistance(u, v0) > tree.getDistance(u, v1) ? v0 : v1;
            int new_d = tree.getDistance(u, v);
            if (new_d > d) {
                d = new_d;
                v0 = u;
                v1 = v;
            }
            key[tree.getSize(u)] = max(key[tree.getSize(u)], d);
        }
        for (int k = n / 2 - 1; k >= 1; k--) {
            key[k] = max(key[k], key[k + 1]);
        }
        return key;
    }();

    for (int k = 1; k <= n; k++) {
        (k & 1) ? cout << 1 << '\n' : cout << key[k / 2] + 1 << '\n';
    }
}

Subtask #1
4.0 / 4.0

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

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 452 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 2 ms 604 KB Output is correct
23 Correct 3 ms 604 KB Output is correct
24 Correct 2 ms 604 KB Output is correct
25 Correct 2 ms 604 KB Output is correct
26 Correct 2 ms 600 KB Output is correct
27 Correct 2 ms 720 KB Output is correct
28 Correct 2 ms 604 KB Output is correct
29 Correct 2 ms 604 KB Output is correct
30 Correct 2 ms 604 KB Output is correct
31 Correct 2 ms 604 KB Output is correct
32 Correct 2 ms 1116 KB Output is correct
33 Correct 2 ms 1628 KB Output is correct
34 Correct 2 ms 604 KB Output is correct
35 Correct 2 ms 604 KB Output is correct
36 Correct 2 ms 860 KB Output is correct
37 Correct 2 ms 652 KB Output is correct
38 Correct 2 ms 1116 KB Output is correct

Subtask #3
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 452 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 2 ms 604 KB Output is correct
23 Correct 3 ms 604 KB Output is correct
24 Correct 2 ms 604 KB Output is correct
25 Correct 2 ms 604 KB Output is correct
26 Correct 2 ms 600 KB Output is correct
27 Correct 2 ms 720 KB Output is correct
28 Correct 2 ms 604 KB Output is correct
29 Correct 2 ms 604 KB Output is correct
30 Correct 2 ms 604 KB Output is correct
31 Correct 2 ms 604 KB Output is correct
32 Correct 2 ms 1116 KB Output is correct
33 Correct 2 ms 1628 KB Output is correct
34 Correct 2 ms 604 KB Output is correct
35 Correct 2 ms 604 KB Output is correct
36 Correct 2 ms 860 KB Output is correct
37 Correct 2 ms 652 KB Output is correct
38 Correct 2 ms 1116 KB Output is correct
39 Correct 119 ms 18516 KB Output is correct
40 Correct 124 ms 18016 KB Output is correct
41 Correct 139 ms 18528 KB Output is correct
42 Correct 133 ms 18752 KB Output is correct
43 Correct 127 ms 18772 KB Output is correct
44 Correct 128 ms 18756 KB Output is correct
45 Correct 146 ms 39492 KB Output is correct
46 Correct 153 ms 59568 KB Output is correct
47 Correct 89 ms 19120 KB Output is correct
48 Correct 68 ms 19316 KB Output is correct
49 Correct 96 ms 19528 KB Output is correct
50 Correct 78 ms 19296 KB Output is correct
51 Correct 117 ms 39472 KB Output is correct