http://acm.hdu.edu.cn/showproblem.php?pid=4547
水题
1419MS 12896K
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cstdlib>
#include<string>
#include<map>
const int maxn=100010;
const int maxq=100010;
using namespace std;
int n,m;
string s1,s2;
int cnt;
map<string,int> mp;
bool vis[maxn],in[maxn];
int f[maxn],answer[maxn],dis[maxn];
struct node1{
int to,w;
int next;
}edge[maxn<<1];int head[maxn],tot;
struct node2{
int to,next;
int num;
}que[maxq<<1];int h[maxn],tt;
void addedge(int u,int v,int w){
edge[tot].w=w;
edge[tot].to=v;
edge[tot].next=head[u];
head[u]=tot++;
}
void add_query(int u,int v,int num){
que[tt].to=v;
que[tt].num=num;
que[tt].next=h[u];
h[u]=tt++;
que[tt].to=u;
que[tt].num=num;
que[tt].next=h[v];
h[v]=tt++;
}
int find(int x){
return f[x]==-1 ?x:f[x]=find(f[x]);
}
void Union(int a,int b){
int t1=find(a);
int t2=find(b);
if(t1!=t2) f[t2]=t1;
}
void Tarjan(int u){
for(int i=head[u];i!=-1;i=edge[i].next){
int v=edge[i].to;
if(vis[v]) continue;
dis[v]=dis[u]+edge[i].w;
Tarjan(v);
Union(u,v);
}vis[u]=1;
for(int i=h[u];i!=-1;i=que[i].next){
int v=que[i].to;
if(vis[v]){
if(~i&1){
answer[que[i].num]=dis[u]-dis[find(v)]+(find(v)==v ?0:1);
}else{
answer[que[i].num]=dis[v]-dis[find(v)]+(find(v)==u ?0:1);
}
}
}
}
void Init(){
tot=tt=cnt=0;
mp.clear();
memset(f,-1,sizeof(f));
memset(head,-1,sizeof(head));
memset(h,-1,sizeof(h));
memset(vis,false,sizeof(vis));
memset(in,false,sizeof(in));
memset(dis,0,sizeof(dis));
}
int main()
{
//#ifndef ONLINE_JUDGE
//freopen("in.cpp","r",stdin);
//#endif // ONLINE_JUDGE
int T;
cin>>T;
while(T--){
Init();
scanf("%d%d",&n,&m);
for(int i=0;i<n-1;++i){
cin>>s1>>s2;
if(!mp[s1]) mp[s1]=++cnt;
if(!mp[s2]) mp[s2]=++cnt;
addedge(mp[s2],mp[s1],1);
in[mp[s1]]=true;
}
for(int i=0;i<m;++i){
cin>>s1>>s2;
if(!mp[s1]) mp[s1]=++cnt;
if(!mp[s2]) mp[s2]=++cnt;
add_query(mp[s1],mp[s2],i);
}
for(int i=1;i<=cnt;++i){
if(in[i]==false){
Tarjan(i);
break;
}
}
for(int i=0;i<m;++i){
printf("%d\n",answer[i]);
}
}
return 0;
}