题目地址:http://codeforces.com/gym/100685/problem/G
思路:不考虑方向,则该图构成一棵树。对于每条有向边:对于正向边,权值为1;对于反向边,权值为-1。则对于一组查询(x,y),若有向图中Lca(x,y)到x距离为负且等于树中Lca(x,y)到x的距离,有向图中Lca(x,y)到y距离为正且等于树中Lca(x,y)到y的距离,则x,y连通。
#include<cstdio>
#include<queue>
#include<vector>
#include<cstring>
#include<iostream>
#include<algorithm>
#define debu
using namespace std;
const int maxn=1e5+50;
struct Node
{
int p,id;
Node(int p=0,int id=0):p(p),id(id) {}
};
int n;
queue<int> q;
int vis[maxn];
int dist[maxn];
int anc[maxn][20];
int v[maxn],d[maxn];
vector<Node> g[maxn];
void lca_dfs(int x,int dep)
{
v[x]=1,d[x]=dep;
for(int i=0; i<g[x].size(); i++)
{
int nt=g[x][i].p;
if(!v[nt])
{
dist[nt]=dist[x]+g[x][i].id;
anc[nt][0]=x;
int k=0;
while(anc[anc[nt][k]][k]!=0)
{
anc[nt][k+1]=anc[anc[nt][k]][k];
k++;
}
lca_dfs(nt,dep+1);
}
}
}
int Lca(int x,int y)
{
if(d[x]<d[y]) swap(x,y);
int l=d[x]-d[y];
int k=0;
while(l!=0)
{
if(l&1) x=anc[x][k];
l>>=1;
k++;
}
k=0;
while(x!=y)
{
if((anc[x][k]!=anc[y][k])||(!k))
{
x=anc[x][k];
y=anc[y][k];
k++;
}
else k--;
}
return x;
}
void init()
{
memset(d,0,sizeof(d));
memset(vis,0,sizeof(vis));
memset(anc,0,sizeof(anc));
memset(dist,0,sizeof(dist));
for(int i=1; i<=n; i++) g[i].clear();
}
void build()
{
memset(v,0,sizeof(v));
for(int i=1;i<=n;i++)
if(!v[i]) lca_dfs(i,0);
}
void query()
{
int q;
scanf("%d",&q);
while(q--)
{
int x,y;
scanf("%d%d",&x,&y);
int lca=Lca(x,y);
int tmpx=d[x]-d[lca];
int tmpy=d[y]-d[lca];
int distx=dist[x]-dist[lca];
int disty=dist[y]-dist[lca];
if(tmpx==-distx&&tmpy==disty) printf("Yes\n");
else printf("No\n");
}
}
int main()
{
#ifdef debug
freopen("in.in","r",stdin);
#endif // debug
scanf("%d",&n);
init();
for(int i=1; i<=n-1; i++)
{
int x,y;
scanf("%d%d",&x,&y);
g[x].push_back(Node(y,1));
g[y].push_back(Node(x,-1));
vis[y]=1;
}
build();
query();
return 0;
}