算法竞赛入门经典第十一章

例题11-4 电话圈 UVa247

 

#include <bits/stdc++.h>
using namespace std;

/* run this program using the console pauser or add your own getch, system("pause") or input loop */
/*
5 6
Ben Alexander
Alexander Dolly
Dolly Ben
Dolly Benedict
Benedict Dolly
Alexander Aaron
14 34
John Aaron
Aaron Benedict
Betsy John
Betsy Ringo
Ringo Dolly
Benedict Paul
John Betsy
John Aaron
Benedict George
Dolly Ringo
Paul Martha
George Ben
Alexander George
Betsy Ringo
Alexander Stephen
Martha Stephen
Benedict Alexander
Stephen Paul
Betsy Ringo
Quincy Martha
Ben Patrick
Betsy Ringo
Patrick Stephen
Paul Alexander
Patrick Ben
Stephen Quincy
Ringo Betsy
Betsy Benedict
Betsy Benedict
Betsy Benedict
Betsy Benedict
Betsy Benedict
Betsy Benedict
Quincy Martha
0 0

*/
vector<string> names;
int setID(string name){
	for(int i=0;i<names.size();i++){
		if(name==names[i])
		    return i;
	}
	names.push_back(name);
	return names.size()-1;
}
int main(int argc, char *argv[]) {
	const int maxn=30;
	//map<int,string> name;
	int n,m;
	int kase=0;
	while(cin>>n>>m&&n!=0){
	    int g[maxn][maxn];
		memset(g,0,sizeof(g));
		names.clear();
		for(int i=0;i<n;i++){
			for(int j=0;j<n;j++){
				if(i==j){
					g[i][j]=1;
				}
				else 
				    g[i][j]=0;
			}
		}
		for(int i=0;i<m;i++){
			char name1[30],name2[30];
			scanf("%s%s",name1,name2);
			int id1=setID(name1);
			int id2=setID(name2);
			g[id1][id2]=1;
		}
		for(int k=0;k<n;k++){
			for(int i=0;i<n;i++){
				for(int j=0;j<n;j++){
					if(g[i][j]==0&&(g[i][k]==1&&g[k][j]==1))
					    g[i][j]=1;
				}
			}
		}
		int vis[maxn];
		memset(vis,0,sizeof(vis));
		cout<<"Calling circles for data set "<<++kase<<":";
		for(int i=0;i<n;i++){
			if(vis[i]==0){
			for(int j=0;j<n;j++){
				if(j==0)
			        cout<<endl;
				if(g[i][j]==1&&g[j][i]==1){
			        
					if(vis[i]==0){
					    cout<<names[i];
					    vis[i]=1;
					}
					if(vis[j]==0){
						cout<<" ,"<<names[j];
						vis[j]=1;
					}
				}
			}
		    }
		}
		cout<<endl;
	} 
	return 0;
}