POJ 3177-Redundant Paths(tarjan)

类似3352题，只是这一题要考虑重边。。。。

 

#include<iostream>
#include<vector>
#include<stack>
#include<cstring>
#include<algorithm>
using namespace std;
const int N = 1005;
vector<vector<int> > e;
stack<int> s;
int low[N], dfn[N], result[N], color[N];
int n, m, index, cnt;
void tarjan(int u, int pre){
	dfn[u] = low[u] = ++index;
	s.push(u);
	int flag = 0;
	for(int i = 0; i < e[u].size(); ++i){
		int v = e[u][i];
		if(pre == v && flag == 0) { //第二次说明是重边
			flag = 1;
			continue;
		}
		if(dfn[v] == 0){
			tarjan(v, u);
			low[u] = min(low[v], low[u]);
		} else{
			low[u] = min(low[u], dfn[v]);
		}
	}
	if(dfn[u] == low[u]){
		int x;
		++cnt;
		do{
			x = s.top();
			s.pop();
			color[x] = cnt;
		}while(x != u);
	}
}
void solve(){
	for(int i = 1; i <= n; ++i){
		if(dfn[i] == 0)
			tarjan(i, 0);
	}
	for(int u = 1; u <= n; ++u){
		for(int i = 0; i < e[u].size(); ++i){
			int v = e[u][i];
			if(color[u] != color[v])
				result[color[u]]++;
		}
	}
	int ret = 0;
	for(int  i = 1; i <= n; ++i){
		if(result[i] == 1)
			ret++;
	}
	printf("%d\n", (ret + 1) / 2);
}
int main(){
	int a, b;
	while(~scanf("%d%d", &n, &m)){
		e.clear();
		memset(low, 0, sizeof(low));
		memset(color, 0, sizeof(color));
		memset(dfn, 0, sizeof(dfn));
		memset(result, 0, sizeof(result));
		index = 0, cnt = 0;
		e.resize(n + 1);
		for(int i = 0; i < m; ++i){
			scanf("%d%d", &a, &b);
			e[a].push_back(b);
			e[b].push_back(a);
		}
		solve();
	}
}