oj.uz

Submission #931065

# Submission time Handle Problem Language Result Execution time Memory
931065 2024-02-21T07:30:34 Z efedmrlr Valley (BOI19_valley) C++17
100 / 100
 177 ms 92980 KB 
// #pragma GCC optimize("O3,Ofast,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>

using namespace std;


#define int long long int
#define MP make_pair
#define pb push_back
#define REP(i,n) for(int i = 0; (i) < (n); (i)++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()


void fastio() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
}


const double EPS = 0.00001;
const int INF = 1e17;
const int N = 2e5+5;
const int ALPH = 26;
const int LGN = 20;
constexpr int MOD = 1e9+7;
const int MX = 1e16;
int n,m,q,s,e;
vector<vector<array<int,3> > > adj(N, vector<array<int,3> >());
vector<vector<int> > anc(LGN, vector<int>(N, 0)), mns(LGN, vector<int>(N, INF));
vector<int> tin(N, 0), dp(N, INF);
vector<bool> spec(N, 0);
vector<int> find_edge(N, 0), dep(N, 0);
vector<int> subt(N, 0), cost(N, 0);
int timer = 1;
void dfs(int node, int par) {
    tin[node] = timer++;
    anc[0][node] = par;
    if(spec[node]) dp[node] = 0;
    subt[node] = 1;
    for(auto itr = adj[node].begin(); itr != adj[node].end();) {
        auto &c = *itr;
        if(c[0] == par) {
            itr = adj[node].erase(itr);
            continue;
        }
        find_edge[c[2]] = c[0];
        dep[c[0]] = dep[node] + 1ll;
        cost[c[0]] = cost[node] + c[1];
        dfs(c[0], node);
        subt[node] += subt[c[0]];
        dp[node] = min(dp[node], dp[c[0]] + c[1]);
        itr++;
    }
}
void prec() {
    for(int i = 1; i<=n; i++) mns[0][i] = dp[i];
    for(int k = 1; k < LGN; k++) {
        for(int i = 1; i <= n; i++) {
            anc[k][i] = anc[k - 1][anc[k - 1][i]];
            mns[k][i] = min(mns[k - 1][i], mns[k - 1][anc[k - 1][i]]);
        }
    }
}

int mindp(int x, int y) {
    int ret = INF;
    for(int k = LGN - 1; k >= 0; k--) {
        if(dep[anc[k][x]] >= dep[y]) {
            ret = min(ret, mns[k][x]);
            x = anc[k][x];
        }
    }   
    ret = min(ret, mns[0][x]);
    return ret;
}

inline void solve() {
    cin>>n>>s>>q>>e;
    REP(i, n - 1) {
        int u, v, w;
        cin >> u >> v >> w;
        adj[u].pb({v, w, i + 1});
        adj[v].pb({u, w, i + 1});
    }
    REP(i, s) {
        int tmp;
        cin >> tmp;
        spec[tmp] = 1;
    }
    dfs(e, 0);
    for(int i = 1; i<=n; i++) {
        dp[i] -= cost[i];
    }
    prec();
    REP(z, q) {
        int I,R;
        cin >> I >> R;
        int sub = find_edge[I];

        if(tin[sub] <= tin[R] && tin[R] <= tin[sub] + subt[sub] - 1ll) {
            int ans = mindp(R, sub);
            if(ans >= MX) {
                cout << "oo\n";
            }
            else {
                cout << ans + cost[R] << "\n";
            }
        }
        else {
            cout << "escaped\n";
        }
    }
}
 
signed main() {

    fastio();
    int test = 1;
    //cin>>test;
    while(test--) {
        solve();
    }
    
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 77112 KB Output is correct
2 Correct 38 ms 77364 KB Output is correct
3 Correct 38 ms 77244 KB Output is correct
4 Correct 38 ms 77108 KB Output is correct

Subtask #2
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 77112 KB Output is correct
2 Correct 38 ms 77364 KB Output is correct
3 Correct 38 ms 77244 KB Output is correct
4 Correct 38 ms 77108 KB Output is correct
5 Correct 36 ms 77108 KB Output is correct
6 Correct 39 ms 77108 KB Output is correct
7 Correct 38 ms 77108 KB Output is correct
8 Correct 35 ms 77120 KB Output is correct
9 Correct 37 ms 77296 KB Output is correct
10 Correct 38 ms 77304 KB Output is correct
11 Correct 36 ms 77108 KB Output is correct
12 Correct 38 ms 77096 KB Output is correct
13 Correct 36 ms 77112 KB Output is correct
14 Correct 37 ms 77112 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 134 ms 87864 KB Output is correct
2 Correct 138 ms 87972 KB Output is correct
3 Correct 153 ms 88216 KB Output is correct
4 Correct 159 ms 90488 KB Output is correct
5 Correct 141 ms 90200 KB Output is correct
6 Correct 177 ms 92308 KB Output is correct

Subtask #4
41.0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 77112 KB Output is correct
2 Correct 38 ms 77364 KB Output is correct
3 Correct 38 ms 77244 KB Output is correct
4 Correct 38 ms 77108 KB Output is correct
5 Correct 36 ms 77108 KB Output is correct
6 Correct 39 ms 77108 KB Output is correct
7 Correct 38 ms 77108 KB Output is correct
8 Correct 35 ms 77120 KB Output is correct
9 Correct 37 ms 77296 KB Output is correct
10 Correct 38 ms 77304 KB Output is correct
11 Correct 36 ms 77108 KB Output is correct
12 Correct 38 ms 77096 KB Output is correct
13 Correct 36 ms 77112 KB Output is correct
14 Correct 37 ms 77112 KB Output is correct
15 Correct 134 ms 87864 KB Output is correct
16 Correct 138 ms 87972 KB Output is correct
17 Correct 153 ms 88216 KB Output is correct
18 Correct 159 ms 90488 KB Output is correct
19 Correct 141 ms 90200 KB Output is correct
20 Correct 177 ms 92308 KB Output is correct
21 Correct 128 ms 87348 KB Output is correct
22 Correct 133 ms 87612 KB Output is correct
23 Correct 133 ms 87608 KB Output is correct
24 Correct 155 ms 89908 KB Output is correct
25 Correct 158 ms 92980 KB Output is correct
26 Correct 115 ms 87520 KB Output is correct
27 Correct 129 ms 87348 KB Output is correct
28 Correct 132 ms 87756 KB Output is correct
29 Correct 156 ms 89180 KB Output is correct
30 Correct 156 ms 90932 KB Output is correct
31 Correct 125 ms 87608 KB Output is correct
32 Correct 136 ms 87604 KB Output is correct
33 Correct 132 ms 87880 KB Output is correct
34 Correct 161 ms 89824 KB Output is correct
35 Correct 148 ms 92796 KB Output is correct
36 Correct 138 ms 89884 KB Output is correct