oj.uz

Submission #658989

# Submission time Handle Problem Language Result Execution time Memory
658989 2022-11-15T17:48:40 Z esomer Factories (JOI14_factories) C++17
100 / 100
 3609 ms 299292 KB 
#include<bits/stdc++.h>
#include "factories.h"

using namespace std;

#define ll long long
#define endl "\n"

const int MOD = 998244353;
const int maxN = 500001;
const int maxEuler = 2500000;
const int maxlog = 20;

int sparse[maxEuler][23];
int euler[maxEuler];
int lb[maxEuler];
pair<int, int> t[maxN];
ll dists[maxN];
ll dist_parent[maxN][maxlog + 1];
int depths[maxN];
vector<pair<int, ll>> adj[maxN];
bool done[maxN];
int subtree_size[maxN];
int parents[maxN];
ll ans[maxN];
int centr;
int root;
int cnt;

void DFS_lca(int x, int p){
    t[x].first = cnt;
    euler[cnt] = x; cnt++;
    for(auto pr : adj[x]){
        int node = pr.first;
        if(node != p){
            depths[node] = depths[x] + 1;
            dists[node] = dists[x] + pr.second;
            DFS_lca(node, x);
            t[x].second = cnt;
            euler[cnt] = x; cnt++;
        }
    }
    if(t[x].first + 1 == cnt){
        t[x].second = cnt;
        euler[cnt] = x; cnt++;
    }
}

void build_lca(int n){
    depths[0] = 0;
    dists[0] = 0;
    cnt = 0;
    DFS_lca(0, -1);
    for(int i = 0; i < 23; i++){
        for(int j = 0; j < cnt; j++){
            if(i > 0){
                if(depths[sparse[j][i - 1]] < depths[sparse[max(0, j - (1<<(i - 1)))][i - 1]]){
                    sparse[j][i] = sparse[j][i - 1];
                }else sparse[j][i] = sparse[max(0, j - (1<<(i - 1)))][i - 1];
            }
            else sparse[j][i] = euler[j];
        }
    }
    ll pw = 1;
    int curr = 0;
    for(int i = 1; i <= cnt; i++){
        if(i == pw * 2){
            pw *= 2; curr++;
        }
        lb[i] = curr;
    }
}

ll dist(int a, int b){
    if(a == b) return 0;
    int anc;
    int l = min(t[a].first, t[b].first); int r = max(t[a].second, t[b].second);
    int dst = r - l + 1;
    if(depths[sparse[r][lb[dst]]] < depths[sparse[l + (1 << lb[dst]) - 1][lb[dst]]]) anc = sparse[r][lb[dst]];
    else anc = sparse[l + (1 << lb[dst]) - 1][lb[dst]];
    return dists[a] + dists[b] - 2 * dists[anc];
}

int find_size(int x, int par){
    subtree_size[x] = 1;
    for(auto pr : adj[x]){
        int node = pr.first;
        if(node == par || done[node] == 1) continue;
        subtree_size[x] += find_size(node,  x);
    }
    return subtree_size[x];
}

void find_centroid(int x, int par, int siz){
    bool good = 1;
    for(auto pr : adj[x]){
        int node = pr.first;
        if(node == par || done[node] == 1) continue;
        if(subtree_size[node] > siz / 2){
            find_centroid(node, x, siz);
            good = 0;
        }
    }
    if(good) centr = x;
}

void build(int x, int par){
    int siz = find_size(x, -1);
    centr = -1;
    find_centroid(x, -1, siz);
    parents[centr] = par;
    done[centr] = 1;
    int mine = centr;
    for(auto pr : adj[mine]){
        int node = pr.first;
        if(!done[node]) build(node, mine);
    }
}

void st(int x){
    int next = x;
    int curr = 0;
    while(next != -1){
        dist_parent[x][curr] = dist(x, next);
        next = parents[next];
        curr++;
    }
}

void add(int x){
    int next = x;
    int curr = 0;
    while(next != -1){
        ll d = dist_parent[x][curr];
        ans[next] = min(ans[next], d);
        next = parents[next];
        curr++;
    }
}

void rmv(int x){
    int next = x;
    while(next != -1){
        ans[next] = 1e18;
        next = parents[next];
    }
}

