oj.uz

답안 #892297

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
892297 2023-12-25T06:59:31 Z votranngocvy Valley (BOI19_valley) C++14
100 / 100
 140 ms 61632 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define pii pair<int,int>
#define fi first
#define se second
#define mp make_pair
const int N = 1e5 + 5;
const int inf = 0x3f3f3f3f3f3f3f3f;
int par[N][25],h[N],f[N],fini[N],start[N],Min[N][25],timeDFS,dp[N];
vector<pii>g[N],edge;
bool marked[N];

void dfs(int u,int p) {
    par[u][0] = p;
    start[u] = ++timeDFS;
    for (auto x: g[u]) {
        int v = x.fi,w = x.se;
        if (v == p) continue;
        f[v] = f[u] + w;
        h[v] = h[u] + 1;
        dfs(v,u);
        dp[u] = min(dp[u],dp[v] + w);
    }
    fini[u] = timeDFS;
}

void dfs1(int u,int p) {
    for (auto x: g[u]) {
        int v = x.fi;
        if (v == p) continue;
        Min[v][0] = dp[u] - f[u];
        dfs1(v,u);
    }
}

int lca(int u,int v) {
    if (h[u] < h[v]) swap(u,v);
    for (int i = 19; i >= 0; i--)
        if (h[par[u][i]] >= h[v]) u = par[u][i];
    if (u == v) return u;
    for (int i = 19; i >= 0; i--)
        if (par[u][i] != par[v][i]) u = par[u][i],v = par[v][i];
    return par[u][0];
}

bool inSubtree(int v,int u) {
    return (start[u] <= start[v] && fini[v] <= fini[u]);
}

int get(int u,int v) {
    int len = h[u] - h[v],ans = inf;
    for (int i = 19; i >= 0; i--)
        if (len & (1 << i)) {
            ans = min(ans,Min[u][i]);
            u = par[u][i];
        }
    return ans;
}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int n,s,q,e;
    cin >> n >> s >> q >> e;
    for (int i = 1; i < n; i++) {
        int u,v,c;
        cin >> u >> v >> c;
        g[u].push_back(mp(v,c));
        g[v].push_back(mp(u,c));
        edge.push_back(mp(u,v));
    }
    for (int i = 1; i <= n; i++) dp[i] = inf;
    for (int i = 1; i <= s; i++) {
        int x;
        cin >> x;
        dp[x] = 0;
    }
    dfs(e,e);
    dfs1(e,e);
    for (int i = 1; i <= 19; i++)
        for (int u = 1; u <= n; u++) {
            par[u][i] = par[par[u][i - 1]][i - 1];
            Min[u][i] = min(Min[u][i - 1],Min[par[u][i - 1]][i - 1]);
        }
    while (q--) {
        int idx,x;
        cin >> idx >> x;
        int u = edge[idx - 1].fi,v = edge[idx - 1].se;
        if (v == par[u][0]) swap(u,v);
        if (!inSubtree(x,v)) cout << "escaped\n";
        else {
            int ans = min(dp[x],f[x] + get(x,v));
            if (ans == inf) cout << "oo\n";
            else cout << ans << "\n";
        }
    }
}

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 8792 KB Output is correct
2 Correct 3 ms 8796 KB Output is correct
3 Correct 3 ms 8796 KB Output is correct
4 Correct 3 ms 8764 KB Output is correct

Subtask #2
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 8792 KB Output is correct
2 Correct 3 ms 8796 KB Output is correct
3 Correct 3 ms 8796 KB Output is correct
4 Correct 3 ms 8764 KB Output is correct
5 Correct 2 ms 8796 KB Output is correct
6 Correct 2 ms 8796 KB Output is correct
7 Correct 2 ms 8796 KB Output is correct
8 Correct 2 ms 8796 KB Output is correct
9 Correct 2 ms 8796 KB Output is correct
10 Correct 2 ms 8792 KB Output is correct
11 Correct 3 ms 8748 KB Output is correct
12 Correct 2 ms 8796 KB Output is correct
13 Correct 2 ms 8852 KB Output is correct
14 Correct 2 ms 8796 KB Output is correct

Subtask #3
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 110 ms 52996 KB Output is correct
2 Correct 112 ms 53008 KB Output is correct
3 Correct 120 ms 53244 KB Output is correct
4 Correct 130 ms 54948 KB Output is correct
5 Correct 111 ms 55116 KB Output is correct
6 Correct 134 ms 57180 KB Output is correct

Subtask #4
41.0 / 41.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 8792 KB Output is correct
2 Correct 3 ms 8796 KB Output is correct
3 Correct 3 ms 8796 KB Output is correct
4 Correct 3 ms 8764 KB Output is correct
5 Correct 2 ms 8796 KB Output is correct
6 Correct 2 ms 8796 KB Output is correct
7 Correct 2 ms 8796 KB Output is correct
8 Correct 2 ms 8796 KB Output is correct
9 Correct 2 ms 8796 KB Output is correct
10 Correct 2 ms 8792 KB Output is correct
11 Correct 3 ms 8748 KB Output is correct
12 Correct 2 ms 8796 KB Output is correct
13 Correct 2 ms 8852 KB Output is correct
14 Correct 2 ms 8796 KB Output is correct
15 Correct 110 ms 52996 KB Output is correct
16 Correct 112 ms 53008 KB Output is correct
17 Correct 120 ms 53244 KB Output is correct
18 Correct 130 ms 54948 KB Output is correct
19 Correct 111 ms 55116 KB Output is correct
20 Correct 134 ms 57180 KB Output is correct
21 Correct 98 ms 56508 KB Output is correct
22 Correct 103 ms 56252 KB Output is correct
23 Correct 114 ms 56456 KB Output is correct
24 Correct 137 ms 58956 KB Output is correct
25 Correct 124 ms 61632 KB Output is correct
26 Correct 98 ms 56512 KB Output is correct
27 Correct 111 ms 56256 KB Output is correct
28 Correct 121 ms 56732 KB Output is correct
29 Correct 140 ms 58048 KB Output is correct
30 Correct 138 ms 59832 KB Output is correct
31 Correct 95 ms 56512 KB Output is correct
32 Correct 111 ms 56256 KB Output is correct
33 Correct 120 ms 56508 KB Output is correct
34 Correct 135 ms 59048 KB Output is correct
35 Correct 130 ms 61376 KB Output is correct
36 Correct 118 ms 58560 KB Output is correct