oj.uz

답안 #779936

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
779936 2023-07-12T03:28:43 Z vjudge1 공장들 (JOI14_factories) C++17
100 / 100
 2182 ms 269384 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 pil pair<int, ll>
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vi>
#define vii vector<pii>
#define vil vector<pil>
#define isz(x) (int)x.size()
using namespace std;

const int mxN = 5e5 + 5;
const ll oo = 1e18;

int n;
vector<vii> G;

vi vtn;
vector<vil> vt;

ll dis[mxN];
pii sparse[20][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, cur_dis[0] + cur_dis[1]);
        return cur_dis;
    };

    dfs(dfs, vtn[0], 0);

    while(not vtn.empty()) {
        cur[vtn.back()] = 0;
        vt[vtn.back()].clear();
        vtn.pop_back();
    }

    return res;
}

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 852 KB Output is correct
2 Correct 563 ms 10276 KB Output is correct
3 Correct 556 ms 10296 KB Output is correct
4 Correct 554 ms 10344 KB Output is correct
5 Correct 526 ms 10648 KB Output is correct
6 Correct 343 ms 10196 KB Output is correct
7 Correct 541 ms 10472 KB Output is correct
8 Correct 558 ms 10416 KB Output is correct
9 Correct 528 ms 10624 KB Output is correct
10 Correct 345 ms 10304 KB Output is correct
11 Correct 558 ms 10268 KB Output is correct

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 596 KB Output is correct
2 Correct 1058 ms 231368 KB Output is correct
3 Correct 1047 ms 235084 KB Output is correct
4 Correct 774 ms 232036 KB Output is correct
5 Correct 1012 ms 268516 KB Output is correct
6 Correct 1095 ms 236668 KB Output is correct
7 Correct 716 ms 52652 KB Output is correct
8 Correct 569 ms 52608 KB Output is correct
9 Correct 540 ms 57708 KB Output is correct
10 Correct 726 ms 53864 KB Output is correct

Subtask #3
67.0 / 67.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 852 KB Output is correct
2 Correct 563 ms 10276 KB Output is correct
3 Correct 556 ms 10296 KB Output is correct
4 Correct 554 ms 10344 KB Output is correct
5 Correct 526 ms 10648 KB Output is correct
6 Correct 343 ms 10196 KB Output is correct
7 Correct 541 ms 10472 KB Output is correct
8 Correct 558 ms 10416 KB Output is correct
9 Correct 528 ms 10624 KB Output is correct
10 Correct 345 ms 10304 KB Output is correct
11 Correct 558 ms 10268 KB Output is correct
12 Correct 2 ms 596 KB Output is correct
13 Correct 1058 ms 231368 KB Output is correct
14 Correct 1047 ms 235084 KB Output is correct
15 Correct 774 ms 232036 KB Output is correct
16 Correct 1012 ms 268516 KB Output is correct
17 Correct 1095 ms 236668 KB Output is correct
18 Correct 716 ms 52652 KB Output is correct
19 Correct 569 ms 52608 KB Output is correct
20 Correct 540 ms 57708 KB Output is correct
21 Correct 726 ms 53864 KB Output is correct
22 Correct 2098 ms 241852 KB Output is correct
23 Correct 1714 ms 243068 KB Output is correct
24 Correct 2182 ms 245948 KB Output is correct
25 Correct 2053 ms 249028 KB Output is correct
26 Correct 1805 ms 240964 KB Output is correct
27 Correct 1936 ms 269384 KB Output is correct
28 Correct 1368 ms 239660 KB Output is correct
29 Correct 1841 ms 239460 KB Output is correct
30 Correct 1724 ms 238656 KB Output is correct
31 Correct 1694 ms 239352 KB Output is correct
32 Correct 852 ms 62092 KB Output is correct
33 Correct 579 ms 55080 KB Output is correct
34 Correct 870 ms 51840 KB Output is correct
35 Correct 864 ms 51560 KB Output is correct
36 Correct 892 ms 52428 KB Output is correct
37 Correct 882 ms 52224 KB Output is correct