说一件很哈次卡西的事情......我刚刚学会lca倍增。
现在想来这道题并不是很难,其实就lca一顿操作,然后分类讨论。我lca写的有点久导致比赛没来得及写完,只写了个暴力,链的20分智熄失误了。
#include<bits/stdc++.h>
using namespace std;
const int MAXN=100100;
struct Edge{
int v,nxt;
}e[MAXN*2];
int lca[MAXN][20],dep[MAXN],sta[MAXN],tot,n,u,v,x,y;
void addedge(int u,int v) {e[++tot].v=v;e[tot].nxt=sta[u];sta[u]=tot;}
int R(){
int re=0,f=1;char c=getchar();
while ((c<'0')||(c>'9')) {if (c=='-') f=-f;c=getchar();}
while ((c>='0')&&(c<='9')) {re=re*10+c-'0';c=getchar();}
return re*f;
}
void dfs(int u,int f,int d){
lca[u][0]=f;dep[u]=d;
for (int i=1;i<=18;++i) lca[u][i]=lca[lca[u][i-1]][i-1];
for (int ed=sta[u];ed;ed=e[ed].nxt) if (e[ed].v!=f) dfs(e[ed].v,u,d+1);
}
int getlca(int u,int v){
for (int i=18;i>=0;--i) if (dep[lca[u][i]]>=dep[v]) u=lca[u][i];
for (int i=18;i>=0;--i) if (dep[lca[v][i]]>=dep[u]) v=lca[v][i];
if (u==v) return u;
for (int i=18;i>=0;--i) if (lca[u][i]!=lca[v][i]) {u=lca[u][i];v=lca[v][i];}
return lca[u][0];
}
bool inlian(int u,int v,int w){
return (getlca(u,w)==w)&&(dep[w]>=dep[v]);
}
bool pd(int a,int b,int c,int d){
int l1=getlca(a,b),l2=getlca(c,d);
return (inlian(a,l1,l2))||(inlian(b,l1,l2))||(inlian(c,l2,l1))||(inlian(d,l2,l1));
}
int main(){
freopen("inter.in","r",stdin);freopen("inter.out","w",stdout);
n=R();memset(lca,0,sizeof(lca));tot=1;
for (int i=1;i<n;++i) {u=R();v=R();addedge(u,v);addedge(v,u);}
dfs(1,0,1);
for (int q=R();q;--q){
u=R();v=R();x=R();y=R();
if (pd(u,v,x,y)) cout<<"YES\n";else cout<<"NO\n";
}
return 0;
}