oj.uz

답안 #843441

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
843441 2023-09-04T02:29:10 Z anhduc2701 공장들 (JOI14_factories) C++17
100 / 100
 2314 ms 478208 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, ll>
#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 = 1e6 + 5;
const ll oo = 1e18;
 
int n;
vector<vii> G;
 
vi vtn;
vector<vii> vt;
 
ll dis[mxN];
pii sparse[21][mxN*2];
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));
    vtn.erase(unique(all(vtn)), vtn.end());
    sort(all(vtn), [&](int u, int v) {  
        return tin[u] < tin[v];
    });
 
    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(auto v:vtn){
        vt[v].clear();
    }
    for(int i = 0; i < S; ++i) {
        cur[X[i]] = 0;
        vt[X[i]].clear();
    }
    for(int i = 0; i < T; ++i) {
        cur[Y[i]] = 0;
        vt[Y[i]].clear();
    }
    vtn.clear();
 
    return res;
}

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 45656 KB Output is correct
2 Correct 685 ms 58912 KB Output is correct
3 Correct 725 ms 59180 KB Output is correct
4 Correct 687 ms 58960 KB Output is correct
5 Correct 614 ms 59216 KB Output is correct
6 Correct 513 ms 58852 KB Output is correct
7 Correct 711 ms 58964 KB Output is correct
8 Correct 682 ms 58960 KB Output is correct
9 Correct 619 ms 59236 KB Output is correct
10 Correct 505 ms 58704 KB Output is correct
11 Correct 691 ms 58956 KB Output is correct

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 43608 KB Output is correct
2 Correct 932 ms 445768 KB Output is correct
3 Correct 1051 ms 450088 KB Output is correct
4 Correct 740 ms 441620 KB Output is correct
5 Correct 965 ms 478208 KB Output is correct
6 Correct 1016 ms 450644 KB Output is correct
7 Correct 809 ms 140296 KB Output is correct
8 Correct 567 ms 138812 KB Output is correct
9 Correct 643 ms 144284 KB Output is correct
10 Correct 794 ms 140532 KB Output is correct

Subtask #3
67.0 / 67.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 45656 KB Output is correct
2 Correct 685 ms 58912 KB Output is correct
3 Correct 725 ms 59180 KB Output is correct
4 Correct 687 ms 58960 KB Output is correct
5 Correct 614 ms 59216 KB Output is correct
6 Correct 513 ms 58852 KB Output is correct
7 Correct 711 ms 58964 KB Output is correct
8 Correct 682 ms 58960 KB Output is correct
9 Correct 619 ms 59236 KB Output is correct
10 Correct 505 ms 58704 KB Output is correct
11 Correct 691 ms 58956 KB Output is correct
12 Correct 6 ms 43608 KB Output is correct
13 Correct 932 ms 445768 KB Output is correct
14 Correct 1051 ms 450088 KB Output is correct
15 Correct 740 ms 441620 KB Output is correct
16 Correct 965 ms 478208 KB Output is correct
17 Correct 1016 ms 450644 KB Output is correct
18 Correct 809 ms 140296 KB Output is correct
19 Correct 567 ms 138812 KB Output is correct
20 Correct 643 ms 144284 KB Output is correct
21 Correct 794 ms 140532 KB Output is correct
22 Correct 2100 ms 453896 KB Output is correct
23 Correct 1723 ms 453328 KB Output is correct
24 Correct 2314 ms 457972 KB Output is correct
25 Correct 2135 ms 459108 KB Output is correct
26 Correct 1861 ms 452836 KB Output is correct
27 Correct 2125 ms 476976 KB Output is correct
28 Correct 1493 ms 447096 KB Output is correct
29 Correct 1790 ms 451380 KB Output is correct
30 Correct 1733 ms 450892 KB Output is correct
31 Correct 1723 ms 451512 KB Output is correct
32 Correct 1000 ms 148964 KB Output is correct
33 Correct 824 ms 141864 KB Output is correct
34 Correct 1060 ms 140112 KB Output is correct
35 Correct 1060 ms 139976 KB Output is correct
36 Correct 1137 ms 141000 KB Output is correct
37 Correct 1098 ms 141140 KB Output is correct