제출 #866806

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
866806		sleepntsheep	Valley (BOI19_valley)	C++17	23 / 100	80 ms	21536 KiB

valley

#include <cstdio>
#include <cstring>
#include <cassert>
#include <string>
#include <deque>
#include <vector>
#include <map>
#include <queue>
#include <algorithm>
#include <iostream>
#include <utility>
using namespace std;
using ll = long long;
using ld = long double;
#define ShinLena cin.tie(nullptr)->sync_with_stdio(false)

#define N 200005
#define ALL(x) x.begin(), x.end()

int n, s, e, q, in[N], out[N], timer, par[N], jmp[N], dep[N];
vector<tuple<int, int, int>> el;
vector<pair<int, int>> g[N];
ll dp[N];

void dfs0(int u, int p, ll dis, ll d1)
{
    par[u] = p;  dep[u] = dep[p]+1;
    in[u] = timer++;
    for (auto [w, v] : g[u]) if (v != p) dfs0(v, u, dis+w, w), dp[u] = min(dp[u], w + dp[v]);
    out[u] = timer - 1;
}

void init()
{
    ShinLena;
    cin >> n >> s >> q >> e;
    for (int i = 1; i <= n; ++i) dp[i] = 1e18;
    el.resize(n-1);
    for (auto &[u, v, w] : el) cin >> u >> v >> w, g[u].emplace_back(w, v), g[v].emplace_back(w, u);
    for (int i = 0, c; i < s; ++i) cin >> c, dp[c] = 0;
    jmp[e] = e; dfs0(e, e, 0, 1e18);
}

void answer()
{
    for (int i, u; q--;)
    {
        cin >> i >> u;
        int v = get<0>(el[i-1]) == u ? get<1>(el[i-1]) : get<0>(el[i-1]), v2 = get<0>(el[i-1]) == v ? get<1>(el[i-1]) : get<0>(el[i-1]);
        if (par[v2] == v) swap(v, v2);
        if (in[v] <= in[u] && out[u] <= out[v])
        {
            cout << "0\n";
        }
        else cout << "escaped\n";
    }
}

int main()
{
    init();
    answer();

    return 0;
}

• Subtask 1: 0 / 9
• Subtask 2: 0 / 27
• Subtask 3: 23 / 23
• Subtask 4: 0 / 41