oj.uz

Submission #696092

# Submission time Handle Problem Language Result Execution time Memory
696092 2023-02-05T11:57:28 Z Kahou Valley (BOI19_valley) C++14
100 / 100
 226 ms 50728 KB 
/* In the name of God, aka Allah */
// let this be mytemp.cpp
#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define endl '\n'
#define mk make_pair
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const ll inf = 1e18;
const int N = 1e5 + 50, LG = 20;
ll n, s, q, e, par[LG][N], sp[LG][N], dp[N], h[N], dis[N];
pll E[N];
vector<pll> adj[N];

void dfs(int u, int p) {
	par[0][u] = p;
	for (pll x:adj[u]) {
		int v = x.F, w = x.S;
		if (v == p) continue;
		dis[v] = dis[u]+w;
		h[v] = h[u] + 1;
		dfs(v, u);
		dp[u] = min(dp[u], dp[v]+w);
	}
	sp[0][u] = dp[u]-dis[u];
}

pll Par(int u, int x) {
	ll out = inf;
	for (int k = LG-1; k >= 0; k--) {
		if (x>>k&1) {
			out = min(out, sp[k][u]);
			u = par[k][u];
		}
	}
	out = min(out, sp[0][u]);
	return {u, out};
}
void solve() {
	cin >> n >> s >> q >> e;
	for (int i = 1; i <= n-1; i++) {
		int u, v, w;
		cin >> u >> v >> w;
		adj[u].push_back({v, w});
		adj[v].push_back({u, w});
		E[i] = {u, v};
	}
	for (int u = 1; u <= n; u++) {
		dp[u] = inf;
	}
	for (int i = 1; i <= s; i++) {
		int u;
		cin >> u;
		dp[u] = 0;
	}
	dfs(e, 0);
	for (int i = 1; i <= n-1; i++) {
		if (h[E[i].F] < h[E[i].S]) swap(E[i].F, E[i].S);
	}
	for (int k = 1; k < LG; k++) {
		for (int u = 1; u <= n; u++) {
			par[k][u] = par[k-1][par[k-1][u]];
			sp[k][u] = min(sp[k-1][u],sp[k-1][par[k-1][u]]);
		}
	}
	
	while (q--) {
		int u, id;
		cin >> id >> u;
		pll out = Par(u, h[u]-h[E[id].F]);
		if (out.F != E[id].F) {
			cout << "escaped" << endl;
		}
		else {
			ll ans = out.S + dis[u];
			if (ans >= inf) cout << "oo" << endl;
			else cout << ans << endl;
		}
	}
}
int main() {
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	solve();
	return 0;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 3028 KB Output is correct
2 Correct 4 ms 3028 KB Output is correct
3 Correct 4 ms 3028 KB Output is correct
4 Correct 5 ms 3028 KB Output is correct
5 Correct 2 ms 3284 KB Output is correct
6 Correct 2 ms 3284 KB Output is correct
7 Correct 3 ms 3284 KB Output is correct
8 Correct 3 ms 3336 KB Output is correct
9 Correct 2 ms 3284 KB Output is correct
10 Correct 3 ms 3284 KB Output is correct
11 Correct 2 ms 3284 KB Output is correct
12 Correct 3 ms 3332 KB Output is correct
13 Correct 3 ms 3332 KB Output is correct
14 Correct 2 ms 3284 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 121 ms 44480 KB Output is correct
2 Correct 158 ms 44408 KB Output is correct
3 Correct 168 ms 44756 KB Output is correct
4 Correct 189 ms 46908 KB Output is correct
5 Correct 162 ms 46892 KB Output is correct
6 Correct 226 ms 49592 KB Output is correct

Subtask #4
41.0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 3028 KB Output is correct
2 Correct 4 ms 3028 KB Output is correct
3 Correct 4 ms 3028 KB Output is correct
4 Correct 5 ms 3028 KB Output is correct
5 Correct 2 ms 3284 KB Output is correct
6 Correct 2 ms 3284 KB Output is correct
7 Correct 3 ms 3284 KB Output is correct
8 Correct 3 ms 3336 KB Output is correct
9 Correct 2 ms 3284 KB Output is correct
10 Correct 3 ms 3284 KB Output is correct
11 Correct 2 ms 3284 KB Output is correct
12 Correct 3 ms 3332 KB Output is correct
13 Correct 3 ms 3332 KB Output is correct
14 Correct 2 ms 3284 KB Output is correct
15 Correct 121 ms 44480 KB Output is correct
16 Correct 158 ms 44408 KB Output is correct
17 Correct 168 ms 44756 KB Output is correct
18 Correct 189 ms 46908 KB Output is correct
19 Correct 162 ms 46892 KB Output is correct
20 Correct 226 ms 49592 KB Output is correct
21 Correct 113 ms 44604 KB Output is correct
22 Correct 112 ms 44452 KB Output is correct
23 Correct 176 ms 44648 KB Output is correct
24 Correct 153 ms 47140 KB Output is correct
25 Correct 199 ms 50728 KB Output is correct
26 Correct 145 ms 44620 KB Output is correct
27 Correct 111 ms 44484 KB Output is correct
28 Correct 139 ms 44700 KB Output is correct
29 Correct 175 ms 46548 KB Output is correct
30 Correct 200 ms 48196 KB Output is correct
31 Correct 119 ms 44620 KB Output is correct
32 Correct 136 ms 44576 KB Output is correct
33 Correct 148 ms 44804 KB Output is correct
34 Correct 150 ms 46980 KB Output is correct
35 Correct 194 ms 50676 KB Output is correct
36 Correct 157 ms 47348 KB Output is correct