floyd闭包或者加一点并查集uva247

这题我学习了map的用法以及string 的快速输入与输出，这题格式要求 严格输出要有逗号加一个空格，还有就是每次都要换行什么烦死啦！！！！（反正仔细看输出格式）

其他都很水。。。。。

带并查集的10ms做法:

#include<iostream>
#include<cstdio>
#include<map>
#include<vector>
#include<string>
#include<queue>
using namespace std;
string name[60];
queue<string>show[60];
map<string, int>findd;
void get(string &a)
{
	a.resize(50);
	int k = 0;
	while (1)
	{
		a[k] = getchar();
		if (a[k] == '\n' || a[k] == ' ')
		{
			a[k] = '\0';
			break;
		}
		k++;
	}
}
void out(string a)
{
	int k = 0;
	printf("%s", a.c_str());
}
int amount;
int floyd[60][60];
int ufa[60];
void init(int n)
{
	for (int i = 1; i <= n; i++)
		ufa[i] = i;
}
int find(int num)
{
	if (ufa[num] == num)return num;
	else
		return ufa[num] = find(ufa[num]);
}
void unionn(int a, int b)
{
	int x = find(a);
	int y = find(b);
	if (x == y)
		return;
	else
		ufa[x] = y;
}
int main()
{
	
	int n, m;
	int times = 1;
	while( (scanf("%d%d", &n, &m) && n&&m))
	{
		amount = 1;
		init(n);
		for (int i = 1; i <=n; i++)
			for (int j = 1; j <=n; j++)
				floyd[i][j] = 0;
		getchar();
		for (int i = 0; i < m; i++)
		{
			string a, b;
			get(a), get(b);
			if (findd[a] == 0)
			{
				name[amount] = a;
				findd[a] = amount++;
			}
			if (findd[b] == 0)
			{
				name[amount] = b;
				findd[b] = amount++;
			}
			floyd[findd[a]][findd[b]] = 1;
		}
		for (int i = 1; i <= n; i++)
			for (int j = 1; j <= n; j++)
				for (int k = 1; k <= n; k++)
					floyd[j][k] = floyd[j][k] || (floyd[j][i] && floyd[i][k]);
		for (int i = 1; i <= n; i++)
			for (int j = i + 1; j <= n; j++)
				if (floyd[i][j] == 1 && floyd[j][i] == 1)
					unionn(i, j);
		for (int i = 1; i <= n; i++)
		{
			int fa = find(i);
			show[fa].push(name[i]);
		}
		if (times>1)
			printf("\n");
		printf("Calling circles for data set %d:\n", times);
		times++;
		for (int i = 1; i <= n; i++)
		{
			while (!show[i].empty())
			{
				string s = show[i].front();
				show[i].pop();
				out(s);
				if (show[i].empty())
					printf("\n");
				else
					printf(", ");
			}
		}

		findd.clear();
	}
	
}

简单的0ms做法

#include<iostream>
#include<cstdio>
#include<map>
#include<vector>
#include<string>
#include<queue>
using namespace std;
string name[60];
map<string, int>findd;
int visit[60];
void get(string &a)
{
	a.resize(50);
	int k = 0;
	while (1)
	{
		a[k] = getchar();
		if (a[k] == '\n' || a[k] == ' ')
		{
			a[k] = '\0';
			break;
		}
		k++;
	}
}
void out(string a)
{
	int k = 0;
	printf("%s", a.c_str());
}
int amount;
int floyd[60][60];
int ufa[60];
int main()
{
	
	int n, m;
	int times = 1;
	while( (scanf("%d%d", &n, &m) && n&&m))
	{
		amount = 1;
		for (int i = 1; i <= n; i++)
		{
			visit[i] = 0;
			for (int j = 1; j <= n; j++)
				floyd[i][j] = 0;
		}
		getchar();
		for (int i = 0; i < m; i++)
		{
			string a, b;
			get(a), get(b);
			if (findd[a] == 0)
			{
				name[amount] = a;
				findd[a] = amount++;
			}
			if (findd[b] == 0)
			{
				name[amount] = b;
				findd[b] = amount++;
			}
			floyd[findd[a]][findd[b]] = 1;
		}
		for (int i = 1; i <= n; i++)
			for (int j = 1; j <= n; j++)
				for (int k = 1; k <= n; k++)
					floyd[j][k] = floyd[j][k] || (floyd[j][i] && floyd[i][k]);
		//if (times>1)
			//printf("\n");
		printf("Calling circles for data set %d:\n", times);
		times++;
		for (int i = 1; i <= n; i++)
		{
			if (visit[i])continue;
			visit[i] = 1;
			out(name[i]);
			for (int j = 1+i; j <= n; j++)
			{
				if (visit[j])continue;
				if (floyd[i][j] == 1 && floyd[j][i] == 1)
				{
					visit[j] = 1;
					printf(", ");
					out(name[j]);
				}
			}
			printf("\n");
		}

		findd.clear();
	}
	
}