因为每个可以重复走,所以当dist <= k 时并且奇偶性相同,则可以到达。
现在增加 x 到 y 的一条路,问你能不能满足条件。
给你的路要么走要么不走,不走 tmp1= dist (a,b)
走时要么从先走x,要么先走y
所以就是 tmp2 = dist(a,x) + dist(b,y) +1 //1为x走到y。
tmp3 = dist(a,y) + dist(b,x) +1,然后判断有没有满足的要求就行了。
#define _CRT_SECURE_NO_WARNINGS
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<string.h>
#include<vector>
#include<queue>
#include<stack>
#include<cmath>
#include<set>
#include<map>
#include<bitset>
#include<unordered_map>
using namespace std;
#define LL long long
#define eps (1e-9)
typedef unsigned long long ull;
const int maxn = 1e5 + 10;
const int inf = 0x3f3f3f3f;
const double pi = acos(-1.0);
const int bas = 131;
const LL mod = 1e6 + 3;
struct node
{
int v, nxt;
}e[maxn << 1];
int cnt, head[maxn];
int dep[maxn], f[maxn][22];
int lg[maxn];
void add(int u, int v)
{
e[++cnt].v = v;
e[cnt].nxt = head[u];
head[u] = cnt;
}
void dfs(int x, int fat)
{
dep[x] = dep[fat] + 1;
f[x][0] = fat;
for (int i = 1; (1 << i) <= dep[x]; i++)
{
f[x][i] = f[f[x][i - 1]][i - 1];
}
for (int i = head[x]; i; i = e[i].nxt)
{
if (e[i].v != fat) dfs(e[i].v, x);
}
}
int lca(int x, int y)
{
if (dep[x] < dep[y]) swap(x, y);
while (dep[x] != dep[y])
{
x = f[x][lg[dep[x] - dep[y]] - 1];
}
if (x == y) return x;
for (int i = lg[dep[x]]; i >= 0; i--)
{
if (f[x][i] != f[y][i])
{
x = f[x][i];
y = f[y][i];
}
}
return f[x][0];
}
int getx(int x, int y)
{
int fat = lca(x, y);
return dep[x] + dep[y] - 2 * dep[fat];
}
bool check(int d, int k)
{
if (d <= k && (d % 2 == k % 2))return true;
return false;
}
int main()
{
int n;
scanf("%d", &n);
int u, v;
for (int i = 1; i < n; i++)
{
scanf("%d%d", &u, &v);
add(u, v), add(v, u);
}
for (int i = 1; i <= n; i++)
{
lg[i] = lg[i - 1];
if (i == (1 << lg[i - 1])) lg[i]++;
}
dfs(1, 0);
int m;
scanf("%d", &m);
int x, y, a, b, k;
while (m--)
{
scanf("%d%d%d%d%d", &x, &y, &a, &b, &k);
if (check(getx(a, b), k) || check(getx(a, x) + getx(b, y) + 1, k) || check(getx(a, y) + getx(b, x) + 1, k))
{
printf("YES\n");
}
else printf("NO\n");
}
return 0;
}