oj.uz

Submission #805568

# Submission time Handle Problem Language Result Execution time Memory
805568 2023-08-03T17:55:34 Z vjudge1 Meetings 2 (JOI21_meetings2) C++17
100 / 100
 472 ms 55640 KB 
#include<bits/stdc++.h>

using namespace std;
using ll = long long;

const int N = 3e5 + 10;
const int INF = 1e9;
vector<int> g[N];

int n;
int sz[N];
int anc[N][20];
int tin[N], tout[N], T, depth[N];
void precalc(int s, int p) {
    if(s == p) T = 0, depth[s] = 0;
    sz[s] = 1;
    anc[s][0] = p;
    tin[s] = T++;
    for(int i = 1; i < 20; i++) 
        anc[s][i] = anc[anc[s][i - 1]][i - 1];
    for(int to : g[s]) {
        if(to == p) continue;
        depth[to] = depth[s] + 1;
        precalc(to, s);
        sz[s] += sz[to];
    }
    tout[s] = T++;
}
bool up(int u, int v) {
    return tin[u] <= tin[v] && tout[u] >= tout[v];
}
int lca(int u, int v) {
    if(up(u, v)) return u;
    if(up(v, u)) return v;
    for(int i = 19; i >= 0; i--) {
        if(!up(anc[u][i], v)) u = anc[u][i];
    }
    return anc[u][0];
}
int dist(int u, int v) {
    return depth[u] + depth[v] - 2 * depth[lca(u, v)];
}
int root;
vector<int> rs(N, 1);
int LIM;
int func(int u, int v) {
    if(sz[u] < sz[v]) swap(u, v);
    return min(sz[v], n - sz[v]);
}
vector<int> ver[N];
int lb[N];

