oj.uz

Submission #945146

# Submission time Handle Problem Language Result Execution time Memory
945146 2024-03-13T12:48:16 Z NintsiChkhaidze Valley (BOI19_valley) C++17
100 / 100
 245 ms 56268 KB 
#include <bits/stdc++.h>
#define ll long long
#define s second
#define f first
#define pb push_back
#define pii pair <int,int>
#define left (h<<1),l,(l + r)/2
#define right ((h<<1)|1),(l + r)/2 + 1,r
#define int ll
using namespace std;

const int N = 1e5 + 3;

pair <pii,int> edge[N];
vector <pii> v[N];
int d[25][N],dep[N],dp[N],dist[N];
int mn[25][N];
int timer,tin[N],tout[N];

void dfs(int x,int par){
	dep[x] = dep[par] + 1;
	d[0][x] = par;
	tin[x] = ++timer;

	for (auto [to,w]: v[x]){
		if (to==par) continue;
		dp[to] = dp[x] + w;
		dfs(to,x);
		dist[x] = min(dist[x],dist[to] + w);
	}

	tout[x] = timer;
}

signed main(){
	ios_base::sync_with_stdio(0),cin.tie(NULL),cout.tie(NULL);

	int n,s,q,root;
	cin>>n>>s>>q>>root;

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

	for (int i = 1; i <= n; i++){
		dist[i] = 1e18;
	}
	for (int i = 1; i <= s; i++){
		int x;
		cin>>x;
		dist[x]=0;
	}

	dfs(root,root);
	for (int i = 1; i < n; i++){
		if (dep[edge[i].f.f] > dep[edge[i].f.s])
			swap(edge[i].f.f,edge[i].f.s);
	}

	for (int i =0;i <= 18; i++)
		for (int j = 0; j <= n; j++)
			mn[i][j] = 1e18;
	
	for (int j = 1; j <= n; j++)
		mn[0][j] = dist[j];

	for (int i = 1; i <= 18; i++){
		for (int j = 1; j <= n; j++){
			d[i][j] = d[i - 1][d[i - 1][j]];
			mn[i][j] = min(mn[i - 1][j],dp[j] - dp[d[i - 1][j]] + mn[i - 1][d[i - 1][j]]);
		}
	}

	while (q--){
		int x,y;
		cin>>x>>y;

		x = edge[x].f.s;
		if (!(tin[x] <= tin[y] && tout[y] <= tout[x])){
			cout<<"escaped"<<endl;
			continue;
		}

		int ans = 1e18,len = dep[y] - dep[x] + 1,D = 0;
		for (int i = 18; i >= 0; i--){
			if ((len & (1LL<<i)) > 0) {
				ans = min(ans,mn[i][y] + D);
				D += dp[y] - dp[d[i][y]];
				y = d[i][y];
			}
		}

		if (ans == 1e18) cout<<"oo"<<endl;
		else cout<<ans<<endl;
	}
}

Subtask #1
9.0 / 9.0

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

Subtask #2
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 39516 KB Output is correct
2 Correct 17 ms 39516 KB Output is correct
3 Correct 17 ms 39516 KB Output is correct
4 Correct 17 ms 39516 KB Output is correct
5 Correct 6 ms 39512 KB Output is correct
6 Correct 6 ms 39516 KB Output is correct
7 Correct 7 ms 39516 KB Output is correct
8 Correct 7 ms 39800 KB Output is correct
9 Correct 6 ms 39516 KB Output is correct
10 Correct 6 ms 39516 KB Output is correct
11 Correct 6 ms 39516 KB Output is correct
12 Correct 6 ms 39512 KB Output is correct
13 Correct 7 ms 39516 KB Output is correct
14 Correct 6 ms 39464 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 185 ms 51536 KB Output is correct
2 Correct 193 ms 51284 KB Output is correct
3 Correct 199 ms 51532 KB Output is correct
4 Correct 245 ms 53584 KB Output is correct
5 Correct 230 ms 53584 KB Output is correct
6 Correct 227 ms 55820 KB Output is correct

Subtask #4
41.0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 39516 KB Output is correct
2 Correct 17 ms 39516 KB Output is correct
3 Correct 17 ms 39516 KB Output is correct
4 Correct 17 ms 39516 KB Output is correct
5 Correct 6 ms 39512 KB Output is correct
6 Correct 6 ms 39516 KB Output is correct
7 Correct 7 ms 39516 KB Output is correct
8 Correct 7 ms 39800 KB Output is correct
9 Correct 6 ms 39516 KB Output is correct
10 Correct 6 ms 39516 KB Output is correct
11 Correct 6 ms 39516 KB Output is correct
12 Correct 6 ms 39512 KB Output is correct
13 Correct 7 ms 39516 KB Output is correct
14 Correct 6 ms 39464 KB Output is correct
15 Correct 185 ms 51536 KB Output is correct
16 Correct 193 ms 51284 KB Output is correct
17 Correct 199 ms 51532 KB Output is correct
18 Correct 245 ms 53584 KB Output is correct
19 Correct 230 ms 53584 KB Output is correct
20 Correct 227 ms 55820 KB Output is correct
21 Correct 207 ms 51204 KB Output is correct
22 Correct 181 ms 50772 KB Output is correct
23 Correct 185 ms 51108 KB Output is correct
24 Correct 215 ms 53240 KB Output is correct
25 Correct 216 ms 56268 KB Output is correct
26 Correct 191 ms 51096 KB Output is correct
27 Correct 183 ms 50944 KB Output is correct
28 Correct 186 ms 51028 KB Output is correct
29 Correct 221 ms 52608 KB Output is correct
30 Correct 245 ms 54160 KB Output is correct
31 Correct 180 ms 51028 KB Output is correct
32 Correct 204 ms 50912 KB Output is correct
33 Correct 192 ms 51296 KB Output is correct
34 Correct 220 ms 53104 KB Output is correct
35 Correct 205 ms 56124 KB Output is correct
36 Correct 202 ms 53072 KB Output is correct