题意:
给一个V≤105有向的,但是忽略方向是一颗树的「树」,每次查询u→v是否可达,Q≤105
分析:
随便设一个点当根,那么边有两种:「向上」和「向下」的。我们可以预处理 dp[u] 表示 u 到根的路径上「向上」「向下」的边有多少条,有了这个,我们可以 O(1) 计算出任意路径上「向上」「向下」的边的数量。
当询问 u→v 是否可达的时候,计算出 LCA(u,v)=w ,要求 u→w 路径上全是「向上」的边, w→v 路径上全是向下的边即可。
代码:
//
// Created by TaoSama on 2015-10-04
// Copyright (c) 2015 TaoSama. All rights reserved.
//
//#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define pr(x) cout << #x << " = " << x << " "
#define prln(x) cout << #x << " = " << x << endl
const int N = 1e5 + 10, INF = 0x3f3f3f3f, MOD = 1e9 + 7;
int n, q;
struct Edge {
int v;
bool tag;
};
vector<Edge> G[N];
int dep[N], dp[N], p[18][N];
void dfs(int u, int f, int d) {
dep[u] = d;
p[0][u] = f;
for(int i = 0; i < G[u].size(); ++i) {
Edge& e = G[u][i];
if(e.v == f) continue;
dp[e.v] = dp[u] + (e.tag ? 1 : -1);
dfs(e.v, u, d + 1);
}
}
void gao() {
dp[1] = 0;
dfs(1, -1, 0);
for(int i = 0; i + 1 < 18; ++i)
for(int v = 1; v <= n; ++v)
if(p[i][v] < 0) p[i + 1][v] = -1;
else p[i + 1][v] = p[i][p[i][v]];
}
int lca(int u, int v) {
if(dep[u] > dep[v]) swap(u, v);
for(int i = 0; i < 18; ++i)
if(dep[v] - dep[u] >> i & 1)
v = p[i][v];
if(u == v) return u;
for(int i = 18 - 1; ~i; --i) {
if(p[i][u] != p[i][v]) {
u = p[i][u];
v = p[i][v];
}
}
return p[0][u];
}
int main() {
#ifdef LOCAL
freopen("in.txt", "r", stdin);
// freopen("out.txt","w",stdout);
#endif
ios_base::sync_with_stdio(0);
while(scanf("%d", &n) == 1) {
for(int i = 1; i <= n; ++i) G[i].clear();
for(int i = 1; i < n; ++i) {
int u, v; scanf("%d%d", &u, &v);
G[u].push_back((Edge) {v, 1});
G[v].push_back((Edge) {u, 0});
}
scanf("%d", &q);
gao();
while(q--) {
int u, v; scanf("%d%d", &u, &v);
int _lca = lca(u, v);
int depu = dep[u] - dep[_lca];
int depv = dep[v] - dep[_lca];
int disu = dp[u] - dp[_lca];
int disv = dp[v] - dp[_lca];
if(depu == -disu && depv == disv) puts("Yes");
else puts("No");
}
}
return 0;
}