oj.uz

Submission #498013

# Submission time Handle Problem Language Result Execution time Memory
498013 2021-12-24T09:10:45 Z Nalrimet Valley (BOI19_valley) C++17
100 / 100
 316 ms 117764 KB 
#include<bits/stdc++.h>

//#pragma GCC optimization("g", on)
//#pragma GCC optimize ("inline")
//#pragma GCC optimization("03")
//#pragma GCC optimization("unroll-loops")
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popused,abm,mmx,avx,tune=native")
using namespace std;

const int N = 1e6 + 5;
const long long inf = 1e18;
const int K = 25;
#define ll long long
#define int long long

#define F first
#define S second
#define pb push_back

int n, s, q, e, p[N], a[N], b[N], dp[N], dist[N], tin[N], tout[N], timer, mn[N][50], up[N][50];
vector<pair<int, int>> g[N];

void dfs(int v, int pr){
    tin[v] = timer++;
    up[v][0] = pr;
    for(auto to : g[v]){
        if(to.F != pr){
            dist[to.F] = dist[v] + to.S;
            dfs(to.F, v);
            p[v] = min(p[v], p[to.F] + to.S);
        }
    }
    for(auto to : g[v]){
		if(to.F != pr){
			mn[to.F][0] = p[v] - dist[v];
		}
	}
//    dp[v] = p[v] - dist[v];

    tout[v] = timer++;
}

bool is(int a, int b){
    if(tin[a] <= tin[b] && tout[b] <= tout[a]) return 1;
    else return 0;
}

void build(int v, int pr){
    for(int i = 1; i <= K; ++i){
        up[v][i] = up[up[v][i - 1]][i - 1];
        mn[v][i] = min(mn[v][i - 1], mn[up[v][i - 1]][i - 1]);
    }
    for(auto to : g[v])
        if(to.F != pr)
            build(to.F, v);
}

int lift(int u, int v){
    int res = inf, x = v;
    for(int i = K; i >= 0; --i){
//        cout << u << ' ' << up[x][i] << '\n';
        if(is(u, up[x][i])){
//            cout << "Yes\n";
//            cout << mn[x][i] << '\n';
            res = min(res, mn[x][i]);
            x = up[x][i];
        }
    }
    res += dist[v];
    res = min(res, p[v]);

    return res;
}

 main() {

    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    cin >> n >> s >> q >> e;

    for(int i = 1; i <= n; ++i){
        p[i] = inf;
    }

    for(int i = 1, u, v, w; i < n; ++i){
        cin >> u >> v >> w;
        g[u].pb({v, w});
        g[v].pb({u, w});
        a[i] = u;
        b[i] = v;
    }

    for(int i = 1, j; i <= s; ++i){
        cin >> j;
        p[j] = 0;
    }

    dfs(e, -1);
    build(e, -1);

    while(q--){
        int i, v, f;
        cin >> i >> v;
        if(up[a[i]][0] == b[i]) f = a[i];
        else f = b[i];
        if(!is(f, v)) cout << "escaped\n";
        else {
            int ans = lift(f, v);
            if(ans >= 1e15) cout << "oo\n";
            else cout << ans << '\n';
        }
    }
}

Compilation message

valley.cpp:77:2: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   77 |  main() {
      |  ^~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 24012 KB Output is correct
2 Correct 16 ms 24032 KB Output is correct
3 Correct 14 ms 24012 KB Output is correct
4 Correct 17 ms 24012 KB Output is correct

Subtask #2
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 24012 KB Output is correct
2 Correct 16 ms 24032 KB Output is correct
3 Correct 14 ms 24012 KB Output is correct
4 Correct 17 ms 24012 KB Output is correct
5 Correct 15 ms 24656 KB Output is correct
6 Correct 14 ms 24748 KB Output is correct
7 Correct 16 ms 24652 KB Output is correct
8 Correct 14 ms 24652 KB Output is correct
9 Correct 14 ms 24680 KB Output is correct
10 Correct 14 ms 24652 KB Output is correct
11 Correct 14 ms 24644 KB Output is correct
12 Correct 15 ms 24652 KB Output is correct
13 Correct 14 ms 24740 KB Output is correct
14 Correct 17 ms 24672 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 209 ms 112596 KB Output is correct
2 Correct 220 ms 112452 KB Output is correct
3 Correct 235 ms 112640 KB Output is correct
4 Correct 283 ms 114548 KB Output is correct
5 Correct 246 ms 114668 KB Output is correct
6 Correct 316 ms 116792 KB Output is correct

Subtask #4
41.0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 24012 KB Output is correct
2 Correct 16 ms 24032 KB Output is correct
3 Correct 14 ms 24012 KB Output is correct
4 Correct 17 ms 24012 KB Output is correct
5 Correct 15 ms 24656 KB Output is correct
6 Correct 14 ms 24748 KB Output is correct
7 Correct 16 ms 24652 KB Output is correct
8 Correct 14 ms 24652 KB Output is correct
9 Correct 14 ms 24680 KB Output is correct
10 Correct 14 ms 24652 KB Output is correct
11 Correct 14 ms 24644 KB Output is correct
12 Correct 15 ms 24652 KB Output is correct
13 Correct 14 ms 24740 KB Output is correct
14 Correct 17 ms 24672 KB Output is correct
15 Correct 209 ms 112596 KB Output is correct
16 Correct 220 ms 112452 KB Output is correct
17 Correct 235 ms 112640 KB Output is correct
18 Correct 283 ms 114548 KB Output is correct
19 Correct 246 ms 114668 KB Output is correct
20 Correct 316 ms 116792 KB Output is correct
21 Correct 182 ms 112692 KB Output is correct
22 Correct 207 ms 112436 KB Output is correct
23 Correct 210 ms 112668 KB Output is correct
24 Correct 235 ms 114764 KB Output is correct
25 Correct 265 ms 117764 KB Output is correct
26 Correct 175 ms 112708 KB Output is correct
27 Correct 204 ms 112520 KB Output is correct
28 Correct 205 ms 112704 KB Output is correct
29 Correct 237 ms 114164 KB Output is correct
30 Correct 268 ms 115812 KB Output is correct
31 Correct 177 ms 112588 KB Output is correct
32 Correct 193 ms 112480 KB Output is correct
33 Correct 202 ms 112820 KB Output is correct
34 Correct 245 ms 114632 KB Output is correct
35 Correct 274 ms 117764 KB Output is correct
36 Correct 230 ms 115140 KB Output is correct