oj.uz

Submission #462444

# Submission time Handle Problem Language Result Execution time Memory
462444 2021-08-10T14:45:19 Z JovanB Valley (BOI19_valley) C++17
100 / 100
 331 ms 30872 KB 
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef long double ld;
 
ll res[100005];
vector <pair <int, int>> graf[100005];
ll depth[100005];
pair <ll, int> niz[100005];
 
int e;
 
const ll INF = 1000000000000000LL;
 
struct segment{
    ll lazy, res;
} seg[400005];
 
int tajm;
int in[100005];
int out[100005];
bool jeste[100005];
vector <pair <int, int>> kv[100005];
int n;
 
void init(int node, int l, int r){
    if(l == r){
        if(niz[l].second == 1) seg[node].res = niz[l].first;
        else seg[node].res = INF;
        return;
    }
    int mid = (l+r)/2;
    init(node*2, l, mid);
    init(node*2+1, mid+1, r);
    seg[node].res = min(seg[node*2].res, seg[node*2+1].res);
}
 
void dfs1(int v, int parent, int kolko){
    depth[v] = depth[parent] + kolko;
    in[v] = ++tajm;
    niz[in[v]] = {depth[v], jeste[v]};
    for(auto c : graf[v]){
        if(c.first == parent) continue;
        dfs1(c.first, v, c.second);
    }
    out[v] = tajm;
}
 
void propagate(int node, int l, int r){
    seg[node].res += seg[node].lazy;
    if(l == r){
        seg[node].lazy = 0;
        return;
    }
    seg[node*2].lazy += seg[node].lazy;
    seg[node*2+1].lazy += seg[node].lazy;
    seg[node].lazy = 0;
}
 
void upd(int node, int l, int r, int tl, int tr, int val){
    if(tl > tr) return;
    propagate(node, l, r);
    if(tl > r || l > tr) return;
    if(tl <= l && r <= tr){
        seg[node].lazy += val;
        propagate(node, l, r);
        return;
    }
    int mid = (l+r)/2;
    upd(node*2, l, mid, tl, tr, val);
    upd(node*2+1, mid+1, r, tl, tr, val);
    seg[node].res = min(seg[node*2].res, seg[node*2+1].res);
}
 
 
ll query(int node, int l, int r, int tl, int tr){
    if(tl > tr) return INF;
    propagate(node, l, r);
    if(tl > r || l > tr) return INF;
    if(tl <= l && r <= tr) return seg[node].res;
    int mid = (l+r)/2;
    return min(query(node*2, l, mid, tl, tr), query(node*2+1, mid+1, r, tl, tr));
}
 
struct edge{
    int a, b, c;
} grana[100005];
 
bool is_parent(int a, int b){
    return in[a] <= in[b] && out[b] <= out[a];
}
 
void dfs(int v, int parent, int kolko){
    upd(1, 1, n, 1, n, kolko);
    upd(1, 1, n, in[v], out[v], -2*kolko);
    for(auto c : kv[v]){
        int edg = c.first;
        if(in[grana[edg].a] > in[grana[edg].b]) swap(grana[edg].a, grana[edg].b);
        int b = grana[edg].b;
        if(is_parent(b, v)) res[c.second] = query(1, 1, n, in[b], out[b]);
        else res[c.second] = min(query(1, 1, n, 1, in[b]-1), query(1, 1, n, out[b]+1, n));
    }
    for(auto c : graf[v]){
        if(c.first == parent) continue;
        dfs(c.first, v, c.second);
    }
    upd(1, 1, n, 1, n, -kolko);
    upd(1, 1, n, in[v], out[v], 2*kolko);
}
 
bool check(int x, int edg){
    if(in[grana[edg].a] > in[grana[edg].b]) swap(grana[edg].a, grana[edg].b);
    int b = grana[edg].b;
    if(is_parent(b, e)) return is_parent(b, x);
    else return !is_parent(b, x);
}
 
