oj.uz

Submission #959283

# Submission time Handle Problem Language Result Execution time Memory
959283 2024-04-07T20:15:28 Z pera Valley (BOI19_valley) C++17
0 / 100
 344 ms 33996 KB 
#include <bits/stdc++.h>
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 , 1e9);
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;
}
int 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 = 1e9 , 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 >= n){
			cout << "oo" << endl;
		}else{
			cout << ans + X << endl;
		}
	}
}

Compilation message

valley.cpp: In function 'void dfs(int, int, int, int)':
valley.cpp:13:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   13 |  for(int x = 0;x < g[u].size();x ++){
      |                ~~^~~~~~~~~~~~~

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 36 ms 29276 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 36 ms 29276 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 344 ms 33996 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 41.0

# Verdict Execution time Memory Grader output
1 Incorrect 36 ms 29276 KB Output isn't correct
2 Halted 0 ms 0 KB -