1125. 牛的旅行（flord）

1125. 牛的旅行（flord）

#include <bits/stdc++.h>
#define inf 0x3f3f3f3f
using namespace std;
typedef long long LL;
const int N = 1e3 + 10;
#define x first
#define y second
#define inf 1e9
pair<double, double> s[N];
double ma[N][N], d[N], ans1 = 0, ans2 = inf;
int n;
char a;
double solve(int u, int v) {
    return (double)sqrt((s[u].x - s[v].x) * (s[u].x - s[v].x) +
                        (s[u].y - s[v].y) * (s[u].y - s[v].y));
}
void flord() {
    for (int k = 1; k <= n; k++) {
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= n; j++) {
                if (ma[i][k] != inf && ma[k][j] != inf &&
                    ma[i][j] > ma[i][k] + ma[k][j])
                    ma[i][j] = ma[i][k] + ma[k][j];
            }
        }
    }
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            if (ma[i][j] != inf) {
                if (d[i] < ma[i][j]) d[i] = ma[i][j];
            }
        }
        if (ans1 < d[i]) ans1 = d[i];
    }
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            if (ma[i][j] == inf) {
                if (ans2 > d[i] + d[j] + solve(i, j))
                    ans2 = d[i] + d[j] + solve(i, j);
            }
        }
    }
    if (ans1 > ans2)
        printf("%lf\n", ans1);
    else
        printf("%lf\n", ans2);
}
int main() {
    scanf("%d", &n);
    for (int i = 1; i <= n; i++) {
        scanf("%lf%lf", &s[i].x, &s[i].y);
        for (int j = 1; j <= n; j++) ma[i][j] = inf;
        ma[i][i] = 0;
    }
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            cin>>a;
            if (a == '1') {
                ma[i][j] = solve(i, j);
            }
        }
    }
    flord();
    return 0;
}