oj.uz

Submission #916915

# Submission time Handle Problem Language Result Execution time Memory
916915 2024-01-26T18:30:25 Z OAleksa Valley (BOI19_valley) C++14
100 / 100
 198 ms 52160 KB 
#include <bits/stdc++.h>
//ako ovaj vaso daso misli da me pobedjuje.....
using namespace std;
#define int long long
#define f first
#define s second
const int N	= 1e5 + 69;
const int K = 18;
const int inf = 1e18;
int up[N][K];
int gas[N][K];
int n, s, q, e, cnt[N], dep[N], par[N], mn[N];
int tin[N], tout[N], timer, d[N];
vector<pair<int, int>> g[N];
vector<pair<int, int>> edges;
bool anc(int a, int b) {
	return tin[a] <= tin[b] && tout[a] >= tout[b];
}
int Lca(int a, int b) {
	if (anc(a, b))
		return a;
	else if (anc(b, a))
		return b;
	for (int i = K - 1;i >= 0;i--) {
		if (!anc(up[a][i], b) && up[a][i] > 0)
			a = up[a][i];
	}
	return up[a][0];
}
int distance(int a, int b) {
	return dep[a] + dep[b] - 2 * dep[Lca(a, b)];
}
void dfs(int v, int p) {
	tin[v] = ++timer;
	par[v] = p;
	up[v][0] = p;
	d[v] = d[p] + 1;
	if (cnt[v])
		mn[v] = 0;
	for (int i = 1;i < K;i++)
		up[v][i] = up[up[v][i - 1]][i - 1];
	for (auto u : g[v]) {
		if (u.f == p)
			continue;
		dep[u.f] = dep[v] + u.s;
		dfs(u.f, v);
		mn[v] = min(mn[v], mn[u.f] + u.s);
	}
	tout[v] = timer;
}
void dfs1(int v, int p) {
	gas[v][0] = min(mn[v] - dep[v], mn[p] - dep[p]);
	for (int i = 1;i < K;i++) 
		gas[v][i] = min(gas[v][i - 1], gas[up[v][i - 1]][i - 1]);
	for (auto u : g[v]) {
		if (u.f == p)
			continue;
		dfs1(u.f, v);
	}
}
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int tt = 1;
  //cin >> tt;
  while (tt--) {
  	cin >> n >> s >> q >> e;
  	for (int i = 0;i <= n;i++)
  		mn[i] = inf;
  	for (int i = 1;i <= n - 1;i++) {
  		int a, b, w;
  		cin >> a >> b >> w;
  		g[a].push_back({b, w});
  		g[b].push_back({a, w});
  		edges.push_back({a, b});
  	}
  	for (int i = 1;i <= s;i++) {
  		int x;
  		cin >> x;
  		cnt[x] = 1;
  	}
  	dfs(e, 0);
  	dfs1(e, 0);
  	for (int j = 0;j < q;j++) {
  		int i, st;
  		cin >> i >> st;
  		--i;
  		int a, b;
  		tie(a, b) = edges[i];
  		if (dep[a] < dep[b])
  			swap(a, b);	
  		int ans = inf;
  		if (s == n) {
  			if (!anc(a, st) || !anc(b, st)) 
  				ans = -1;
  			else
  				ans = 0;
  		}
  		else {
  			if (!anc(a, st) || !anc(b, st)) 
  				ans = -1;
  			else {
  				int t = st;
  				int dist = d[st] - d[a];
  				ans = mn[st];
  				for (int i = 0;i < K;i++) {
  					if (dist & (1 << i)) {
  						ans = min(ans, gas[t][i] + dep[st]);
  						t = up[t][i];						
  					}
  				}
  			}
  		}
  		if (ans == inf)
  			cout << "oo\n";
  		else if (ans == -1)
  			cout << "escaped\n";
  		else
  			cout << ans << '\n';
  	}
	}
  return 0;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
27.0 / 27.0

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

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 152 ms 43620 KB Output is correct
2 Correct 147 ms 43568 KB Output is correct
3 Correct 156 ms 43708 KB Output is correct
4 Correct 170 ms 46012 KB Output is correct
5 Correct 182 ms 45648 KB Output is correct
6 Correct 178 ms 47808 KB Output is correct

Subtask #4
41.0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 10844 KB Output is correct
2 Correct 3 ms 10844 KB Output is correct
3 Correct 4 ms 10844 KB Output is correct
4 Correct 3 ms 10844 KB Output is correct
5 Correct 2 ms 10844 KB Output is correct
6 Correct 2 ms 10844 KB Output is correct
7 Correct 3 ms 10844 KB Output is correct
8 Correct 3 ms 10844 KB Output is correct
9 Correct 2 ms 10840 KB Output is correct
10 Correct 2 ms 10844 KB Output is correct
11 Correct 2 ms 10844 KB Output is correct
12 Correct 3 ms 10844 KB Output is correct
13 Correct 4 ms 10844 KB Output is correct
14 Correct 3 ms 10844 KB Output is correct
15 Correct 152 ms 43620 KB Output is correct
16 Correct 147 ms 43568 KB Output is correct
17 Correct 156 ms 43708 KB Output is correct
18 Correct 170 ms 46012 KB Output is correct
19 Correct 182 ms 45648 KB Output is correct
20 Correct 178 ms 47808 KB Output is correct
21 Correct 126 ms 43712 KB Output is correct
22 Correct 141 ms 43484 KB Output is correct
23 Correct 167 ms 43748 KB Output is correct
24 Correct 175 ms 46052 KB Output is correct
25 Correct 179 ms 49624 KB Output is correct
26 Correct 130 ms 47040 KB Output is correct
27 Correct 150 ms 46952 KB Output is correct
28 Correct 168 ms 47040 KB Output is correct
29 Correct 174 ms 48572 KB Output is correct
30 Correct 196 ms 50368 KB Output is correct
31 Correct 127 ms 47036 KB Output is correct
32 Correct 151 ms 47036 KB Output is correct
33 Correct 170 ms 47292 KB Output is correct
34 Correct 177 ms 49200 KB Output is correct
35 Correct 198 ms 52160 KB Output is correct
36 Correct 168 ms 49088 KB Output is correct