int main(){
    ios_base::sync_with_stdio(false), cin.tie(0);
    cout.precision(10);
    cout << fixed;
 
    int s, q;
    cin >> n >> s >> q >> e;
    for(int i=1; i<n; i++){
        int a, b, c;
        cin >> a >> b >> c;
        graf[a].push_back({b, c});
        graf[b].push_back({a, c});
        grana[i] = {a, b, c};
    }
    for(int j=1; j<=s; j++){
        int x;
        cin >> x;
        jeste[x] = 1;
    }
    dfs1(1, 0, 0);
    init(1, 1, n);
    for(int j=1; j<=q; j++){
        int a, b;
        cin >> b >> a;
        if(check(a, b)){
            res[j] = -1;
            continue;
        }
        res[j] = INF;
        kv[a].push_back({b, j});
    }
    dfs(1, 0, 0);
    for(int j=1; j<=q; j++){
        if(res[j] == -1) cout << "escaped\n";
        else if(res[j] > INF/10) cout << "oo\n";
        else cout << res[j] << "\n";
    }
    return 0;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 5324 KB Output is correct
2 Correct 8 ms 5324 KB Output is correct
3 Correct 7 ms 5296 KB Output is correct
4 Correct 6 ms 5304 KB Output is correct

Subtask #2
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 5324 KB Output is correct
2 Correct 8 ms 5324 KB Output is correct
3 Correct 7 ms 5296 KB Output is correct
4 Correct 6 ms 5304 KB Output is correct
5 Correct 5 ms 5196 KB Output is correct
6 Correct 5 ms 5196 KB Output is correct
7 Correct 5 ms 5196 KB Output is correct
8 Correct 5 ms 5196 KB Output is correct
9 Correct 5 ms 5196 KB Output is correct
10 Correct 5 ms 5196 KB Output is correct
11 Correct 5 ms 5168 KB Output is correct
12 Correct 5 ms 5196 KB Output is correct
13 Correct 5 ms 5196 KB Output is correct
14 Correct 5 ms 5196 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 282 ms 23936 KB Output is correct
2 Correct 267 ms 23440 KB Output is correct
3 Correct 272 ms 23476 KB Output is correct
4 Correct 324 ms 26108 KB Output is correct
5 Correct 257 ms 24788 KB Output is correct
6 Correct 331 ms 30872 KB Output is correct

Subtask #4
41.0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 5324 KB Output is correct
2 Correct 8 ms 5324 KB Output is correct
3 Correct 7 ms 5296 KB Output is correct
4 Correct 6 ms 5304 KB Output is correct
5 Correct 5 ms 5196 KB Output is correct
6 Correct 5 ms 5196 KB Output is correct
7 Correct 5 ms 5196 KB Output is correct
8 Correct 5 ms 5196 KB Output is correct
9 Correct 5 ms 5196 KB Output is correct
10 Correct 5 ms 5196 KB Output is correct
11 Correct 5 ms 5168 KB Output is correct
12 Correct 5 ms 5196 KB Output is correct
13 Correct 5 ms 5196 KB Output is correct
14 Correct 5 ms 5196 KB Output is correct
15 Correct 282 ms 23936 KB Output is correct
16 Correct 267 ms 23440 KB Output is correct
17 Correct 272 ms 23476 KB Output is correct
18 Correct 324 ms 26108 KB Output is correct
19 Correct 257 ms 24788 KB Output is correct
20 Correct 331 ms 30872 KB Output is correct
21 Correct 240 ms 23288 KB Output is correct
22 Correct 261 ms 22908 KB Output is correct
23 Correct 256 ms 22844 KB Output is correct
24 Correct 288 ms 24620 KB Output is correct
25 Correct 299 ms 28740 KB Output is correct
26 Correct 252 ms 23412 KB Output is correct
27 Correct 274 ms 22980 KB Output is correct
28 Correct 260 ms 22908 KB Output is correct
29 Correct 287 ms 25412 KB Output is correct
30 Correct 305 ms 27404 KB Output is correct
31 Correct 251 ms 23440 KB Output is correct
32 Correct 252 ms 23156 KB Output is correct
33 Correct 283 ms 23052 KB Output is correct
34 Correct 292 ms 25012 KB Output is correct
35 Correct 303 ms 27824 KB Output is correct
36 Correct 301 ms 25068 KB Output is correct