[POJ](2139)Six Degrees of Cowvin Bacon ---- 最短路径算法（Floyd）

Description

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 .]

解题:
Floyd算法，最短路径模板题

AC代码：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int d[305][305];
int mmap[305];
int n,m;
void floyd()//warshall-floyd 最短路径算法（每对顶点之间的最短路径）
{
    for(int k=0;k<n;k++)
        for(int i=0;i<n;i++)
            for(int j=0;j<n;j++)
                d[i][j] = min(d[i][j],d[i][k]+d[k][j]);
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL),cout.tie(NULL);
    cin>>n>>m;
    memset(d,0x3f,sizeof(d));
    for(int i=0;i<n;i++)
        d[i][i] = 0;
    while(m--)
    {
        int t;
        cin>>t;
        for(int i=0;i<t;i++)
        {
            cin>>mmap[i];
            mmap[i]--;
        }
        for(int i=0;i<t;i++)
        {
            for(int j=i+1;j<t;j++)
                d[mmap[i]][mmap[j]] = d[mmap[j]][mmap[i]] = 1;
        }
    }
    floyd();
    int ans = 0x3f3f3f3f;
    for(int i=0;i<n;i++)
    {
        int sum = 0;
        for(int j=0;j<n;j++)
            sum+=d[i][j];
        ans = min(ans,sum);
    }
    cout<<100*ans/(n-1)<<endl;
    return 0;
}