oj.uz

Submission #541872

# Submission time Handle Problem Language Result Execution time Memory
541872 2022-03-24T17:43:10 Z MohamedFaresNebili Valley (BOI19_valley) C++14
100 / 100
 286 ms 51152 KB 
#include <bits/stdc++.h>
#pragma GCC optimize ("Ofast")
#pragma GCC target ("avx2")

        using namespace std;
        
        using ll = long long;
        using ii = pair<ll, ll>;
        
        #define ff first
        #define ss second
        #define pb push_back
        #define int ll
        
        const int oo = 1e18 + 7;
        
        int n, s, q, e;
        vector<array<int, 3>> adj[100001];
        bool rem[100001], shop[100001];
        int ans = oo; bool ok = 0;
        int tin[100001], out[100001], timer;
        int dep[100001], par[100001][20], mn[100001][20], sbmn[100001];
        
        int dfs_euler(int v, int p) {
            tin[v] = timer++; par[v][0] = p;
            
            for(auto u : adj[v]) {
                if(u[0] == p) continue;
                dep[u[0]] = dep[v] + u[1];
                sbmn[v] = min(sbmn[v], dfs_euler(u[0], v) + u[1]);	
                if(sbmn[u[0]] != oo)
            	    mn[u[0]][0] = sbmn[u[0]]-dep[u[0]];
            }
            out[v] = timer - 1;
            if(shop[v]) sbmn[v] = 0;
            return sbmn[v];
        }
        
        int32_t main() {
            ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
            cin >> n >> s >> q >> e; e--; vector<ii> edges(n - 1);
            fill(sbmn, sbmn + 100001, oo);
            for(int l = 0; l < n; l++)
                for(int i = 0; i < 20; i++)
                    mn[l][i] = oo;
            for(int l = 0; l < n - 1; l++) {
                int u, v, w; cin >> u >> v >> w; u--; v--;
                adj[u].pb({v, w, l}); adj[v].pb({u, w, l});
                edges[l] = {u, v};
            }
            for(int l = 0; l < s; l++) {
                int u; cin >> u; u--; shop[u] = 1;
            }
            dep[e] = 0; dfs_euler(e, e); /// mn[e][0] = sbmn[e];
            
            for(int l = 1; l < 20; l++)
                for(int i = 0; i < n; i++){
                    par[i][l] = par[par[i][l - 1]][l - 1];
                    mn[i][l] = min(mn[i][l - 1], mn[par[i][l - 1]][l - 1]);
                }
            while(q--) {
                int r, v; cin >> r >> v; r--; v--; 
                int to = edges[r].ff, from = edges[r].ss;
                if(tin[to] < tin[from]) swap(to, from);
                if(tin[to] <= tin[v] && tin[v] <= out[to]) {
                    int ans = oo, kk = v;
                    for (int i = 19; i >= 0; --i) {
                        if(dep[par[v][i]] >= dep[to]){
                            ans = min(ans, mn[v][i]);
                            v = par[v][i];
                        }
                    }
                    ans = min(ans, mn[v][0]);
                    if(ans == oo) cout << "oo\n";
                    else cout << ans + dep[kk] << "\n";
                }
                else cout << "escaped\n";
            }
        }

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 3540 KB Output is correct
2 Correct 3 ms 3604 KB Output is correct
3 Correct 3 ms 3540 KB Output is correct
4 Correct 4 ms 3540 KB Output is correct

Subtask #2
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 3540 KB Output is correct
2 Correct 3 ms 3604 KB Output is correct
3 Correct 3 ms 3540 KB Output is correct
4 Correct 4 ms 3540 KB Output is correct
5 Correct 3 ms 3924 KB Output is correct
6 Correct 3 ms 3924 KB Output is correct
7 Correct 3 ms 3924 KB Output is correct
8 Correct 3 ms 3924 KB Output is correct
9 Correct 3 ms 3924 KB Output is correct
10 Correct 3 ms 3924 KB Output is correct
11 Correct 3 ms 3796 KB Output is correct
12 Correct 2 ms 3924 KB Output is correct
13 Correct 3 ms 3924 KB Output is correct
14 Correct 3 ms 3852 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 158 ms 45688 KB Output is correct
2 Correct 183 ms 45872 KB Output is correct
3 Correct 225 ms 45996 KB Output is correct
4 Correct 194 ms 47856 KB Output is correct
5 Correct 182 ms 48068 KB Output is correct
6 Correct 286 ms 50092 KB Output is correct

Subtask #4
41.0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 3540 KB Output is correct
2 Correct 3 ms 3604 KB Output is correct
3 Correct 3 ms 3540 KB Output is correct
4 Correct 4 ms 3540 KB Output is correct
5 Correct 3 ms 3924 KB Output is correct
6 Correct 3 ms 3924 KB Output is correct
7 Correct 3 ms 3924 KB Output is correct
8 Correct 3 ms 3924 KB Output is correct
9 Correct 3 ms 3924 KB Output is correct
10 Correct 3 ms 3924 KB Output is correct
11 Correct 3 ms 3796 KB Output is correct
12 Correct 2 ms 3924 KB Output is correct
13 Correct 3 ms 3924 KB Output is correct
14 Correct 3 ms 3852 KB Output is correct
15 Correct 158 ms 45688 KB Output is correct
16 Correct 183 ms 45872 KB Output is correct
17 Correct 225 ms 45996 KB Output is correct
18 Correct 194 ms 47856 KB Output is correct
19 Correct 182 ms 48068 KB Output is correct
20 Correct 286 ms 50092 KB Output is correct
21 Correct 150 ms 45764 KB Output is correct
22 Correct 174 ms 45720 KB Output is correct
23 Correct 206 ms 45920 KB Output is correct
24 Correct 198 ms 48112 KB Output is correct
25 Correct 219 ms 51152 KB Output is correct
26 Correct 148 ms 45860 KB Output is correct
27 Correct 160 ms 45804 KB Output is correct
28 Correct 185 ms 46052 KB Output is correct
29 Correct 203 ms 47540 KB Output is correct
30 Correct 221 ms 49200 KB Output is correct
31 Correct 149 ms 45848 KB Output is correct
32 Correct 196 ms 45888 KB Output is correct
33 Correct 168 ms 46224 KB Output is correct
34 Correct 200 ms 48084 KB Output is correct
35 Correct 249 ms 50964 KB Output is correct
36 Correct 179 ms 48732 KB Output is correct