oj.uz

답안 #396931

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
396931 2021-05-01T02:03:33 Z KoD Valley (BOI19_valley) C++17
100 / 100
 540 ms 40404 KB 
#include <bits/stdc++.h>

template <class T>
using Vec = std::vector<T>;

using ll = long long;

template <class F>
struct RecLambda: private F {
    RecLambda(F&& f): F(std::forward<F>(f)) { }
    template <class... Args>
    decltype(auto) operator () (Args&&... args) const {
        return F::operator()(*this, std::forward<Args>(args)...);
    }
};

constexpr ll INF = std::numeric_limits<ll>::max() / 2;

int main() {
    int N, S, Q, E;
    std::cin >> N >> S >> Q >> E;
    E -= 1;
    Vec<int> A(N - 1), B(N - 1), W(N - 1);
    Vec<Vec<std::pair<int, int>>> graph(N);
    for (int i = 0; i < N - 1; ++i) {
        std::cin >> A[i] >> B[i] >> W[i];
        A[i] -= 1;
        B[i] -= 1;
        graph[A[i]].emplace_back(B[i], W[i]);
        graph[B[i]].emplace_back(A[i], W[i]);
    }    
    Vec<bool> shop(N);
    while (S--) {
        int x;
        std::cin >> x;
        x -= 1;
        shop[x] = true;
    }
    std::array<Vec<int>, 20> parent;
    parent[0] = Vec<int>(N);
    Vec<int> in(N), out(N);
    Vec<ll> nearest(N, INF), depth(N);
    int timer = 0;
    RecLambda([&](auto&& dfs, const int u, const int p, const ll d) -> void {
        parent[0][u] = p;
        in[u] = timer++;
        depth[u] = d;
        if (shop[u]) {
            nearest[u] = 0;
        }
        for (const auto [v, c]: graph[u]) {
            if (v != p) {
                dfs(v, u, d + c);
                nearest[u] = std::min(nearest[u], nearest[v] + c);
            }
        }
        out[u] = timer;
    })(E, E, 0);
    std::array<Vec<ll>, 20> min;
    min[0] = Vec<ll>(N);
    for (int i = 0; i < N; ++i) {
        min[0][i] = nearest[i] - depth[i];
    }
    for (int i = 0; i < 19; ++i) {
        parent[i + 1] = Vec<int>(N);
        min[i + 1] = Vec<ll>(N);
        for (int j = 0; j < N; ++j) {
            parent[i + 1][j] = parent[i][parent[i][j]];
            min[i + 1][j] = std::min(min[i][j], min[i][parent[i][j]]);
        }
    }
    while (Q--) {
        int e, u;
        std::cin >> e >> u;
        e -= 1;
        u -= 1;
        const auto p = (parent[0][A[e]] == B[e] ? A[e] : B[e]);
        if (in[p] <= in[u] and in[u] < out[p]) {
            ll ans = INF;
            const auto add = depth[u];
            for (int i = 19; i >= 0; --i) {
                if (depth[parent[i][u]] >= depth[p]) {
                    ans = std::min(ans, min[i][u] + add);
                    u = parent[i][u];
                }
            }
            ans = std::min(ans, min[0][p] + add);
            if (ans == INF) {
                std::cout << "oo\n";
            }
            else {
                std::cout << ans << '\n';
            }
        }
        else {
            std::cout << "escaped\n";
        }
    }
    return 0;
}

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 332 KB Output is correct
2 Correct 21 ms 380 KB Output is correct
3 Correct 21 ms 412 KB Output is correct
4 Correct 21 ms 384 KB Output is correct

Subtask #2
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 332 KB Output is correct
2 Correct 21 ms 380 KB Output is correct
3 Correct 21 ms 412 KB Output is correct
4 Correct 21 ms 384 KB Output is correct
5 Correct 4 ms 572 KB Output is correct
6 Correct 4 ms 588 KB Output is correct
7 Correct 4 ms 588 KB Output is correct
8 Correct 4 ms 588 KB Output is correct
9 Correct 4 ms 564 KB Output is correct
10 Correct 5 ms 564 KB Output is correct
11 Correct 4 ms 588 KB Output is correct
12 Correct 4 ms 588 KB Output is correct
13 Correct 4 ms 588 KB Output is correct
14 Correct 4 ms 588 KB Output is correct

Subtask #3
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 476 ms 35160 KB Output is correct
2 Correct 458 ms 34884 KB Output is correct
3 Correct 481 ms 34632 KB Output is correct
4 Correct 488 ms 36972 KB Output is correct
5 Correct 432 ms 36932 KB Output is correct
6 Correct 540 ms 39364 KB Output is correct

Subtask #4
41.0 / 41.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 332 KB Output is correct
2 Correct 21 ms 380 KB Output is correct
3 Correct 21 ms 412 KB Output is correct
4 Correct 21 ms 384 KB Output is correct
5 Correct 4 ms 572 KB Output is correct
6 Correct 4 ms 588 KB Output is correct
7 Correct 4 ms 588 KB Output is correct
8 Correct 4 ms 588 KB Output is correct
9 Correct 4 ms 564 KB Output is correct
10 Correct 5 ms 564 KB Output is correct
11 Correct 4 ms 588 KB Output is correct
12 Correct 4 ms 588 KB Output is correct
13 Correct 4 ms 588 KB Output is correct
14 Correct 4 ms 588 KB Output is correct
15 Correct 476 ms 35160 KB Output is correct
16 Correct 458 ms 34884 KB Output is correct
17 Correct 481 ms 34632 KB Output is correct
18 Correct 488 ms 36972 KB Output is correct
19 Correct 432 ms 36932 KB Output is correct
20 Correct 540 ms 39364 KB Output is correct
21 Correct 427 ms 35068 KB Output is correct
22 Correct 430 ms 34756 KB Output is correct
23 Correct 440 ms 34704 KB Output is correct
24 Correct 468 ms 37316 KB Output is correct
25 Correct 475 ms 40404 KB Output is correct
26 Correct 425 ms 35140 KB Output is correct
27 Correct 485 ms 34884 KB Output is correct
28 Correct 456 ms 34676 KB Output is correct
29 Correct 464 ms 36504 KB Output is correct
30 Correct 467 ms 38048 KB Output is correct
31 Correct 443 ms 35240 KB Output is correct
32 Correct 434 ms 34864 KB Output is correct
33 Correct 444 ms 34768 KB Output is correct
34 Correct 486 ms 36932 KB Output is correct
35 Correct 439 ms 40272 KB Output is correct
36 Correct 465 ms 37792 KB Output is correct