joj1016

• Authors
• Contests
•  
• Problems
•  
• Status
•  
• Links

[新版judge已支持special judge；增加了提交后的状态页面；增加对提交代码的语言检查] [新版judge系统近日试运行，希望可以解决内存越界导致Waiting的问题]  [more]

Welcome,  �γɺ�
[JPoints:  935, Sender!:  0/1]

 1016: Degrees of separation

Result	TIME Limit	MEMORY Limit	Run Times	AC Times	JUDGE
	3s	8192K	1178	494	Standard

Find out how many people separate one person from another.
The number of people will be no more than 20.

Input

A positive integer representing the number of people in the following list. Each line in the list contains the name of a person, followed by the number of people that person knows, followed by the names of those people. Following this list is a positive integer denoting the number of cases. Each case consists of a starting name and a goal name. Names will not contain any blanks or non-alphabetic characters.

Output

The phrase “<start> has no connection to <goal>.” or the phrase “<start> is separated from <goal> by <num> degrees.”, where <start> is the starting name, <goal> is the goal name, and <num> is the number of degrees of separation between the two.

Sample Input

5
Bob 3 Tom John Jim
Sam 2 Bob John
John 2 Tom Bob
Tom 1 Sam
Jim 0
3
Jim Sam
Sam John
John Sam

Sample Output

Jim has no connection to Sam.
Sam is separated from John by 0 degrees.
John is separated from Sam by 1 degrees.

Submit / Problem List / Status / Discuss

Problem Set with Online Judge System Version 3.12
Jilin University

Developed by skywind, SIYEE

这个题注意是单方向的a可以到b但是b不一定可以到a。。

#include<cstdio>
#include<string.h>
using namespace std;
char name[22][20];
int map[22][22];
void floyd(int n)
{
for(int k=1;k<=n;k++)
{
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
if(map[i][j]>map[i][k]+map[k][j])
map[i][j]=map[i][k]+map[k][j];
}
}
}
}
int main()
{
freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
int n;
scanf("%d",&n);
getchar();
int person=0;
char temp[20];
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
{
if(i==j)map[i][j]=0;
else map[i][j]=10000;
}
for(int i=1;i<=n;i++)
{
int u,v;
scanf("%s",temp);
bool tep=false;
for(int i=1;i<=person;i++)
{
if(!strcmp(temp,name[i]))
{
tep=true;u=i;break;
}
}
if(!tep)
{
strcpy(name[++person],temp);
u=person;
}
int m;
scanf("%d",&m);
getchar();
for(int i=1;i<=m;i++)
{
scanf("%s",temp);
tep=false;
for(int j=1;j<=person;j++)
{
if(!strcmp(temp,name[j]))
{
tep=true;v=j;break;
}
}
if(!tep)
{
strcpy(name[++person],temp);
v=person;
}
map[u][v]=1;
//map[v][u]=1;
}


}
//for(int i=1;i<=n;i++)puts(name[i]);
floyd(n);
/*for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)printf("%d ",map[i][j]);
printf("\n");
}*/
int m;
scanf("%d",&m);
getchar();
for(int i=1;i<=m;i++)
{
int u,v;
char temp1[22];
scanf("%s%s",temp,temp1);
for(int i=1;i<=person;i++)
{
if(!strcmp(temp,name[i]))
u=i;
if(!strcmp(temp1,name[i]))
v=i;
}
if(map[u][v]>20)
printf("%s has no connection to %s.\n",temp,temp1);
else
printf("%s is separated from %s by %d degrees.\n",
 temp,temp1,map[u][v]-1);
/*for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)printf("%d ",map[i][j]);
printf("\n");
}*/
}
return 0;
}