oj.uz

Submission #828724

# Submission time Handle Problem Language Result Execution time Memory
828724 2023-08-17T14:16:04 Z Alora Valley (BOI19_valley) C++17
100 / 100
 161 ms 41924 KB 
#include <bits/stdc++.h>
#define name "cownav"
#define fi(i,a,b) for(int i = a; i <= b; i++)
#define fid(i,a,b) for(int i = a; i >= b; i--)
#define ll long long
#define f first
#define se second
#define pii pair<int, int>
#define getbit(i, j) ((i >> j) & 1)
#define pb push_back
#define all(v) v.begin(), v.end()
#define maxn 100005
const int M = 1e9 + 7;
using namespace std;
int n, s, q, root, num[maxn], en[maxn], h[maxn], cha[maxn][20], cnt;
vector <pii> g[maxn];
pii a[maxn];
ll down[maxn], d[maxn], mi[maxn][20];

void dfs(int u, int fa){
    num[u] = ++cnt;
    for(auto [v, w]: g[u]) if(v != fa){
        h[v] = h[u] + 1;
        d[v] = d[u] + w;
        dfs(v, u);
        down[u] = min(down[u], down[v] + w);
    }
    en[u] = cnt;
}

void build(int u, int fa){
    for(auto [v, w]: g[u]) if(v != fa){
        cha[v][0] = u;
        mi[v][0] = down[v] - d[v];
        fi(i, 1, 19){
            cha[v][i] = cha[cha[v][i - 1]][i - 1];
            mi[v][i] = min(mi[v][i - 1], mi[cha[v][i - 1]][i - 1]);
        }
        build(v, u);
    }
}

ll get_mi(int r, int v){
    ll Mi = 1e18;
    int kc = h[r] - h[v];
    fi(i, 0, 19) if(getbit(kc, i)){
        Mi = min(Mi, mi[r][i]);
        r = cha[r][i];
    }
    Mi = min(Mi, mi[v][0]);
    return Mi;
}

bool in(int u, int v){
    return (num[u] <= num[v] && num[v] <= en[u]);
}
signed main(){
	ios_base::sync_with_stdio(0);
	cin.tie(NULL);
	//freopen(name".in","r",stdin);
	//freopen(name".out","w",stdout);
    cin >> n >> s >> q >> root;
    fi(i, 1, n - 1){
        int u, v, w;
        cin >> u >> v >> w;
        g[u].pb({v, w});
        g[v].pb({u, w});
        a[i] = {u, v};
    }
    fi(i, 1, n){
        down[i] = 1e18;
        fi(j, 0, 19) mi[i][j] = 1e18;
    }
    fi(i, 1, s){
        int x; cin >> x;
        down[x] = 0;
    }
    dfs(root, 0);
    build(root, 0);
    while(q--){
        int id, r; cin >> id >> r;
        auto [u, v] = a[id];
        if(h[v] < h[u]) swap(u, v); //assume that cha[v][0] = u;
        if(!in(v, r)){cout << "escaped" << '\n'; continue;}
        if(down[v] == 1e18) {cout << "oo" << '\n'; continue;}
        cout << d[r] + get_mi(r, v) << '\n';
    }
	return 0;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2772 KB Output is correct
2 Correct 4 ms 2840 KB Output is correct
3 Correct 3 ms 2900 KB Output is correct
4 Correct 4 ms 2832 KB Output is correct

Subtask #2
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2772 KB Output is correct
2 Correct 4 ms 2840 KB Output is correct
3 Correct 3 ms 2900 KB Output is correct
4 Correct 4 ms 2832 KB Output is correct
5 Correct 2 ms 3028 KB Output is correct
6 Correct 2 ms 3028 KB Output is correct
7 Correct 2 ms 3084 KB Output is correct
8 Correct 2 ms 3028 KB Output is correct
9 Correct 2 ms 3028 KB Output is correct
10 Correct 2 ms 3028 KB Output is correct
11 Correct 2 ms 3028 KB Output is correct
12 Correct 2 ms 3028 KB Output is correct
13 Correct 2 ms 3028 KB Output is correct
14 Correct 2 ms 3028 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 114 ms 34164 KB Output is correct
2 Correct 118 ms 33824 KB Output is correct
3 Correct 128 ms 33808 KB Output is correct
4 Correct 152 ms 39368 KB Output is correct
5 Correct 131 ms 39592 KB Output is correct
6 Correct 161 ms 41408 KB Output is correct

Subtask #4
41.0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2772 KB Output is correct
2 Correct 4 ms 2840 KB Output is correct
3 Correct 3 ms 2900 KB Output is correct
4 Correct 4 ms 2832 KB Output is correct
5 Correct 2 ms 3028 KB Output is correct
6 Correct 2 ms 3028 KB Output is correct
7 Correct 2 ms 3084 KB Output is correct
8 Correct 2 ms 3028 KB Output is correct
9 Correct 2 ms 3028 KB Output is correct
10 Correct 2 ms 3028 KB Output is correct
11 Correct 2 ms 3028 KB Output is correct
12 Correct 2 ms 3028 KB Output is correct
13 Correct 2 ms 3028 KB Output is correct
14 Correct 2 ms 3028 KB Output is correct
15 Correct 114 ms 34164 KB Output is correct
16 Correct 118 ms 33824 KB Output is correct
17 Correct 128 ms 33808 KB Output is correct
18 Correct 152 ms 39368 KB Output is correct
19 Correct 131 ms 39592 KB Output is correct
20 Correct 161 ms 41408 KB Output is correct
21 Correct 96 ms 37456 KB Output is correct
22 Correct 130 ms 37228 KB Output is correct
23 Correct 109 ms 37144 KB Output is correct
24 Correct 135 ms 39124 KB Output is correct
25 Correct 144 ms 41924 KB Output is correct
26 Correct 96 ms 37572 KB Output is correct
27 Correct 113 ms 37124 KB Output is correct
28 Correct 107 ms 37184 KB Output is correct
29 Correct 130 ms 38476 KB Output is correct
30 Correct 153 ms 39980 KB Output is correct
31 Correct 97 ms 37624 KB Output is correct
32 Correct 119 ms 37268 KB Output is correct
33 Correct 112 ms 37228 KB Output is correct
34 Correct 150 ms 39164 KB Output is correct
35 Correct 148 ms 41856 KB Output is correct
36 Correct 139 ms 39280 KB Output is correct