oj.uz

Submission #1025574

# Submission time Handle Problem Language Result Execution time Memory
1025574 2024-07-17T07:30:58 Z vjudge1 Factories (JOI14_factories) C++17
100 / 100
 1658 ms 307220 KB 
// #include "factories.h"
#include <bits/stdc++.h>
#define taskname ""
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define ll long long
#define ld long double
#define pb push_back
#define ff first
#define ss second
#define pii pair<int, int>
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vi>
#define vii vector<pii>
#define isz(x) (int)x.size()
using namespace std;
 
const int mxN = 5e5 + 5;
const ll oo = 1e18;
 
int n;
vector<vector<pair<int,ll>>> G;
 
vi vtn;
vector<vector<pair<int,ll>>> vt;
 
ll dis[mxN];
pii sparse[25][2*mxN];
int timer, ecnt, ap[mxN], dep[mxN], cur[mxN], tin[mxN], tout[mxN];
 
void dfs(int v, int p) {
    tin[v] = ++timer;
    dep[v] = dep[p] + 1;
    sparse[0][++ecnt] = {dep[v], v};
    ap[v] = ecnt;
 
    for(auto &[u, w] : G[v]) {
        if(u == p) continue;
        dis[u] = dis[v] + w;
        dfs(u, v);
        sparse[0][++ecnt] = {dep[v], v};
    }
 
    tout[v] = ++timer;
}
 
void build_sparse() {
    for(int p = 1, i = 1; p << 1 <= ecnt; p <<= 1, ++i)
        for(int j = 1; j <= ecnt - (p << 1) + 1; ++j)
            sparse[i][j] = min(sparse[i - 1][j], sparse[i - 1][j + p]);
}
 
bool is_ancestor(int u, int v) {
    return tin[u] <= tin[v] && tout[u] >= tout[v];
}
 
int LCA(int u, int v) {
    int l = ap[u], r = ap[v];
    if(l > r) swap(l, r);
    int len = r - l + 1, lg_len = __lg(len);
    return min(sparse[lg_len][l], sparse[lg_len][r - (1 << lg_len) + 1]).ss;
}
 
void Init(int N, int A[], int B[], int D[]) {
    n = N;
    G.resize(n); vt.resize(n);
    for(int i = 0; i < N - 1; ++i) {
        G[A[i]].emplace_back(B[i], D[i]);
        G[B[i]].emplace_back(A[i], D[i]);
    }
    dfs(0, 0); build_sparse();
}
 
