oj.uz

Submission #804398

# Submission time Handle Problem Language Result Execution time Memory
804398 2023-08-03T08:31:43 Z vjudge1 Meetings 2 (JOI21_meetings2) C++17
0 / 100
 9 ms 15588 KB 
#include<bits/stdc++.h>

using namespace std;
using ll = long long;

const int B = 0;
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) {
    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 dfs(int s, int p, int k) {
    if(k > LIM) return 0;
    int f = -INF;
    if(sz[s] >= k) f = 0;
    int mx0 = -INF, mx1 = -INF;

    for(int to : g[s]) {
        if(to == p) continue;
        int x = dfs(to, s, k);
        if(x >= mx0) mx1 = mx0, mx0 = x;
        else if(x > mx1) mx1 = x;
        f = max(f, x + 1);
    }
    rs[2 * k] = max(rs[2 * k], mx0 + mx1 + 2 + (s != root));
    return f;
}

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] = B + 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);

    for(int i = 1; i <= B; i++) 
        dfs(root, root, i);
    
    DFS(root, root);
    // cout << LIM << '\n';
    for(int i = B + 1; i <= LIM; i++) {
        // cout << i << ':' << ' ';
        // for(int x : ver[i]) cout << x << ' ';
        // cout << '\n';
        if(ver[i].size() < 2) break;
        int x = ver[i][0], y = ver[i][1];
        for(int c : ver[i]) {
            if(depth[c] > depth[x]) x = c;
        }
        for(int c : ver[i]) {
            if(dist(c, x) > dist(y, x)) y = c; 
        }
        rs[2 * i] = dist(x, y);
    }
    for(int i = 1; i <= n; i++) 
        cout << rs[i] << '\n';
}

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 15572 KB Output is correct
2 Correct 7 ms 15516 KB Output is correct
3 Correct 7 ms 15572 KB Output is correct
4 Correct 7 ms 15572 KB Output is correct
5 Correct 7 ms 15572 KB Output is correct
6 Correct 7 ms 15572 KB Output is correct
7 Correct 7 ms 15572 KB Output is correct
8 Correct 7 ms 15572 KB Output is correct
9 Correct 7 ms 15572 KB Output is correct
10 Correct 7 ms 15572 KB Output is correct
11 Correct 7 ms 15552 KB Output is correct
12 Correct 9 ms 15572 KB Output is correct
13 Correct 8 ms 15572 KB Output is correct
14 Correct 7 ms 15572 KB Output is correct
15 Correct 7 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 15588 KB Output is correct
19 Correct 7 ms 15572 KB Output is correct
20 Incorrect 7 ms 15544 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 15572 KB Output is correct
2 Correct 7 ms 15516 KB Output is correct
3 Correct 7 ms 15572 KB Output is correct
4 Correct 7 ms 15572 KB Output is correct
5 Correct 7 ms 15572 KB Output is correct
6 Correct 7 ms 15572 KB Output is correct
7 Correct 7 ms 15572 KB Output is correct
8 Correct 7 ms 15572 KB Output is correct
9 Correct 7 ms 15572 KB Output is correct
10 Correct 7 ms 15572 KB Output is correct
11 Correct 7 ms 15552 KB Output is correct
12 Correct 9 ms 15572 KB Output is correct
13 Correct 8 ms 15572 KB Output is correct
14 Correct 7 ms 15572 KB Output is correct
15 Correct 7 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 15588 KB Output is correct
19 Correct 7 ms 15572 KB Output is correct
20 Incorrect 7 ms 15544 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #3
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 15572 KB Output is correct
2 Correct 7 ms 15516 KB Output is correct
3 Correct 7 ms 15572 KB Output is correct
4 Correct 7 ms 15572 KB Output is correct
5 Correct 7 ms 15572 KB Output is correct
6 Correct 7 ms 15572 KB Output is correct
7 Correct 7 ms 15572 KB Output is correct
8 Correct 7 ms 15572 KB Output is correct
9 Correct 7 ms 15572 KB Output is correct
10 Correct 7 ms 15572 KB Output is correct
11 Correct 7 ms 15552 KB Output is correct
12 Correct 9 ms 15572 KB Output is correct
13 Correct 8 ms 15572 KB Output is correct
14 Correct 7 ms 15572 KB Output is correct
15 Correct 7 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 15588 KB Output is correct
19 Correct 7 ms 15572 KB Output is correct
20 Incorrect 7 ms 15544 KB Output isn't correct
21 Halted 0 ms 0 KB -