oj.uz

Submission #866848

# Submission time Handle Problem Language Result Execution time Memory
866848 2023-10-27T08:45:58 Z sleepntsheep Valley (BOI19_valley) C++17
100 / 100
 92 ms 68700 KB 
#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, P[20][N], dep[N];
vector<tuple<int, int, int>> el;
vector<pair<int, int>> g[N];
ll dp[N], dp2[N], O[20][N];

void dfs0(int u, int p)
{
    P[0][u] = p; dep[u] = dep[p]+1;
    in[u] = timer++;
    for (auto [w, v] : g[u]) if (v != p) dp2[v] = dp2[u] + w, dfs0(v, u), dp[u] = min(dp[u], w + dp[v]);
    out[u] = timer++;
    O[0][u] = dp[u] - dp2[u];
}

void init()
{
    ShinLena;
    cin >> n >> s >> q >> e;
    memset(dp, 63, sizeof dp), memset(O, 63, sizeof O);
    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;
    dfs0(e, e);
    for (int j = 1; j < 20; ++j)
        for (int u = 1; u <= n; ++u) P[j][u] = P[j-1][P[j-1][u]], O[j][u] = min(O[j-1][P[j-1][u]], O[j-1][u]);
}

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 (P[0][v2] == v) swap(v, v2);
        if (in[v] <= in[u] && out[u] <= out[v])
        {
            ll z = min(dp[u], dp[v] - dp2[v] + dp2[u]), u0 = u, dt = dep[u]-dep[v];
            for (int j = 20; j--;) if (dt & (1 << j)) z = min(z, dp2[u0] + O[j][u]), u = P[j][u];
            (z < 1e15 ? (cout << z << '\n') : cout << "oo\n");
        }
        else cout << "escaped\n";
    }
}

signed main()
{
    init();
    answer();
    return 0;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 54104 KB Output is correct
2 Correct 8 ms 54108 KB Output is correct
3 Correct 8 ms 54108 KB Output is correct
4 Correct 8 ms 54108 KB Output is correct

Subtask #2
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 54104 KB Output is correct
2 Correct 8 ms 54108 KB Output is correct
3 Correct 8 ms 54108 KB Output is correct
4 Correct 8 ms 54108 KB Output is correct
5 Correct 7 ms 54108 KB Output is correct
6 Correct 7 ms 54108 KB Output is correct
7 Correct 7 ms 54108 KB Output is correct
8 Correct 7 ms 54108 KB Output is correct
9 Correct 7 ms 53968 KB Output is correct
10 Correct 8 ms 54044 KB Output is correct
11 Correct 8 ms 54072 KB Output is correct
12 Correct 7 ms 54108 KB Output is correct
13 Correct 8 ms 54108 KB Output is correct
14 Correct 8 ms 53956 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 77 ms 61272 KB Output is correct
2 Correct 81 ms 61016 KB Output is correct
3 Correct 79 ms 61012 KB Output is correct
4 Correct 92 ms 62800 KB Output is correct
5 Correct 78 ms 62804 KB Output is correct
6 Correct 89 ms 64596 KB Output is correct

Subtask #4
41.0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 54104 KB Output is correct
2 Correct 8 ms 54108 KB Output is correct
3 Correct 8 ms 54108 KB Output is correct
4 Correct 8 ms 54108 KB Output is correct
5 Correct 7 ms 54108 KB Output is correct
6 Correct 7 ms 54108 KB Output is correct
7 Correct 7 ms 54108 KB Output is correct
8 Correct 7 ms 54108 KB Output is correct
9 Correct 7 ms 53968 KB Output is correct
10 Correct 8 ms 54044 KB Output is correct
11 Correct 8 ms 54072 KB Output is correct
12 Correct 7 ms 54108 KB Output is correct
13 Correct 8 ms 54108 KB Output is correct
14 Correct 8 ms 53956 KB Output is correct
15 Correct 77 ms 61272 KB Output is correct
16 Correct 81 ms 61016 KB Output is correct
17 Correct 79 ms 61012 KB Output is correct
18 Correct 92 ms 62800 KB Output is correct
19 Correct 78 ms 62804 KB Output is correct
20 Correct 89 ms 64596 KB Output is correct
21 Correct 70 ms 64096 KB Output is correct
22 Correct 71 ms 63812 KB Output is correct
23 Correct 75 ms 63828 KB Output is correct
24 Correct 86 ms 65876 KB Output is correct
25 Correct 87 ms 68700 KB Output is correct
26 Correct 66 ms 64080 KB Output is correct
27 Correct 70 ms 63920 KB Output is correct
28 Correct 81 ms 63712 KB Output is correct
29 Correct 85 ms 65104 KB Output is correct
30 Correct 92 ms 66576 KB Output is correct
31 Correct 69 ms 64172 KB Output is correct
32 Correct 75 ms 63944 KB Output is correct
33 Correct 73 ms 63824 KB Output is correct
34 Correct 85 ms 65620 KB Output is correct
35 Correct 82 ms 68432 KB Output is correct
36 Correct 81 ms 66132 KB Output is correct