oj.uz

Submission #780282

# Submission time Handle Problem Language Result Execution time Memory
780282 2023-07-12T07:55:37 Z vjudge1 Factories (JOI14_factories) C++17
100 / 100
 4885 ms 283632 KB 
#include "factories.h"
#include "bits/stdc++.h"
using namespace std;

const int NM = 5e5 + 5;
const int LG = __lg(NM<<1) + 1;
int in[NM], h[NM], color[NM], par[NM];
long long d[NM], dp[NM][3], ans;
pair<int,int> ST[LG][NM<<1];
vector<int> tour, newAdj[NM];
vector<pair<int,int>> adj[NM];

void dfs(int u, int par) {
    in[u] = tour.size();
    tour.push_back(u);
    for (auto &vv: adj[u]) {
        int v = vv.first, w = vv.second;
        if (v == par) continue;
        d[v] = d[u] + w;
        h[v] = h[u] + 1;
        dfs(v, u);
        tour.push_back(u);
    }
}

void build() {
    for (int i = 0; i < (int)tour.size(); ++i)
        ST[0][i] = {h[tour[i]], tour[i]};
    for (int j = 1; j < LG; ++j)
        for (int i = 0; i + (1<<j) - 1 < (int)tour.size(); ++i)
            ST[j][i] = min(ST[j-1][i], ST[j-1][i + (1<<(j-1))]);
}

int lca(int u, int v) {
    int l = in[u], r = in[v];
    if (l > r) swap(l, r);
    int k = __lg(r - l + 1);
    return min(ST[k][l], ST[k][r - (1<<k) + 1]).second;
}

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]});
    }
    dfs(0, 0);
    build();
    ans = 1e18;
    for (int i = 0; i < N; ++i) {
        par[i] = -1;
        dp[i][1] = dp[i][2] = 1e18;
    }
}

void DFS(int u) {
    for (int &v: newAdj[u]) DFS(v);
    if (color[u]) dp[u][color[u]] = 0;
    for (int &v: newAdj[u]) {
        if (!color[v]) {
            dp[u][1] = min(dp[u][1], dp[v][1] + d[v] - d[u]);
            dp[u][2] = min(dp[u][2], dp[v][2] + d[v] - d[u]);
        } else dp[u][color[v]] = min(dp[u][color[v]], d[v] - d[u]);
    }
    ans = min(ans, dp[u][1] + dp[u][2]);
}

auto cmp = [](int x, int y) {
    return in[x] < in[y];
};

long long Query(int S, int X[], int T, int Y[]) {
    for (int i = 0; i < S; ++i) color[X[i]] = 1;
    for (int i = 0; i < T; ++i) {
        if (color[Y[i]] == 1) {
            for (int j = 0; j < S; ++j) color[X[j]] = 0;
            for (int j = 0; j < T; ++j) color[Y[j]] = 0;
            return 0;
        }
        color[Y[i]] = 2;
    }
    set<int, decltype(cmp)> node(cmp), tmp(cmp);
    stack<int> st;
    for (int i = 0; i < S; ++i) node.insert(X[i]);
    for (int i = 0; i < T; ++i) node.insert(Y[i]);
    for (auto it = node.begin(); it != node.end(); ++it) {
        if (it == node.begin()) continue;
        auto k = it;
        --k;
        tmp.insert(lca(*it, *k));
    }
    for (int i: tmp) node.insert(i);
    for (int i: node) {
        if (st.empty()) {
            st.push(i);
            continue;
        }
        while (!st.empty() && lca(i, st.top()) != st.top()) st.pop();
        if (!st.empty()) {
            par[i] = st.top();
            newAdj[st.top()].push_back(i);
            st.push(i);
        }
    }
    for (int i: node) if (par[i] == -1) DFS(i);
    long long res = ans;
    ans = 1e18;
    for (int i: node) {
        color[i] = 0;
        par[i] = -1;
        dp[i][1] = dp[i][2] = 1e18;
        newAdj[i].clear();
    }
    return res;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 24456 KB Output is correct
2 Correct 1032 ms 35976 KB Output is correct
3 Correct 1117 ms 35884 KB Output is correct
4 Correct 1134 ms 36268 KB Output is correct
5 Correct 976 ms 36544 KB Output is correct
6 Correct 544 ms 35828 KB Output is correct
7 Correct 1191 ms 35860 KB Output is correct
8 Correct 1116 ms 36280 KB Output is correct
9 Correct 989 ms 36552 KB Output is correct
10 Correct 593 ms 35956 KB Output is correct
11 Correct 1128 ms 35984 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 24148 KB Output is correct
2 Correct 1450 ms 231296 KB Output is correct
3 Correct 1561 ms 235092 KB Output is correct
4 Correct 866 ms 232012 KB Output is correct
5 Correct 1390 ms 274724 KB Output is correct
6 Correct 1626 ms 236336 KB Output is correct
7 Correct 1654 ms 72712 KB Output is correct
8 Correct 769 ms 72808 KB Output is correct
9 Correct 938 ms 79476 KB Output is correct
10 Correct 1656 ms 73900 KB Output is correct

Subtask #3
67.0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 24456 KB Output is correct
2 Correct 1032 ms 35976 KB Output is correct
3 Correct 1117 ms 35884 KB Output is correct
4 Correct 1134 ms 36268 KB Output is correct
5 Correct 976 ms 36544 KB Output is correct
6 Correct 544 ms 35828 KB Output is correct
7 Correct 1191 ms 35860 KB Output is correct
8 Correct 1116 ms 36280 KB Output is correct
9 Correct 989 ms 36552 KB Output is correct
10 Correct 593 ms 35956 KB Output is correct
11 Correct 1128 ms 35984 KB Output is correct
12 Correct 14 ms 24148 KB Output is correct
13 Correct 1450 ms 231296 KB Output is correct
14 Correct 1561 ms 235092 KB Output is correct
15 Correct 866 ms 232012 KB Output is correct
16 Correct 1390 ms 274724 KB Output is correct
17 Correct 1626 ms 236336 KB Output is correct
18 Correct 1654 ms 72712 KB Output is correct
19 Correct 769 ms 72808 KB Output is correct
20 Correct 938 ms 79476 KB Output is correct
21 Correct 1656 ms 73900 KB Output is correct
22 Correct 4267 ms 244456 KB Output is correct
23 Correct 3389 ms 248928 KB Output is correct
24 Correct 4885 ms 252736 KB Output is correct
25 Correct 4462 ms 258480 KB Output is correct
26 Correct 3481 ms 239172 KB Output is correct
27 Correct 3397 ms 283632 KB Output is correct
28 Correct 2265 ms 242664 KB Output is correct
29 Correct 3290 ms 237676 KB Output is correct
30 Correct 3029 ms 236912 KB Output is correct
31 Correct 2990 ms 237496 KB Output is correct
32 Correct 1734 ms 88720 KB Output is correct
33 Correct 1110 ms 77936 KB Output is correct
34 Correct 1752 ms 71676 KB Output is correct
35 Correct 1685 ms 71292 KB Output is correct
36 Correct 1937 ms 72472 KB Output is correct
37 Correct 1909 ms 72272 KB Output is correct