oj.uz

Submission #879537

# Submission time Handle Problem Language Result Execution time Memory
879537 2023-11-27T15:48:09 Z phongcd Valley (BOI19_valley) C++17
100 / 100
 178 ms 57664 KB 
#include <bits/stdc++.h>
#define ll long long
#define ld long  double
#define ull unsigned long long
#define ii pair <int, int>
#define ill pair <ll, ll>
#define ild pair <ld, ld>
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define file "test"
using namespace std;
const int N = 2e5 + 2;
const int M = 20;
const ll MOD = 1e9 + 7;
const ll INF = 1e18;
const ll base = 311;
const int BLOCK_SIZE = 400;
 
int n, s, q, e;
ii a[N];
ll w[N], f[N], d[N];
ll h[N], up[N][20], fu[N][20];
vector <int> g[N];

void dfs(int u, int p) {
    for (int i: g[u]) {
        int v = a[i].fi ^ a[i].se ^ u;
        if (v == p) continue;

        h[v] = h[u] + 1;
        d[v] = d[u] + w[i];
        
        up[v][0] = u;
        for (int j = 1; j < M; j ++)
            up[v][j] = up[up[v][j - 1]][j - 1];

        dfs(v, u);
        f[u] = min(f[u], f[v] + w[i]);
    }
}

void dfs2(int u, int p) {
    for (int i: g[u]) {
        int v = a[i].fi ^ a[i].se ^ u;
        if (v == p) continue;
        a[i].fi = v, a[i].se = u;

        fu[v][0] = f[u] - d[u];
        for (int j = 1; j < M; j ++)
            fu[v][j] = min(fu[v][j - 1], fu[up[v][j - 1]][j - 1]);

        dfs2(v, u);
    }
}

int jump(int u, int k) {
    for (int j = 19; j >= 0; j --)
        if (k >> j & 1) u = up[u][j];
    return u;
}

bool is_anc(int u, int p) {
    return jump(u, h[u] - h[p]) == p;
}

ll get(int u, int k) {
    ll res = INF;
    for (int j = 19; j >= 0; j --)
        if (k >> j & 1)
            res = min(res, fu[u][j]), u = up[u][j];
    return res;
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
  
    cin >> n >> s >> q >> e;
    for (int i = 1; i < n; i ++) {
        cin >> a[i].fi >> a[i].se >> w[i];
        f[i] = INF;
        g[a[i].fi].push_back(i);
        g[a[i].se].push_back(i);
    }
    f[n] = INF;
    
    for (int i = 0, u; i < s; i ++)
        cin >> u, f[u] = 0; 

    for (int i = 1; i <= n; i ++)
        for (int j = 0; j < M; j ++) fu[i][j] = INF;

    dfs(e, 0);
    dfs2(e, 0);

    while (q --) {
        int i, r; cin >> i >> r;
        int u = a[i].fi;
        if (!is_anc(r, u)) 
            cout << "escaped\n"; 
        else if (f[u] == INF) 
            cout << "oo\n";
        else cout << min(d[r] + get(r, h[r] - h[u]), f[r]) << '\n';
    }
}
/*
     /\_/\ zzZ
    (= -_-)
    / >u  >u
*/

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 12892 KB Output is correct
2 Correct 4 ms 12892 KB Output is correct
3 Correct 7 ms 12892 KB Output is correct
4 Correct 4 ms 12888 KB Output is correct

Subtask #2
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 12892 KB Output is correct
2 Correct 4 ms 12892 KB Output is correct
3 Correct 7 ms 12892 KB Output is correct
4 Correct 4 ms 12888 KB Output is correct
5 Correct 3 ms 12888 KB Output is correct
6 Correct 3 ms 12892 KB Output is correct
7 Correct 3 ms 12892 KB Output is correct
8 Correct 3 ms 12892 KB Output is correct
9 Correct 3 ms 12892 KB Output is correct
10 Correct 3 ms 13004 KB Output is correct
11 Correct 3 ms 12892 KB Output is correct
12 Correct 3 ms 12892 KB Output is correct
13 Correct 4 ms 12892 KB Output is correct
14 Correct 3 ms 12892 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 122 ms 49564 KB Output is correct
2 Correct 133 ms 49240 KB Output is correct
3 Correct 145 ms 48420 KB Output is correct
4 Correct 164 ms 51412 KB Output is correct
5 Correct 159 ms 50260 KB Output is correct
6 Correct 168 ms 53860 KB Output is correct

Subtask #4
41.0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 12892 KB Output is correct
2 Correct 4 ms 12892 KB Output is correct
3 Correct 7 ms 12892 KB Output is correct
4 Correct 4 ms 12888 KB Output is correct
5 Correct 3 ms 12888 KB Output is correct
6 Correct 3 ms 12892 KB Output is correct
7 Correct 3 ms 12892 KB Output is correct
8 Correct 3 ms 12892 KB Output is correct
9 Correct 3 ms 12892 KB Output is correct
10 Correct 3 ms 13004 KB Output is correct
11 Correct 3 ms 12892 KB Output is correct
12 Correct 3 ms 12892 KB Output is correct
13 Correct 4 ms 12892 KB Output is correct
14 Correct 3 ms 12892 KB Output is correct
15 Correct 122 ms 49564 KB Output is correct
16 Correct 133 ms 49240 KB Output is correct
17 Correct 145 ms 48420 KB Output is correct
18 Correct 164 ms 51412 KB Output is correct
19 Correct 159 ms 50260 KB Output is correct
20 Correct 168 ms 53860 KB Output is correct
21 Correct 120 ms 51980 KB Output is correct
22 Correct 131 ms 51540 KB Output is correct
23 Correct 129 ms 53072 KB Output is correct
24 Correct 166 ms 53500 KB Output is correct
25 Correct 178 ms 56760 KB Output is correct
26 Correct 108 ms 52000 KB Output is correct
27 Correct 128 ms 51504 KB Output is correct
28 Correct 133 ms 51468 KB Output is correct
29 Correct 160 ms 53072 KB Output is correct
30 Correct 171 ms 57096 KB Output is correct
31 Correct 126 ms 53388 KB Output is correct
32 Correct 135 ms 53076 KB Output is correct
33 Correct 138 ms 52860 KB Output is correct
34 Correct 154 ms 54092 KB Output is correct
35 Correct 169 ms 57664 KB Output is correct
36 Correct 167 ms 54360 KB Output is correct