oj.uz

Submission #660361

# Submission time Handle Problem Language Result Execution time Memory
660361 2022-11-21T17:47:07 Z rafatoa Factories (JOI14_factories) C++17
100 / 100
 6264 ms 318772 KB 
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize ("Ofast")
 
#define F first
// #define S second
#define vi vector<int>
#define vvi vector<vi>
#define pi pair<int, int>
#define vpi vector<pi>
#define vb vector<bool>
#define vvb vector<vb>
#define pb push_back
#define ppb pop_back
#define read(a) for(auto &x:a) cin >> x;
#define print(a) for(auto x:a) cout << x << " "; cout << "\n";
#define vc vector<char>
#define vvc vector<vc>
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
 
#define double ld
// #define int long long
const long long INF = 4e18;
 
const int N = 5e5+1;
 
int n;
vpi adjc[N];
unordered_set<int> adj[N];
int st[2*N][21];
long long d[N], dc[N], sub[N], par[N], best[N], vis[N], tin[N], eul[2*N];
 
int tt = 0;
 
int lg2(int x){
    return 31-__builtin_clz(x);
}
 
int cmp(int a, int b){
    return (d[a] < d[b] ? a : b);
}
 
int lca(int a, int b){
    if(tin[a] > tin[b]) swap(a, b);
    int len = tin[b]-tin[a]+1, lg = lg2(len);
    return cmp(st[tin[a]][lg], st[tin[b]-(1LL<<lg)+1][lg]);
}
 
long long dist(int a, int b){
    return dc[a]+dc[b]-2*dc[lca(a, b)];
}
 
void build(){
    int time = 0;
    function<void(int, int)> dfs0 = [&](int s, int e){
        tin[s] = time;
        eul[time++] = s;
        for(auto [u, c]:adjc[s]){
            if(u == e) continue;
            d[u] = d[s]+1;
            dc[u] = dc[s]+c;
            dfs0(u, s);
            eul[time++] = s;
        }
    };
    dfs0(1, 0);
 
    for(int i=0; i<2*n-1; i++) st[i][0] = eul[i];
    for(int j=1; j<=20; j++)
    for(int i=0; i+(1LL<<j)-1<2*n-1; i++)
        st[i][j] = cmp(st[i][j-1], st[i+(1LL<<(j-1))][j-1]);
 
    //START_CENTROID
 
    function<void(int, int)> dfs_sub = [&](int s, int e){
        sub[s] = 1;
        for(auto u:adj[s]){
            if(u == e) continue;
            dfs_sub(u, s);
            sub[s] += sub[u];
        }
    };
 
    function<int(int, int, int)> centroid = [&](int s, int e, int sz){
        for(auto u:adj[s])
            if(u != e && sub[u] > sz/2) return centroid(u, s, sz);
        return s;
    };
 
    function<void(int, int)> decompose = [&](int s, int p){
        dfs_sub(s, 0);
        int C = centroid(s, 0, sub[s]);
        par[C] = p;
 
        for(auto u:adj[C]){
            adj[u].erase(C);
            decompose(u, C);
        }
    };
    decompose(1, -1);
 
    //END_CENTROID
}
 
void Init(int N, int A[], int B[], int D[]){
    n = N;
    for(int i=0; i<n-1; i++){
        adjc[A[i]+1].pb({B[i]+1, D[i]});
        adjc[B[i]+1].pb({A[i]+1, D[i]});
        adj[A[i]+1].insert(B[i]+1);
        adj[B[i]+1].insert(A[i]+1);
    }
 
    build();
}
 
long long Query(int S, int X[], int T, int Y[]){
    tt++;
    long long ans = INF;
    
    for(int i=0; i<T; i++){
        Y[i]++;
        int curr = Y[i];
        while(curr != -1){
            if(vis[curr] < tt){
                vis[curr] = tt;
                best[curr] = INF;
            }
            best[curr] = min(best[curr], dist(curr, Y[i]));
            curr = par[curr];
        }
    }
 
    for(int i=0; i<S; i++){
        X[i]++;
        int curr = X[i];
        while(curr != -1){
            if(vis[curr] < tt){
                vis[curr] = tt;
                best[curr] = INF;
            }
            ans = min(ans, best[curr]+dist(curr, X[i]));
            curr = par[curr];
        }
    }
 
    return ans;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 40012 KB Output is correct
2 Correct 395 ms 50088 KB Output is correct
3 Correct 548 ms 50184 KB Output is correct
4 Correct 549 ms 50068 KB Output is correct
5 Correct 608 ms 50440 KB Output is correct
6 Correct 243 ms 50024 KB Output is correct
7 Correct 640 ms 50032 KB Output is correct
8 Correct 590 ms 50008 KB Output is correct
9 Correct 685 ms 50440 KB Output is correct
10 Correct 365 ms 50056 KB Output is correct
11 Correct 546 ms 49992 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 39852 KB Output is correct
2 Correct 3089 ms 274500 KB Output is correct
3 Correct 3739 ms 278440 KB Output is correct
4 Correct 1476 ms 280764 KB Output is correct
5 Correct 5387 ms 318772 KB Output is correct
6 Correct 3822 ms 279532 KB Output is correct
7 Correct 1853 ms 95308 KB Output is correct
8 Correct 604 ms 96880 KB Output is correct
9 Correct 2168 ms 100892 KB Output is correct
10 Correct 1881 ms 96480 KB Output is correct

Subtask #3
67.0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 40012 KB Output is correct
2 Correct 395 ms 50088 KB Output is correct
3 Correct 548 ms 50184 KB Output is correct
4 Correct 549 ms 50068 KB Output is correct
5 Correct 608 ms 50440 KB Output is correct
6 Correct 243 ms 50024 KB Output is correct
7 Correct 640 ms 50032 KB Output is correct
8 Correct 590 ms 50008 KB Output is correct
9 Correct 685 ms 50440 KB Output is correct
10 Correct 365 ms 50056 KB Output is correct
11 Correct 546 ms 49992 KB Output is correct
12 Correct 63 ms 39852 KB Output is correct
13 Correct 3089 ms 274500 KB Output is correct
14 Correct 3739 ms 278440 KB Output is correct
15 Correct 1476 ms 280764 KB Output is correct
16 Correct 5387 ms 318772 KB Output is correct
17 Correct 3822 ms 279532 KB Output is correct
18 Correct 1853 ms 95308 KB Output is correct
19 Correct 604 ms 96880 KB Output is correct
20 Correct 2168 ms 100892 KB Output is correct
21 Correct 1881 ms 96480 KB Output is correct
22 Correct 3459 ms 276072 KB Output is correct
23 Correct 3600 ms 278392 KB Output is correct
24 Correct 5038 ms 280032 KB Output is correct
25 Correct 4950 ms 283648 KB Output is correct
26 Correct 4855 ms 280168 KB Output is correct
27 Correct 6264 ms 312692 KB Output is correct
28 Correct 1658 ms 284672 KB Output is correct
29 Correct 5037 ms 279604 KB Output is correct
30 Correct 4893 ms 278568 KB Output is correct
31 Correct 4864 ms 279724 KB Output is correct
32 Correct 2221 ms 102108 KB Output is correct
33 Correct 623 ms 97344 KB Output is correct
34 Correct 1405 ms 93004 KB Output is correct
35 Correct 1387 ms 93144 KB Output is correct
36 Correct 1797 ms 93884 KB Output is correct
37 Correct 1851 ms 94112 KB Output is correct