oj.uz

Submission #1001329

# Submission time Handle Problem Language Result Execution time Memory
1001329 2024-06-18T19:55:53 Z ksu2009en Valley (BOI19_valley) C++17
100 / 100
 411 ms 48256 KB 
#include <iostream>
#include <vector>
#include <string>
#include <math.h>
#include <cmath>
#include <iomanip>
#include <cstdio>
#include <algorithm>
#include <numeric>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <deque>
#include <bitset>
#include <cstring>
#include <unordered_map>

using namespace std;
typedef long long ll;

ll dep[100007];
vector<pair<ll, ll>> d[100007];

ll t[400007], mod[400007], buildby[400007];
bool shop[100007];

ll n, s, q, e;


void build(ll v, ll l, ll r){
    if(l == r){
        t[v] = buildby[l];
        return;
    }
    
    ll mid = (l + r) >> 1;
    build(2 * v, l, mid);
    build(2 * v + 1, mid + 1, r);
    
    t[v] = min(t[2 * v], t[2 * v + 1]);
}

void push(ll v, ll l, ll r){
    if(mod[v] != 0 && l != r){
        t[2 * v] += mod[v];
        t[2 * v + 1] += mod[v];
        
        mod[2 * v] += mod[v];
        mod[2 * v + 1] += mod[v];
        
        mod[v] = 0;
    }
}

ll get(ll v, ll l, ll r, ll ql, ll qr){
    if(r < ql || qr < l)
        return (ll)(1e16);
    
    if(ql <= l && r <= qr)
        return t[v];
    
    ll mid = (l + r) >> 1;
    push(v, l, r);
    
    return min(get(2 * v, l, mid, ql, qr), get(2 * v + 1, mid + 1, r, ql, qr));
}

ll get1(ll v, ll l, ll r, ll pos){
    if(l == r)
        return t[v];
    
    ll mid = (l + r) >> 1;
    push(v, l, r);
    
    if(pos <= mid)
        return get1(2 * v, l, mid, pos);
    return get1(2 * v + 1, mid + 1, r, pos);
}

void update(ll v, ll l, ll r, ll ql, ll qr, ll val){
    if(r < ql || qr < l)
        return;
    
    if(ql <= l && r <= qr){
        t[v] += val;
        mod[v] += val;
        
        return;
    }
    
    ll mid = (l + r) >> 1;
    push(v, l, r);
    
    update(2 * v, l, mid, ql, qr, val);
    update(2 * v + 1, mid + 1, r, ql, qr, val);
    
    t[v] = min(t[2 * v], t[2 * v + 1]);
}

ll time_in[100007], time_out[100007];
ll step = 0;

void dfs(ll v, ll par){
    time_in[v] = ++step;
    
    for(auto i: d[v]){
        if(i.first != par){
            dep[i.first] = dep[v] + i.second;
            dfs(i.first, v);
        }
    }
    
    time_out[v] = step;
}

bool ispar(ll a, ll b){
    return time_in[a] <= time_in[b] && time_in[b] <= time_out[a];
}

vector<pair<ll, ll>> quer[100007];
vector<pair<ll, ll>> edges;

string ans[100007];

void dfs2(ll v, ll par){
    for(auto p: quer[v]){
        pair<ll, ll> i = edges[p.first - 1];
        
        if(ispar(i.second, v)){
            update(1, 1, n, 1, n, (ll)(1e16));
            update(1, 1, n, time_in[i.second], time_out[i.second], -(ll)(1e16));
        }
        else{
            update(1, 1, n, time_in[i.second], time_out[i.second], (ll)(1e16));
        }
        
//        for(int j = 1; j <= n; j++)
//            cout << get1(1, 1, n, time_in[j]) << ' ';
//        cout << endl;
        
        ll val = get1(1, 1, n, time_in[e]);
        if(val < (ll)(1e16)){
            ans[p.second] = "escaped";
        }
        else{
            ll h = get(1, 1, n, 1, n);
            
            if(h < (ll)(1e16))
                ans[p.second] = to_string(h);
            else
                ans[p.second] = "oo";
        }
        
        if(ispar(i.second, v)){
            update(1, 1, n, 1, n, -(ll)(1e16));
            update(1, 1, n, time_in[i.second], time_out[i.second], (ll)(1e16));
        }
        else{
            update(1, 1, n, time_in[i.second], time_out[i.second], -(ll)(1e16));
        }
    }
    
    for(auto i: d[v]){
        if(i.first != par){
            update(1, 1, n, 1, n, i.second);
            update(1, 1, n, time_in[i.first], time_out[i.first], -2 * i.second);

            dfs2(i.first, v);
            
            update(1, 1, n, 1, n, -i.second);
            update(1, 1, n, time_in[i.first], time_out[i.first], 2 * i.second);
        }
    }
}

