7-13 首都选址 分数 10

• 解题思路：其实思路挺简单的，就是要算每个城市到其他各个城市的最短距离，然后将该城市到其他城市的最短距离加起来得到一个总距离，总距离最小的那个城市就是新首都。
• 如果所有城市无法形成一个连通块就输出0，意味着没有符合要求的新首都。
• （最难想到的一点是 每一组样例要自己判断是 无向图 还是 有向图 ，如果在输入中存在城市i 到 城市j 的距离，并且同时存在从 城市j 到城市i 的距离，那么这个样例就是有向图，反之则为无向图。(如果是无向图需要再给另一方向赋值使得 城市i到城市j的距离和城市j到城市i的距离相等。））
• 时间复杂度：该题样例几乎没卡，有了思路直接上算法都行。

以下是代码（直接用了Floyd ：O（n^3））

 #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
const int N = 110;
const int INF = 0x3f3f3f3f;
typedef pair<int, int> PII;
typedef long long LL;
int n;
int g[N][N];
int dx[] = {-1, 1, 0, 0};
int dy[] = {0, 0, -1, 1};
LL dist[N];
LL ans = 1e9;

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

void solve()
{
    ans = 1e9;
    int m;
    bool ise = false;
    memset(dist, 0, sizeof dist);
    scanf("%d %d", &n, &m);
    memset(g, 0x3f, sizeof g);
    int res = 0;
    for (int i = 1; i <= n; i++)
    {
        g[i][i] = 0;
    }
    for (int i = 1; i <= m; i++)
    {
        int a, b, c;
        scanf("%d %d %d", &a, &b, &c);
        g[a][b] = min(c, g[a][b]);
    }
    bool youxiang = false;
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= n; j++)
        {
            if ((i != j && g[i][j] != INF && g[j][i] != INF))
            {

                youxiang = true;
                break;
            }
        }
    }
    if (!youxiang)
    {
        for (int i = 1; i <= n; i++)
        {
            for (int j = 1; j <= n; j++)
            {
                if (i != j && g[i][j] != INF)
                {
                    g[j][i] = g[i][j];
                }
            }
        }
    }
    if (n == 1)
    {
        cout << 1 << endl;
        return;
    }
    floyd();
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= n; j++)
        {
            if (g[i][j] == INF)
            {
                dist[i] = INF;
                break;
            }
            dist[i] += (LL)g[i][j];
        }
        if (dist[i] < INF)
        {
            if (dist[i] < ans)
            {
                ise = true;
                ans = dist[i];
                res = i;
            }
        }
    }
    if (ise)
    {
        cout << res << endl;
    }
    else
    {
        cout << 0 << endl;
    }
}

int main()
{
    int t;
    cin >> t;
    while (t--)
    {
        solve();
    }

    return 0;
}

c语言

#include <stdio.h>
#include <string.h>
#include <math.h>
#define fi first
#define se second
#define N 1010
const int INF = 0x3f3f3f3f;
typedef long long LL;
int n;
int g[N][N];
int dx[] = {-1, 1, 0, 0};
int dy[] = {0, 0, -1, 1};
LL dist[N];
LL ans = 1e9;

int min(int a, int b)
{
    if (a > b)
    {
        return b;
    }
    return a;
}

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

void solve()
{
    ans = 1e9;
    int m;
    int ise = 0;
    memset(dist, 0, sizeof dist);
    memset(g, 0x3f, sizeof g);
    scanf("%d %d", &n, &m);
    int res = 0;
    for (int i = 1; i <= n; i++)
    {
        g[i][i] = 0;
    }
    for (int i = 1; i <= m; i++)
    {
        int a, b, c;
        scanf("%d %d %d", &a, &b, &c);
        g[a][b] = min(c, g[a][b]);
    }
    int youxiang = 0;
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= n; j++)
        {
            if ((i != j && g[i][j] != INF && g[j][i] != INF))
            {
                youxiang = 1;
                break;
            }
        }
    }
    if (!youxiang)
    {
        for (int i = 1; i <= n; i++)
        {
            for (int j = 1; j <= n; j++)
            {
                if (i != j && g[i][j] != INF)
                {
                    g[j][i] = g[i][j];
                }
            }
        }
    }
    if (n == 1)
    {
        printf("1\n");
        return;
    }
    floyd();
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= n; j++)
        {
            if (g[i][j] == INF)
            {
                dist[i] = INF;
                break;
            }
            dist[i] += (LL)g[i][j];
        }
        if (dist[i] < INF)
        {
            if (dist[i] < ans)
            {
                ise = 1;
                ans = dist[i];
                res = i;
            }
        }
    }
    if (ise)
    {
        printf("%d\n", res);
    }
    else
    {
        printf("0\n");
    }
}

int main()
{
    int t;
    scanf("%d", &t);
    while (t--)
    {
        solve();
    }

    return 0;
}