ll query(int x){
    int next = x;
    ll rep = 1e18;
    int curr = 0;
    while(next != -1){
        ll d = dist_parent[x][curr];
        rep = min(rep, ans[next] + d);
        next = parents[next];
        curr++;
    }
    return rep;
}

void Init(int N, int A[], int B[], int D[]){
    for(int i = 0; i < N - 1; i++){
        adj[A[i]].push_back({B[i], D[i]});
        adj[B[i]].push_back({A[i], D[i]});
    }
    build_lca(N);
    build(0, -1);
    for(int i = 0; i < N; i++) {ans[i] = 1e18; st(i);}
}

ll Query(int S, int X[], int T, int Y[]){
    for(int i = 0; i < S; i++) add(X[i]);
    ll retrn = 1e18;
    for(int i = 0; i < T; i++) retrn = min(retrn, query(Y[i]));
    for(int i = 0; i < S; i++) rmv(X[i]);
    return retrn;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 12628 KB Output is correct
2 Correct 254 ms 22604 KB Output is correct
3 Correct 275 ms 22696 KB Output is correct
4 Correct 274 ms 22604 KB Output is correct
5 Correct 282 ms 22672 KB Output is correct
6 Correct 194 ms 22904 KB Output is correct
7 Correct 273 ms 22576 KB Output is correct
8 Correct 265 ms 22584 KB Output is correct
9 Correct 286 ms 22704 KB Output is correct
10 Correct 191 ms 22868 KB Output is correct
11 Correct 267 ms 22556 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 12372 KB Output is correct
2 Correct 1856 ms 273084 KB Output is correct
3 Correct 2533 ms 268984 KB Output is correct
4 Correct 884 ms 295332 KB Output is correct
5 Correct 3091 ms 276484 KB Output is correct
6 Correct 2634 ms 270700 KB Output is correct
7 Correct 786 ms 71536 KB Output is correct
8 Correct 391 ms 77668 KB Output is correct
9 Correct 867 ms 71924 KB Output is correct
10 Correct 767 ms 72848 KB Output is correct

Subtask #3
67.0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 12628 KB Output is correct
2 Correct 254 ms 22604 KB Output is correct
3 Correct 275 ms 22696 KB Output is correct
4 Correct 274 ms 22604 KB Output is correct
5 Correct 282 ms 22672 KB Output is correct
6 Correct 194 ms 22904 KB Output is correct
7 Correct 273 ms 22576 KB Output is correct
8 Correct 265 ms 22584 KB Output is correct
9 Correct 286 ms 22704 KB Output is correct
10 Correct 191 ms 22868 KB Output is correct
11 Correct 267 ms 22556 KB Output is correct
12 Correct 8 ms 12372 KB Output is correct
13 Correct 1856 ms 273084 KB Output is correct
14 Correct 2533 ms 268984 KB Output is correct
15 Correct 884 ms 295332 KB Output is correct
16 Correct 3091 ms 276484 KB Output is correct
17 Correct 2634 ms 270700 KB Output is correct
18 Correct 786 ms 71536 KB Output is correct
19 Correct 391 ms 77668 KB Output is correct
20 Correct 867 ms 71924 KB Output is correct
21 Correct 767 ms 72848 KB Output is correct
22 Correct 2093 ms 274956 KB Output is correct
23 Correct 2130 ms 277148 KB Output is correct
24 Correct 3044 ms 270976 KB Output is correct
25 Correct 3459 ms 274352 KB Output is correct
26 Correct 3201 ms 271188 KB Output is correct
27 Correct 3609 ms 274468 KB Output is correct
28 Correct 1022 ms 299292 KB Output is correct
29 Correct 2996 ms 270948 KB Output is correct
30 Correct 3007 ms 270520 KB Output is correct
31 Correct 2986 ms 270876 KB Output is correct
32 Correct 844 ms 72976 KB Output is correct
33 Correct 391 ms 78044 KB Output is correct
34 Correct 593 ms 70732 KB Output is correct
35 Correct 614 ms 70988 KB Output is correct
36 Correct 728 ms 70232 KB Output is correct
37 Correct 746 ms 70208 KB Output is correct