int main(){
    cin >> n >> s >> q >> e;
    
    for(int i = 0; i < n - 1; i++){
        ll a, b, c;
        cin >> a >> b >> c;
        
        edges.push_back({a, b});
        
        d[a].push_back({b, c});
        d[b].push_back({a, c});
    }
    
    for(int i = 0; i < s; i++){
        ll c;
        cin >> c;
        
        shop[c] = true;
    }
    
    dfs(1, -1);
    // fill in buildby
    
    for(int i = 1; i <= n; i++){
        if(!shop[i] && i != e){
            buildby[time_in[i]] = dep[i] + (ll)(1e16);
            continue;
        }
        
        buildby[time_in[i]] = dep[i];
    }

    build(1, 1, n);
    
    for(auto &i: edges){
        if(dep[i.first] > dep[i.second])
            swap(i.first, i.second);
    }
    
    for(int i = 0; i < q; i++){
        ll e, v;
        cin >> e >> v;
        
        quer[v].push_back({e, i});
    }
    
    dfs2(1, -1);
    
    for(int i = 0; i < q; i++)
        cout << ans[i] << endl;
    
    return 0;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 15452 KB Output is correct
2 Correct 16 ms 15452 KB Output is correct
3 Correct 14 ms 15620 KB Output is correct
4 Correct 16 ms 15452 KB Output is correct

Subtask #2
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 15452 KB Output is correct
2 Correct 16 ms 15452 KB Output is correct
3 Correct 14 ms 15620 KB Output is correct
4 Correct 16 ms 15452 KB Output is correct
5 Correct 4 ms 15196 KB Output is correct
6 Correct 5 ms 17312 KB Output is correct
7 Correct 7 ms 17240 KB Output is correct
8 Correct 5 ms 17240 KB Output is correct
9 Correct 5 ms 15196 KB Output is correct
10 Correct 5 ms 17324 KB Output is correct
11 Correct 7 ms 15196 KB Output is correct
12 Correct 5 ms 15392 KB Output is correct
13 Correct 4 ms 17244 KB Output is correct
14 Correct 5 ms 15196 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 300 ms 31932 KB Output is correct
2 Correct 342 ms 33912 KB Output is correct
3 Correct 345 ms 31684 KB Output is correct
4 Correct 356 ms 36240 KB Output is correct
5 Correct 321 ms 37824 KB Output is correct
6 Correct 388 ms 48256 KB Output is correct

Subtask #4
41.0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 15452 KB Output is correct
2 Correct 16 ms 15452 KB Output is correct
3 Correct 14 ms 15620 KB Output is correct
4 Correct 16 ms 15452 KB Output is correct
5 Correct 4 ms 15196 KB Output is correct
6 Correct 5 ms 17312 KB Output is correct
7 Correct 7 ms 17240 KB Output is correct
8 Correct 5 ms 17240 KB Output is correct
9 Correct 5 ms 15196 KB Output is correct
10 Correct 5 ms 17324 KB Output is correct
11 Correct 7 ms 15196 KB Output is correct
12 Correct 5 ms 15392 KB Output is correct
13 Correct 4 ms 17244 KB Output is correct
14 Correct 5 ms 15196 KB Output is correct
15 Correct 300 ms 31932 KB Output is correct
16 Correct 342 ms 33912 KB Output is correct
17 Correct 345 ms 31684 KB Output is correct
18 Correct 356 ms 36240 KB Output is correct
19 Correct 321 ms 37824 KB Output is correct
20 Correct 388 ms 48256 KB Output is correct
21 Correct 302 ms 33216 KB Output is correct
22 Correct 344 ms 31192 KB Output is correct
23 Correct 309 ms 33212 KB Output is correct
24 Correct 371 ms 34496 KB Output is correct
25 Correct 336 ms 45020 KB Output is correct
26 Correct 269 ms 31172 KB Output is correct
27 Correct 273 ms 33240 KB Output is correct
28 Correct 300 ms 33216 KB Output is correct
29 Correct 345 ms 35476 KB Output is correct
30 Correct 411 ms 42020 KB Output is correct
31 Correct 279 ms 31420 KB Output is correct
32 Correct 275 ms 31136 KB Output is correct
33 Correct 307 ms 31424 KB Output is correct
34 Correct 351 ms 34492 KB Output is correct
35 Correct 318 ms 43432 KB Output is correct
36 Correct 311 ms 35776 KB Output is correct