Submission #959284

# Submission time Handle Problem Language Result Execution time Memory
959284 2024-04-07T20:17:12 Z pera Valley (BOI19_valley) C++17
100 / 100
497 ms 62540 KB
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 1e5 + 1 , lg = 21;
int n , s , q , root , T = 0;
vector<int> U(N) , V(N) , W(N) , in(N) , out(N) , d(N) , D(N) , closest(N , 1e18);
vector<vector<int>> up(N , vector<int>(lg)) , mn(N , vector<int>(lg));
vector<vector<pair<int , int>>> g(N);
void dfs(int u , int p = 0 , int ds = 0 , int Ds = 0){
	in[u] = ++T;
	d[u] = ds;
	D[u] = Ds++;
	up[u][0] = p;
	for(int x = 0;x < g[u].size();x ++){
		if(g[u][x].first != p){
			dfs(g[u][x].first , u , ds + g[u][x].second , Ds);
			closest[u] = min(closest[u] , closest[g[u][x].first] + g[u][x].second);
		}
	}
	mn[u][0] = closest[u] - d[u];
	out[u] = T;
}
main() {
	cin >> n >> s >> q >> root;
	for(int i = 1;i < n;i ++){
		cin >> U[i] >> V[i] >> W[i];
		g[U[i]].push_back({V[i] , W[i]});
		g[V[i]].push_back({U[i] , W[i]});
	}
	for(int i = 1;i <= s;i ++){
		int u;
		cin >> u;
		closest[u] = 0;
	}
	dfs(root);
	for(int x = 1;x < lg;x ++){
		for(int u = 1;u <= n;u ++){
			up[u][x] = up[up[u][x - 1]][x - 1];
			mn[u][x] = min(mn[u][x - 1] , mn[up[u][x - 1]][x - 1]);
		}
	}
	while(q--){
		int I , u;
		cin >> I >> u;
		if(d[U[I]] < d[V[I]]) swap(U[I] , V[I]);
		if(!(in[U[I]] <= in[u] && out[u] <= out[U[I]])){
			cout << "escaped" << endl;
			continue;
		}
		int ans = 1e18 , e = D[u] - D[U[I]] , X = d[u];
		for(int x = lg - 1;x >= 0;x --){
			if((e + 1) & (1 << x)){
				ans = min(ans , mn[u][x]);
				u = up[u][x];
			}
		}
		if(ans + X > (n - 1) * (int)1e9){
			cout << "oo" << endl;
		}else{
			cout << ans + X << endl;
		}
	}
}

Compilation message

valley.cpp: In function 'void dfs(long long int, long long int, long long int, long long int)':
valley.cpp:14:18: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   14 |  for(int x = 0;x < g[u].size();x ++){
      |                ~~^~~~~~~~~~~~~
valley.cpp: At global scope:
valley.cpp:23:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   23 | main() {
      | ^~~~
# Verdict Execution time Memory Grader output
1 Correct 41 ms 48216 KB Output is correct
2 Correct 48 ms 48308 KB Output is correct
3 Correct 40 ms 48220 KB Output is correct
4 Correct 47 ms 48224 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 41 ms 48216 KB Output is correct
2 Correct 48 ms 48308 KB Output is correct
3 Correct 40 ms 48220 KB Output is correct
4 Correct 47 ms 48224 KB Output is correct
5 Correct 27 ms 48220 KB Output is correct
6 Correct 28 ms 48220 KB Output is correct
7 Correct 28 ms 48208 KB Output is correct
8 Correct 27 ms 48276 KB Output is correct
9 Correct 27 ms 48220 KB Output is correct
10 Correct 30 ms 48220 KB Output is correct
11 Correct 27 ms 48220 KB Output is correct
12 Correct 28 ms 48232 KB Output is correct
13 Correct 27 ms 48312 KB Output is correct
14 Correct 33 ms 48220 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 370 ms 53972 KB Output is correct
2 Correct 379 ms 57568 KB Output is correct
3 Correct 405 ms 57912 KB Output is correct
4 Correct 426 ms 59752 KB Output is correct
5 Correct 378 ms 59808 KB Output is correct
6 Correct 485 ms 61848 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 41 ms 48216 KB Output is correct
2 Correct 48 ms 48308 KB Output is correct
3 Correct 40 ms 48220 KB Output is correct
4 Correct 47 ms 48224 KB Output is correct
5 Correct 27 ms 48220 KB Output is correct
6 Correct 28 ms 48220 KB Output is correct
7 Correct 28 ms 48208 KB Output is correct
8 Correct 27 ms 48276 KB Output is correct
9 Correct 27 ms 48220 KB Output is correct
10 Correct 30 ms 48220 KB Output is correct
11 Correct 27 ms 48220 KB Output is correct
12 Correct 28 ms 48232 KB Output is correct
13 Correct 27 ms 48312 KB Output is correct
14 Correct 33 ms 48220 KB Output is correct
15 Correct 370 ms 53972 KB Output is correct
16 Correct 379 ms 57568 KB Output is correct
17 Correct 405 ms 57912 KB Output is correct
18 Correct 426 ms 59752 KB Output is correct
19 Correct 378 ms 59808 KB Output is correct
20 Correct 485 ms 61848 KB Output is correct
21 Correct 349 ms 57768 KB Output is correct
22 Correct 347 ms 56908 KB Output is correct
23 Correct 377 ms 57312 KB Output is correct
24 Correct 411 ms 59288 KB Output is correct
25 Correct 414 ms 62480 KB Output is correct
26 Correct 336 ms 57172 KB Output is correct
27 Correct 381 ms 57132 KB Output is correct
28 Correct 387 ms 57312 KB Output is correct
29 Correct 497 ms 58704 KB Output is correct
30 Correct 404 ms 60568 KB Output is correct
31 Correct 338 ms 57184 KB Output is correct
32 Correct 368 ms 57040 KB Output is correct
33 Correct 379 ms 57536 KB Output is correct
34 Correct 445 ms 59592 KB Output is correct
35 Correct 420 ms 62540 KB Output is correct
36 Correct 370 ms 59216 KB Output is correct