oj.uz

답안 #787844

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
787844 2023-07-19T13:21:17 Z minhcool 공장들 (JOI14_factories) C++17
100 / 100
 2342 ms 270788 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 int long long
#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 = 1e6 + 5;
const ll oo = 1e18;
 
int n;
vector<vii> G;
 
vi vtn;
vector<vector<pair<int, long long>>> vt;
 
ll dis[mxN];
pii sparse[21][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[]) {
    queue<pii> q;
 
    for(int i = 0; i < S; ++i) {
        cur[X[i]] = 1;
        q.emplace(X[i], 0);
        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 < 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();
    }
    for(auto it : vtn){
        cur[it] = 0;
        vt[it].clear();
    }
    vtn.clear();
 
    return res;
}

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 844 KB Output is correct
2 Correct 558 ms 10316 KB Output is correct
3 Correct 568 ms 10324 KB Output is correct
4 Correct 574 ms 10316 KB Output is correct
5 Correct 525 ms 10768 KB Output is correct
6 Correct 358 ms 10316 KB Output is correct
7 Correct 559 ms 10304 KB Output is correct
8 Correct 604 ms 10364 KB Output is correct
9 Correct 540 ms 10656 KB Output is correct
10 Correct 349 ms 10300 KB Output is correct
11 Correct 602 ms 10376 KB Output is correct

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 596 KB Output is correct
2 Correct 1037 ms 231516 KB Output is correct
3 Correct 1080 ms 236124 KB Output is correct
4 Correct 778 ms 232920 KB Output is correct
5 Correct 1046 ms 269580 KB Output is correct
6 Correct 1221 ms 237752 KB Output is correct
7 Correct 767 ms 66544 KB Output is correct
8 Correct 561 ms 66440 KB Output is correct
9 Correct 595 ms 71728 KB Output is correct
10 Correct 762 ms 67836 KB Output is correct

Subtask #3
67.0 / 67.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 844 KB Output is correct
2 Correct 558 ms 10316 KB Output is correct
3 Correct 568 ms 10324 KB Output is correct
4 Correct 574 ms 10316 KB Output is correct
5 Correct 525 ms 10768 KB Output is correct
6 Correct 358 ms 10316 KB Output is correct
7 Correct 559 ms 10304 KB Output is correct
8 Correct 604 ms 10364 KB Output is correct
9 Correct 540 ms 10656 KB Output is correct
10 Correct 349 ms 10300 KB Output is correct
11 Correct 602 ms 10376 KB Output is correct
12 Correct 2 ms 596 KB Output is correct
13 Correct 1037 ms 231516 KB Output is correct
14 Correct 1080 ms 236124 KB Output is correct
15 Correct 778 ms 232920 KB Output is correct
16 Correct 1046 ms 269580 KB Output is correct
17 Correct 1221 ms 237752 KB Output is correct
18 Correct 767 ms 66544 KB Output is correct
19 Correct 561 ms 66440 KB Output is correct
20 Correct 595 ms 71728 KB Output is correct
21 Correct 762 ms 67836 KB Output is correct
22 Correct 2149 ms 243248 KB Output is correct
23 Correct 1850 ms 243984 KB Output is correct
24 Correct 2342 ms 247268 KB Output is correct
25 Correct 2198 ms 250500 KB Output is correct
26 Correct 1976 ms 241804 KB Output is correct
27 Correct 2025 ms 270788 KB Output is correct
28 Correct 1447 ms 241004 KB Output is correct
29 Correct 1905 ms 240460 KB Output is correct
30 Correct 1905 ms 239724 KB Output is correct
31 Correct 1900 ms 240420 KB Output is correct
32 Correct 964 ms 76288 KB Output is correct
33 Correct 565 ms 69380 KB Output is correct
34 Correct 929 ms 65252 KB Output is correct
35 Correct 876 ms 65036 KB Output is correct
36 Correct 972 ms 65976 KB Output is correct
37 Correct 927 ms 65816 KB Output is correct