oj.uz

답안 #779935

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
779935 2023-07-12T03:27:44 Z CDuong 공장들 (JOI14_factories) C++17
100 / 100
 2214 ms 289316 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 544 ms 10596 KB Output is correct
3 Correct 548 ms 10420 KB Output is correct
4 Correct 550 ms 10340 KB Output is correct
5 Correct 517 ms 10656 KB Output is correct
6 Correct 359 ms 10244 KB Output is correct
7 Correct 537 ms 10408 KB Output is correct
8 Correct 542 ms 10336 KB Output is correct
9 Correct 530 ms 10656 KB Output is correct
10 Correct 348 ms 10224 KB Output is correct
11 Correct 574 ms 10284 KB Output is correct

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 596 KB Output is correct
2 Correct 968 ms 231436 KB Output is correct
3 Correct 1022 ms 235260 KB Output is correct
4 Correct 753 ms 250216 KB Output is correct
5 Correct 988 ms 287116 KB Output is correct
6 Correct 1166 ms 255376 KB Output is correct
7 Correct 699 ms 66548 KB Output is correct
8 Correct 533 ms 66444 KB Output is correct
9 Correct 566 ms 71748 KB Output is correct
10 Correct 691 ms 67908 KB Output is correct

Subtask #3
67.0 / 67.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 852 KB Output is correct
2 Correct 544 ms 10596 KB Output is correct
3 Correct 548 ms 10420 KB Output is correct
4 Correct 550 ms 10340 KB Output is correct
5 Correct 517 ms 10656 KB Output is correct
6 Correct 359 ms 10244 KB Output is correct
7 Correct 537 ms 10408 KB Output is correct
8 Correct 542 ms 10336 KB Output is correct
9 Correct 530 ms 10656 KB Output is correct
10 Correct 348 ms 10224 KB Output is correct
11 Correct 574 ms 10284 KB Output is correct
12 Correct 2 ms 596 KB Output is correct
13 Correct 968 ms 231436 KB Output is correct
14 Correct 1022 ms 235260 KB Output is correct
15 Correct 753 ms 250216 KB Output is correct
16 Correct 988 ms 287116 KB Output is correct
17 Correct 1166 ms 255376 KB Output is correct
18 Correct 699 ms 66548 KB Output is correct
19 Correct 533 ms 66444 KB Output is correct
20 Correct 566 ms 71748 KB Output is correct
21 Correct 691 ms 67908 KB Output is correct
22 Correct 2163 ms 266124 KB Output is correct
23 Correct 1903 ms 263200 KB Output is correct
24 Correct 2214 ms 270172 KB Output is correct
25 Correct 2214 ms 269172 KB Output is correct
26 Correct 1822 ms 264896 KB Output is correct
27 Correct 1991 ms 289316 KB Output is correct
28 Correct 1393 ms 256504 KB Output is correct
29 Correct 1748 ms 263644 KB Output is correct
30 Correct 1699 ms 262900 KB Output is correct
31 Correct 1745 ms 263668 KB Output is correct
32 Correct 894 ms 75932 KB Output is correct
33 Correct 569 ms 68988 KB Output is correct
34 Correct 888 ms 65312 KB Output is correct
35 Correct 849 ms 65236 KB Output is correct
36 Correct 890 ms 65932 KB Output is correct
37 Correct 864 ms 65916 KB Output is correct