Six Degrees of Cowvin Bacon (最短路)

The cows have been making movies lately, so they are ready to play a variant of the famous game "Six Degrees of Kevin Bacon". 

The game works like this: each cow is considered to be zero degrees of separation (degrees) away from herself. If two distinct cows have been in a movie together, each is considered to be one 'degree' away from the other. If a two cows have never worked together but have both worked with a third cow, they are considered to be two 'degrees' away from each other (counted as: one degree to the cow they've worked with and one more to the other cow). This scales to the general case. 

The N (2 <= N <= 300) cows are interested in figuring out which cow has the smallest average degree of separation from all the other cows. excluding herself of course. The cows have made M (1 <= M <= 10000) movies and it is guaranteed that some relationship path exists between every pair of cows. 

Input

* Line 1: Two space-separated integers: N and M 

* Lines 2..M+1: Each input line contains a set of two or more space-separated integers that describes the cows appearing in a single movie. The first integer is the number of cows participating in the described movie, (e.g., Mi); the subsequent Mi integers tell which cows were. 

Output

* Line 1: A single integer that is 100 times the shortest mean degree of separation of any of the cows. 

Sample Input

4 2
3 1 2 3
2 3 4

Sample Output

100

Hint

[Cow 3 has worked with all the other cows and thus has degrees of separation: 1, 1, and 1 -- a mean of 1.00 .] 

思路

这道题用到了最短路的思想。每输入一行数据之后都对数据进行最短路的比较，然后在继续输入下一行。当输入完成之后，再对其最短路的数据进行计算，最后才输出结果。

#include <iostream>
#include <stdio.h>
#include <cstring>

using namespace std;
const int inf=0x3f3f3f3f;
int m,n;
int d[305][305];
int a[305];

void floyd()
{
    for(int k=1;k<n;k++)
        for(int i=1;i<=n;i++)
            for(int j=1;j<=n;j++)
                d[i][j]=min(d[i][j],d[i][k]+d[k][j]);
}

void init()//重置数组
{
    for(int i=0;i<305;i++)
    {
        for(int j=0;j<=350;j++)
        {
            if(i==j)
                d[i][j]=0;
            else
                d[i][j]=inf;
        }
    }
}
int main()
{
    while(scanf("%d %d",&n,&m)!=EOF)
    {
        memset(a,0,sizeof(a));
        init();
        while(m--)
        {
            int k;
            scanf("%d",&k);
            for(int i=0;i<k;i++)
            {
                scanf("%d",&a[i]);
            }
            for(int i=0;i<k;i++)
            {
                for(int j=i+1;j<k;j++)
                {
                    d[a[i]][a[j]]=d[a[j]][a[i]]=1;
                }
            }
        }
        floyd();
        int ans=inf;
        for(int i=1;i<=n;i++)
        {
            int sum=0;
            for(int j=1;j<=n;j++)
            {
                sum+=d[i][j];
            }
            ans=min(sum,ans);
           // cout<<"ans="<<ans<<endl;
        }
        ans=ans*100/(n-1);//一只牛和其他(n-1)只牛的平均距离
        printf("%d\n",ans);
    }
    return 0;
}