POJ2139-Six Degrees of Cowvin Bacon

题目的意思是在同一电影中每头牛的距离都为1

用floyd就能简单的做出来。

#include <cstdio>
#include <algorithm>

using namespace std;

const int maxn = 300 + 10;
const int inf = 10000;

int d[maxn][maxn];
int tmp[maxn];

void floyd(int n) {
    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(int argc, char const *argv[]) {
    int n, m;
    scanf("%d%d", &n, &m);
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            d[i][j] = inf;
            if(i == j) {
                d[i][j] = 0;
            }
        }
    }
    for (int i = 0; i < m; i++) {
        int c;
        scanf("%d", &c);
        for (int j = 0; j < c; j++) {
            scanf("%d", &tmp[j]);
            tmp[j]--;
        }
        for (int j = 0; j < c - 1; j++) {
            for (int k = j + 1; k < c; k++) {
                d[tmp[j]][tmp[k]] = d[tmp[k]][tmp[j]] = 1;
            }
        }
    }

    floyd(n);

    int sum = inf;
    for (int i = 0; i < n; i++) {
        int s = 0;
        for (int j = 0; j < n; j++) {
            s += d[i][j];
        }
        sum = min(sum, s);
    }
    printf("%d\n", sum * 100 / (n-1));

    return 0;
}