long long Query(int S, int X[], int T, int Y[]) {
    for(int i = 0; i < S; ++i) {
        cur[X[i]] = 1;
        vtn.emplace_back(X[i]);
    }
    for(int i = 0; i < T; ++i) {
        cur[Y[i]] = 2;
        vtn.emplace_back(Y[i]);
    }
 
    sort(all(vtn), [&](int u, int v) {
        return tin[u] < tin[v];
    });
 
    for(int i = 0; i < S + T - 1; ++i) {
        vtn.emplace_back(LCA(vtn[i], vtn[i + 1]));  
    }
 
    sort(all(vtn), [&](int u, int v) {
        return tin[u] < tin[v];
    });
    vtn.erase(unique(all(vtn)), vtn.end());
 
    auto add_vt = [&](int u, int v, ll w) {
        vt[u].emplace_back(v, w);
        vt[v].emplace_back(u, w);
    };
 
    stack<int> s;
    for(int i = 0; i < isz(vtn); ++i) {
        while(not s.empty() && not is_ancestor(s.top(), vtn[i])) s.pop();
        if(s.empty()) s.emplace(vtn[i]);
        else {
            add_vt(s.top(), vtn[i], dis[vtn[i]] - dis[s.top()]);
            s.emplace(vtn[i]);
        }
    }
 
    ll res = oo;
 
    auto dfs = [&](auto self, int v, int p) -> vll {
        vll cur_dis(2, oo);
        if(cur[v]) cur_dis[cur[v] - 1] = 0;
        for(auto &[u, w] : vt[v]) {
            if(u == p) continue;
            vll tmp = self(self, u, v);
            for(int i = 0; i < 2; ++i)
                cur_dis[i] = min(cur_dis[i], tmp[i] + w);
        }
        res = min(res, accumulate(all(cur_dis), 0LL));
        return cur_dis;
    };
 
    dfs(dfs, vtn[0], 0);
 
    for(int i=0;i<(int)(vtn.size());++i) vt[vtn[i]].clear();
    for(int i = 0; i < S; ++i) cur[X[i]] = 0;
    for(int i = 0; i < T; ++i) cur[Y[i]] = 0;
    vtn.clear();
 
    return res;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 43608 KB Output is correct
2 Correct 530 ms 66240 KB Output is correct
3 Correct 533 ms 66132 KB Output is correct
4 Correct 586 ms 66128 KB Output is correct
5 Correct 511 ms 66644 KB Output is correct
6 Correct 336 ms 66204 KB Output is correct
7 Correct 569 ms 66104 KB Output is correct
8 Correct 541 ms 66340 KB Output is correct
9 Correct 493 ms 66644 KB Output is correct
10 Correct 346 ms 66128 KB Output is correct
11 Correct 495 ms 66136 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 43612 KB Output is correct
2 Correct 716 ms 264196 KB Output is correct
3 Correct 782 ms 268368 KB Output is correct
4 Correct 605 ms 261300 KB Output is correct
5 Correct 815 ms 303556 KB Output is correct
6 Correct 808 ms 269952 KB Output is correct
7 Correct 595 ms 121680 KB Output is correct
8 Correct 390 ms 120244 KB Output is correct
9 Correct 430 ms 126644 KB Output is correct
10 Correct 600 ms 122348 KB Output is correct

Subtask #3
67.0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 43608 KB Output is correct
2 Correct 530 ms 66240 KB Output is correct
3 Correct 533 ms 66132 KB Output is correct
4 Correct 586 ms 66128 KB Output is correct
5 Correct 511 ms 66644 KB Output is correct
6 Correct 336 ms 66204 KB Output is correct
7 Correct 569 ms 66104 KB Output is correct
8 Correct 541 ms 66340 KB Output is correct
9 Correct 493 ms 66644 KB Output is correct
10 Correct 346 ms 66128 KB Output is correct
11 Correct 495 ms 66136 KB Output is correct
12 Correct 6 ms 43612 KB Output is correct
13 Correct 716 ms 264196 KB Output is correct
14 Correct 782 ms 268368 KB Output is correct
15 Correct 605 ms 261300 KB Output is correct
16 Correct 815 ms 303556 KB Output is correct
17 Correct 808 ms 269952 KB Output is correct
18 Correct 595 ms 121680 KB Output is correct
19 Correct 390 ms 120244 KB Output is correct
20 Correct 430 ms 126644 KB Output is correct
21 Correct 600 ms 122348 KB Output is correct
22 Correct 1658 ms 277396 KB Output is correct
23 Correct 1320 ms 278216 KB Output is correct
24 Correct 1599 ms 281980 KB Output is correct
25 Correct 1536 ms 284872 KB Output is correct
26 Correct 1303 ms 277100 KB Output is correct
27 Correct 1634 ms 307220 KB Output is correct
28 Correct 972 ms 272048 KB Output is correct
29 Correct 1178 ms 275772 KB Output is correct
30 Correct 1231 ms 274804 KB Output is correct
31 Correct 1238 ms 275648 KB Output is correct
32 Correct 755 ms 130244 KB Output is correct
33 Correct 503 ms 123196 KB Output is correct
34 Correct 739 ms 121136 KB Output is correct
35 Correct 755 ms 121180 KB Output is correct
36 Correct 772 ms 121840 KB Output is correct
37 Correct 735 ms 119800 KB Output is correct