LCA + 连通图 -- Network POJ - 3694

Network POJ - 3694

思路：

code：

#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<cstdlib> 
using namespace std;
const int maxn = 1e5 + 5;

struct node{
	int u, v, next;
} g[maxn];
int head[maxn], front[maxn], cnt;
int dfn[maxn], low[maxn], sta[maxn], index[maxn], depth[maxn], pre[maxn], opt, tot, cot;
bool vis[maxn], bridge[maxn]; 
void add(int u, int v){
	g[cnt].u = u;
	g[cnt].v = v;
	g[cnt].next = head[u];
	head[u] = cnt++;
}

void init(int n){
	cnt = opt = tot = cot = 0;
	for(int i = 1; i <= n; i++){
		dfn[i] = low[i] = 0;
		vis[i] = false;
		head[i] = front[i] = -1;
		pre[i] = 0;
	}
}

void targan(int u, int in_ridge){
	dfn[u] = low[u] = ++opt;
	vis[u] = true;
	sta[cot++] = u;
	
	for(int i = head[u]; i != -1; i = g[i].next){
		int v = g[i].v;
		if(!dfn[v]) {
			targan(v, i);
			low[u] = min(low[u], low[v]);			
		}
		else if(vis[v] && i != (in_ridge ^ 1)) low[u] = min(low[u], dfn[v]);
	}
	
	if(dfn[u] == low[u]){
		int res;
		tot++;
		do{
		    res = sta[--cot];
		    vis[res] = false;
		    index[res] = tot;
		} while(res != u);
	}
}

void dfs(int u, int fa, int dep) {      //这里用bfs会更快一些，但已经写了，就懒得改了
	vis[u] = true;
	pre[u] = fa;
	depth[u] = dep;
	for(int i = front[u]; i != -1; i = g[i].next){
		int v = g[i].v;
		if(!vis[v]) dfs(v, u, dep + 1);
	}
}

int lca_cot(int u, int v){
	int sum = 0;
	if(depth[u] < depth[v]) swap(u, v);
	while(depth[u] > depth[v]){
		if(!bridge[u]) sum++;
		bridge[u] = true;		
		u = pre[u];
	}

	while(u != v){
		if(!bridge[u]) sum++;
		if(!bridge[v]) sum++;
		bridge[u] = true;
		bridge[v] = true;		
		u = pre[u];
		v = pre[v];
	}
	
	return sum;
}

int main(){
	int n, m, q, u, v;
	int cas = 0;
	while(scanf("%d%d", &n, &m), n && m){
	
		init(n);
		
		for(int i = 0; i < m; i++){
			scanf("%d%d", &u, &v);
			add(u, v);
			add(v, u);
		}
		
		for(int i = 1; i <= n; i++) if(!dfn[i]) targan(i, -1);		
		for(int i = 0; i < cnt; i++){          //缩环成点，把原图变成一颗树 
			int x = g[i].u;
			int y = g[i].v;
			if(index[x] != index[y]){
				g[i].u = index[x];
				g[i].v = index[y];
				g[i].next = front[index[x]];
				front[index[x]] = i;    //注意这里的点号是index 的值 
				pre[index[x]]++;
				pre[index[x]]++;        
			}
		}
		
		int root;                 // 找到一个点做树的根节点 
		for(int i = 1; i <= tot; i++) 
		   if(pre[i] == 2){
		   	  root = i;
		   	  break;
		   }		 
		for(int i = 1; i <= tot; i++) vis[i] = false;   //给树标记深度和每个点的父节点 
		dfs(root, 0, 0);
		 
		for(int i = 1; i <= tot; i++) bridge[i] = false;   //bridge用来标记每次加边后成环的点 
		int sum = tot - 1, sco; 
		int ans[1005];
		
		scanf("%d", &q);
		for(int i = 0; i < q; i++) {
			scanf("%d%d", &u, &v);
			sco = lca_cot(index[u], index[v]);
			sum -= sco;
		    ans[i] = sum;
		} 
		
		printf("Case %d:\n", ++cas);
		for(int i = 0; i < q; i++)
		   printf("%d\n", ans[i]);
	}
	
	
}