void DFS(int s, int p) {
    lb[s] = 1;
    for(int to : g[s]) {
        if(to == p) continue;
        DFS(to, s);
        lb[s] = max(lb[to], lb[s]);
    }
    while(lb[s] <= min(sz[s], LIM)) {
        ver[lb[s]++].push_back(s); 
    }
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    cin >> n;
    vector<pair<int, int>> edges;
    for(int i = 1; i < n; i++) {
        int a, b;
        cin >> a >> b;
        edges.push_back({a, b});
        g[a].push_back(b);
        g[b].push_back(a);
    }
    if(n == 1) {
        cout << 1;
        return 0;
    }

    precalc(1, 1);
    int x0 = edges[0].first, x1 = edges[0].second;
    for(auto [u, v] : edges) {
        if(func(x0, x1) < func(u, v)) {
            x0 = u;
            x1 = v;
        }
    }
    LIM = func(x0, x1);
    g[x0].erase(find(g[x0].begin(), g[x0].end(), x1));
    g[x1].erase(find(g[x1].begin(), g[x1].end(), x0));
    root = n + 1;
    g[root].push_back(x0);
    g[root].push_back(x1);

    precalc(root, root);
    DFS(root, root);

    for(int i = 1; i <= LIM; i++) {
        if(ver[i].size() < 2) break;
        int x = ver[i][0], w = 0;
        for(int c : ver[i]) {
            if(depth[c] > depth[x]) x = c;
        }
        for(int c : ver[i]) {
            int v = dist(c, x) + (lca(c, x) != root); 
            w = max(w, v);
        } 
        rs[2 * i] = w;
    }
    for(int i = 1; i <= n; i++) 
        cout << rs[i] << '\n';
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 15572 KB Output is correct
2 Correct 7 ms 15572 KB Output is correct
3 Correct 7 ms 15620 KB Output is correct
4 Correct 8 ms 15572 KB Output is correct
5 Correct 8 ms 15568 KB Output is correct
6 Correct 7 ms 15572 KB Output is correct
7 Correct 7 ms 15572 KB Output is correct
8 Correct 8 ms 15572 KB Output is correct
9 Correct 7 ms 15588 KB Output is correct
10 Correct 9 ms 15536 KB Output is correct
11 Correct 9 ms 15572 KB Output is correct
12 Correct 9 ms 15612 KB Output is correct
13 Correct 8 ms 15612 KB Output is correct
14 Correct 7 ms 15572 KB Output is correct
15 Correct 8 ms 15572 KB Output is correct
16 Correct 7 ms 15572 KB Output is correct
17 Correct 7 ms 15572 KB Output is correct
18 Correct 7 ms 15572 KB Output is correct
19 Correct 7 ms 15572 KB Output is correct
20 Correct 7 ms 15572 KB Output is correct
21 Correct 8 ms 15572 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 15572 KB Output is correct
2 Correct 7 ms 15572 KB Output is correct
3 Correct 7 ms 15620 KB Output is correct
4 Correct 8 ms 15572 KB Output is correct
5 Correct 8 ms 15568 KB Output is correct
6 Correct 7 ms 15572 KB Output is correct
7 Correct 7 ms 15572 KB Output is correct
8 Correct 8 ms 15572 KB Output is correct
9 Correct 7 ms 15588 KB Output is correct
10 Correct 9 ms 15536 KB Output is correct
11 Correct 9 ms 15572 KB Output is correct
12 Correct 9 ms 15612 KB Output is correct
13 Correct 8 ms 15612 KB Output is correct
14 Correct 7 ms 15572 KB Output is correct
15 Correct 8 ms 15572 KB Output is correct
16 Correct 7 ms 15572 KB Output is correct
17 Correct 7 ms 15572 KB Output is correct
18 Correct 7 ms 15572 KB Output is correct
19 Correct 7 ms 15572 KB Output is correct
20 Correct 7 ms 15572 KB Output is correct
21 Correct 8 ms 15572 KB Output is correct
22 Correct 10 ms 16212 KB Output is correct
23 Correct 10 ms 16212 KB Output is correct
24 Correct 10 ms 16288 KB Output is correct
25 Correct 13 ms 16212 KB Output is correct
26 Correct 10 ms 16212 KB Output is correct
27 Correct 14 ms 16212 KB Output is correct
28 Correct 10 ms 16212 KB Output is correct
29 Correct 11 ms 16212 KB Output is correct
30 Correct 10 ms 16212 KB Output is correct
31 Correct 11 ms 16212 KB Output is correct
32 Correct 14 ms 16340 KB Output is correct
33 Correct 13 ms 16452 KB Output is correct
34 Correct 9 ms 16212 KB Output is correct
35 Correct 13 ms 16212 KB Output is correct
36 Correct 14 ms 16252 KB Output is correct
37 Correct 10 ms 16212 KB Output is correct
38 Correct 10 ms 16340 KB Output is correct

Subtask #3
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 15572 KB Output is correct
2 Correct 7 ms 15572 KB Output is correct
3 Correct 7 ms 15620 KB Output is correct
4 Correct 8 ms 15572 KB Output is correct
5 Correct 8 ms 15568 KB Output is correct
6 Correct 7 ms 15572 KB Output is correct
7 Correct 7 ms 15572 KB Output is correct
8 Correct 8 ms 15572 KB Output is correct
9 Correct 7 ms 15588 KB Output is correct
10 Correct 9 ms 15536 KB Output is correct
11 Correct 9 ms 15572 KB Output is correct
12 Correct 9 ms 15612 KB Output is correct
13 Correct 8 ms 15612 KB Output is correct
14 Correct 7 ms 15572 KB Output is correct
15 Correct 8 ms 15572 KB Output is correct
16 Correct 7 ms 15572 KB Output is correct
17 Correct 7 ms 15572 KB Output is correct
18 Correct 7 ms 15572 KB Output is correct
19 Correct 7 ms 15572 KB Output is correct
20 Correct 7 ms 15572 KB Output is correct
21 Correct 8 ms 15572 KB Output is correct
22 Correct 10 ms 16212 KB Output is correct
23 Correct 10 ms 16212 KB Output is correct
24 Correct 10 ms 16288 KB Output is correct
25 Correct 13 ms 16212 KB Output is correct
26 Correct 10 ms 16212 KB Output is correct
27 Correct 14 ms 16212 KB Output is correct
28 Correct 10 ms 16212 KB Output is correct
29 Correct 11 ms 16212 KB Output is correct
30 Correct 10 ms 16212 KB Output is correct
31 Correct 11 ms 16212 KB Output is correct
32 Correct 14 ms 16340 KB Output is correct
33 Correct 13 ms 16452 KB Output is correct
34 Correct 9 ms 16212 KB Output is correct
35 Correct 13 ms 16212 KB Output is correct
36 Correct 14 ms 16252 KB Output is correct
37 Correct 10 ms 16212 KB Output is correct
38 Correct 10 ms 16340 KB Output is correct
39 Correct 339 ms 49732 KB Output is correct
40 Correct 373 ms 48932 KB Output is correct
41 Correct 379 ms 49596 KB Output is correct
42 Correct 373 ms 50176 KB Output is correct
43 Correct 404 ms 50212 KB Output is correct
44 Correct 472 ms 49912 KB Output is correct
45 Correct 391 ms 52388 KB Output is correct
46 Correct 308 ms 55640 KB Output is correct
47 Correct 232 ms 45508 KB Output is correct
48 Correct 203 ms 45952 KB Output is correct
49 Correct 287 ms 48996 KB Output is correct
50 Correct 232 ms 48660 KB Output is correct
51 Correct 274 ms 55520 KB Output is correct