UVa247 Floyd判断可达 深搜求环

1A，主要是将phoneMap转化为connMap，然后深搜求出同在一个圈的id。

#include<iostream>
#include<cstring>
#include<cstdlib>
#include<cstdio>
#include<cmath>
#include<string>
#include<map>
#include<set>
#include<algorithm>
#include<vector>
#include<stack>
#include<sstream>
#define ll long long
using namespace std;
/**********************************************************/
const int M_NUM_MAX = 30;
const int M_INT_MAX = 0x7fffffff;
const double M_DBL_MAX = 1.7976931348623158e+308;
const double M_DBL_MIN = 2.2250738585072014e-308;
int n,m;
map<string,int> name2ID;//将姓名映射成id
vector<string> id2Name;//将id转化成姓名
bool phoneMap[M_NUM_MAX][M_NUM_MAX],connMap[M_NUM_MAX][M_NUM_MAX];//connMap只有环才能连通，去除单向到达的边
int vis[M_NUM_MAX];
/**********************************************************/
int min_2 (int x,int y) {return x<y?x:y;}
int max_2 (int x,int y) {return x>y?x:y;}
void floyd ()
{
  for (int k=0;k<n;k++)
	for (int i=0;i<n;i++)
	  for (int j=0;j<n;j++)
		phoneMap[i][j]=phoneMap[i][j] || (phoneMap[i][k]&&phoneMap[k][j]);
}
int arr[M_NUM_MAX],alen=0;
void dfs (int x)
{
  vis[x]=1;
  arr[alen++]=x;
  for (int i=0;i<n;i++)
	if (!vis[i]&&connMap[x][i] && connMap[i][x])
	  dfs(i);
}
/**********************************************************/
int main()
{
  //freopen ("in.txt","r",stdin);
  int t=1;
  while (cin>>n>>m && (n!=0||m!=0))
  {
	string a,b;
	cnt=0;
	memset (phoneMap,0,sizeof (phoneMap));
	memset (connMap,0,sizeof (connMap));
	memset (vis,0,sizeof (vis));
	name2ID.clear ();
	id2Name.clear ();
	int mid=0;
	for (int i=0;i<m;i++){
	  cin>>a>>b;
	  if (name2ID.count(a)==0){
		id2Name.push_back(a);
		name2ID[a]=mid++;
	  }
	  if (name2ID.count(b)==0){
		id2Name.push_back(b);
		name2ID[b]=mid++;
	  }
	  int l=name2ID[a],r=name2ID[b];
	  phoneMap[l][r]=true;
	}
	floyd ();
	for (int i=0;i<n;i++)
	  for (int j=i+1;j<n;j++)
		if (phoneMap[i][j]&&phoneMap[j][i])
		  connMap[i][j]=connMap[j][i]=true;
	cout<<"Calling circles for data set "<<t++<<":"<<endl;
	for (int i=0;i<n;i++) if (!vis[i]) {
	  alen=0;
	  dfs (i);
	  for (int j=0;j<alen-1;j++)
		cout<<id2Name[arr[j]]<<", ";
	  cout<<id2Name[arr[alen-1]]<<endl;
	}
  }
  return 0;
}