【LCA】 HDOJ 4547 CD操作

就是简单地求一下LCA就行了。。。

#include <iostream>
#include <queue> 
#include <stack> 
#include <map> 
#include <set> 
#include <bitset> 
#include <cstdio> 
#include <algorithm> 
#include <cstring> 
#include <climits>
#include <cstdlib>
#include <cmath>
#include <time.h>
#define maxn 100005
#define maxm 200005
#define eps 1e-7i
#define mod 1000000007
#define INF 0x3f3f3f3f
#define PI (acos(-1.0))
#define lowbit(x) (x&(-x))
#define mp make_pair
#define ls o<<1
#define rs o<<1 | 1
#define lson o<<1, L, mid 
#define rson o<<1 | 1, mid+1, R
#define pii pair<int, int>
#pragma comment(linker, "/STACK:16777216")
typedef long long LL;
typedef unsigned long long ULL;
//typedef int LL;
using namespace std;
LL qpow(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base;base=base*base;b/=2;}return res;}
LL powmod(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base%mod;base=base*base%mod;b/=2;}return res;}
// head

struct Edge
{
	int v;
	Edge *next;
}*H[maxn], *edges, E[maxm];

map<string, int> mpp;
string s;
int anc[maxn][20];
int size[maxn];
int dep[maxn];
int in[maxn];
int n, m;
const int M = 20;

void init()
{
	mpp.clear();
	edges = E;
	memset(H, 0, sizeof H);
	memset(in, 0, sizeof in);
}

void addedges(int u, int v)
{
	edges->v = v;
	edges->next = H[u];
	H[u] = edges++;
}

void read()
{
	int u, v, cnt = 1;
	scanf("%d%d", &n, &m);
	for(int i = 1; i < n; i++) {
		cin >> s;
		if(mpp.count(s)) v = mpp[s];
		else v = mpp[s] = cnt++;
		cin >> s;
		if(mpp.count(s)) u = mpp[s];
		else u = mpp[s] = cnt++;
		in[v]++;
		addedges(u, v);
	}
}

void dfs(int u, int fa)
{
	size[u] = 1, anc[u][0] = fa;
	for(Edge *e = H[u]; e; e = e->next) {
		int v = e->v;
		dep[v] = dep[u] + 1;
		dfs(v, u);
		size[u] += size[v];
	}
}

int to(int u, int d)
{
	for(int i = M - 1; i >= 0; i--) if(dep[anc[u][i]] >= d) u = anc[u][i];
	return u;
}

int lca(int u, int v)
{
	if(dep[u] < dep[v]) swap(u, v);
	u = to(u, dep[v]);
	for(int i = M - 1; i >= 0; i--) if(anc[u][i] != anc[v][i]) u = anc[u][i], v = anc[v][i];
	return u == v ? u : anc[u][0];
}

void work()
{
	int u, v, root;
	for(int i = 1; i <= n; i++) if(!in[i]) root = i;
	dep[root] = 0;
	dfs(root, root);
	for(int i = 1; i < M; i++)
		for(int j = 1; j <= n; j++)
			anc[j][i] = anc[anc[j][i-1]][i-1];
	while(m--) {
		cin >> s;
		u = mpp[s];
		cin >> s;
		v = mpp[s];
		int f = lca(u, v);
		int ans = dep[u] - dep[f];
		if(f != v) ans++;
		printf("%d\n", ans);
	}
}

int main()
{
	int _;
	while(scanf("%d", &_)!=EOF) {
		while(_--) {
			init();
			read();
			work();
		}
	}
	
	return 0;
}