oj.uz

Submission #772221

# Submission time Handle Problem Language Result Execution time Memory
772221 2023-07-03T18:20:17 Z BhavayGoyal Valley (BOI19_valley) C++14
100 / 100
 182 ms 56824 KB 
#include <bits/stdc++.h>
using namespace std;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template<class T> using oset = 
            tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define int long long
#define ld long double
#define ar array
#define vi vector<int>
#define vii vector<vector<int>>
#define pii pair<int, int>
#define pb push_back
#define all(x) x.begin(), x.end()
#define f first
#define s second
#define endl "\n"

const int MOD = 1e9+7;
const int inf = 1e9;
const int linf = 1e18;

const int d4i[4]={-1, 0, 1, 0}, d4j[4]={0, 1, 0, -1};
const int d8i[8]={-1, -1, 0, 1, 1, 1, 0, -1}, d8j[8]={0, 1, 1, 1, 0, -1, -1, -1};

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());


// -------------------------------------------------- Main Code --------------------------------------------------

const int N = 1e5+5;
vector<pii> g[N];
int n, s, q, e, shop[N], parent[N][20], tin[N], tout[N], Time = 0, sub[N], depth[N], minimum[N][20], singleDepth[N];

void dfs(int src, int par) {
    parent[src][0] = par;
    tin[src] = ++Time;
    if (shop[src]) minimum[src][0] = depth[src];
    for (auto child : g[src]) {
        int ch = child.f, wt = child.s;
        if (ch == par) continue;
        depth[ch] = depth[src] + wt;
        singleDepth[ch] = singleDepth[src]+1;
        dfs(ch, src);
        minimum[src][0] = min(minimum[src][0], minimum[ch][0]);
    }
    tout[src] = Time;
}

int kthMin(int a, int k) {
    int ans = linf;
    for (int i = 0; i < 20; i++) {
        if (k & (1ll<<i)) {
            ans = min(ans, minimum[a][i]);
            a = parent[a][i];
        }
    }

    return ans;
}

void sol() {
    for (int i = 0; i < N; i++) minimum[i][0] = linf;
    cin >> n >> s >> q >> e;

    vii edges;
    for (int i = 1; i <= n-1; i++) {
        int a, b, c; cin >> a >> b >> c;
        g[a].pb({b, c}); g[b].pb({a, c});
        edges.pb({a, b, c});
    }

    for (int i = 1; i <= s; i++) {int x; cin >> x; shop[x] = true;}

    dfs(e, 0);
    for (int i = 1; i <= n; i++) minimum[i][0] += (-2*(depth[i]));

    for (int j = 1; j <= n-1; j++) {
        auto i = edges[j-1];
        if (i[0] != parent[i[1]][0]) swap(i[0], i[1]);
        sub[j] = i[1];
    }

    for (int j = 1; j < 20; j++) {
        for (int i = 1; i <= n; i++) {
            parent[i][j] = parent[parent[i][j-1]][j-1];
            minimum[i][j] = min(minimum[parent[i][j-1]][j-1], minimum[i][j-1]);
        }
    }

    while (q--) {
        int root, r; cin >> root >> r;
        root = sub[root];

        if (tin[root] <= tin[r] && tout[root] >= tout[r]) {

            int ans = depth[r];

            int dis = singleDepth[r]-singleDepth[root];
            ans += kthMin(r, dis+1);

            if (ans >= 5e14) cout << "oo" << "\n";
            else cout << ans << endl;
        }
        else cout << "escaped" << endl;
    }
}

signed main () {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int t = 1;
    // cin >> t; 
    while (t--) {
        sol();
    }
    return 0;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 18464 KB Output is correct
2 Correct 11 ms 18420 KB Output is correct
3 Correct 10 ms 18396 KB Output is correct
4 Correct 9 ms 18388 KB Output is correct

Subtask #2
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 18464 KB Output is correct
2 Correct 11 ms 18420 KB Output is correct
3 Correct 10 ms 18396 KB Output is correct
4 Correct 9 ms 18388 KB Output is correct
5 Correct 8 ms 18644 KB Output is correct
6 Correct 8 ms 18644 KB Output is correct
7 Correct 10 ms 18644 KB Output is correct
8 Correct 11 ms 18692 KB Output is correct
9 Correct 12 ms 18644 KB Output is correct
10 Correct 10 ms 18644 KB Output is correct
11 Correct 7 ms 18644 KB Output is correct
12 Correct 8 ms 18644 KB Output is correct
13 Correct 8 ms 18580 KB Output is correct
14 Correct 8 ms 18644 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 133 ms 49868 KB Output is correct
2 Correct 150 ms 49804 KB Output is correct
3 Correct 155 ms 49656 KB Output is correct
4 Correct 182 ms 51084 KB Output is correct
5 Correct 153 ms 51268 KB Output is correct
6 Correct 178 ms 52824 KB Output is correct

Subtask #4
41.0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 18464 KB Output is correct
2 Correct 11 ms 18420 KB Output is correct
3 Correct 10 ms 18396 KB Output is correct
4 Correct 9 ms 18388 KB Output is correct
5 Correct 8 ms 18644 KB Output is correct
6 Correct 8 ms 18644 KB Output is correct
7 Correct 10 ms 18644 KB Output is correct
8 Correct 11 ms 18692 KB Output is correct
9 Correct 12 ms 18644 KB Output is correct
10 Correct 10 ms 18644 KB Output is correct
11 Correct 7 ms 18644 KB Output is correct
12 Correct 8 ms 18644 KB Output is correct
13 Correct 8 ms 18580 KB Output is correct
14 Correct 8 ms 18644 KB Output is correct
15 Correct 133 ms 49868 KB Output is correct
16 Correct 150 ms 49804 KB Output is correct
17 Correct 155 ms 49656 KB Output is correct
18 Correct 182 ms 51084 KB Output is correct
19 Correct 153 ms 51268 KB Output is correct
20 Correct 178 ms 52824 KB Output is correct
21 Correct 134 ms 52516 KB Output is correct
22 Correct 139 ms 52212 KB Output is correct
23 Correct 148 ms 52228 KB Output is correct
24 Correct 168 ms 53832 KB Output is correct
25 Correct 157 ms 56264 KB Output is correct
26 Correct 129 ms 52748 KB Output is correct
27 Correct 146 ms 52576 KB Output is correct
28 Correct 157 ms 52608 KB Output is correct
29 Correct 162 ms 53748 KB Output is correct
30 Correct 162 ms 54940 KB Output is correct
31 Correct 162 ms 53352 KB Output is correct
32 Correct 152 ms 53104 KB Output is correct
33 Correct 145 ms 53224 KB Output is correct
34 Correct 160 ms 54552 KB Output is correct
35 Correct 160 ms 56824 KB Output is correct
36 Correct 145 ms 54756 KB Output is correct