Silver Cow Party 题解 最短路

题目链接: vjudge

题意

给定一个n个点，m条边的有向图，指定一点x，求每个牛从i到x再回来这一往返过程中最短路径的最大值。

输入

$n,m,x$

输出

最大值

输入样例

4 8 2
1 2 4
1 3 2
1 4 7
2 1 1
2 3 5
3 1 2
3 4 4
4 2 3

输出样例

10

解题思路

很明显的最短路算法，这个题的题眼就在于：往返
从x点回到i点很简单，就是以x为起点的迪杰斯特拉算法。
但是如果从i到x也使用普通的迪杰斯特拉算法，就会造成$O(n^3)$的时间复杂度，从而导致TL（别问我怎么知道的），这也是这道题的考察点。

但是如果此时我们将map矩阵（储存边）转置再进行一次迪杰斯特拉算法，就会得到从i到x的最短路径。这个思路可以想象成，倒着走路！！

AC题解

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
#define INF 0x3f3f3f3f
#define maxn 1010
int map[maxn][maxn], n;
int way[maxn], dis[maxn];

void dijkstra(int x)
{
    int visit[maxn], i, j, min, next = x;
    memset(visit, 0, sizeof(visit));
    for (i = 1; i <= n; ++i)
        dis[i] = map[x][i];
    visit[x] = 1;
    for (i = 2; i <= n; ++i)
    {
        min = INF;
        for (j = 1; j <= n; ++j)
        {
            if (!visit[j] && dis[j] < min)
            {
                min = dis[j];
                next = j;
            }
        }
        visit[next] = 1;
        for (j = 1; j <= n; ++j)
        {
            if (!visit[j] && dis[j] > dis[next] + map[next][j])
                dis[j] = dis[next] + map[next][j];
        }
    }
}

int main()
{
    int m, x, i, j, a, b, t;
    while (scanf("%d%d%d", &n, &m, &x) != EOF)
    {
        for (i = 1; i <= n; ++i)
        {
            for (j = 1; j <= n; ++j)
            {
                if (i != j)
                    map[i][j] = INF;
                else
                    map[i][j] = 0;
            }
        }
        while (m--)
        {
            scanf("%d%d%d", &a, &b, &t);
            if (t < map[a][b])
                map[a][b] = t;
        }

        dijkstra(x);
        for (i = 1; i <= n; ++i)
            way[i] = dis[i];
        int ans = 0;
        
        for (i = 1; i <= n; ++i) // 置换矩阵的值，也就是交换map[i][j]与map[j][i]的值
        {
            for (j = i + 1; j <= n; ++j)
            {
                int cnt;
                cnt = map[j][i];
                map[j][i] = map[i][j];
                map[i][j] = cnt;
            }
        }
        dijkstra(x);
        for (i = 1; i <= n; ++i)
        {
            if (i != x)
                ans = max(ans, way[i] + dis[i]);
        }
        printf("%d\n", ans);
    }
    return 0;
}

TL题解（不一定对哈）

#include <cstdio>
#include <vector>
#include <cstring>
#define INF 0x3f3f3f3f
using namespace std;
// n是点数量，m是边数量，x是终点
int n, m, x;
int map[1005][1005];

int buf[1005];
int dis[1005];

int dijkstraTox(int start)
{
    bool vis[1005];
    memset(vis, false, sizeof vis);
    vis[start] = true;
    for (int i = 1; i <= n; i++)
    {
        buf[i] = map[start][i];
    }

//    for (int i = 1; i <= n; i++)
//    {
//        printf("start:%d\n %d: dis:%d buf:%d\n",start,i, dis[i] , buf[i]);
//    }
//    printf("\n"); 
int k;
   
    for (int i = 1; i <= n; i++)
    {
        //!!!!!!!!!!!
        if (vis[x] == true)
            return buf[x];
        
        k = -1;
        for (int j = 1; j <= n; j++)
        {
            
            if (!vis[j] && (buf[j] < buf[k] || k == -1))
            {
                k = j;
            }
        }

        vis[k] = true;
        for (int j = 1; j <= n; j++)
        {
            if (!vis[j]  && buf[j] > buf[k] + map[k][j])
            {
                buf[j] = buf[k] + map[k][j];
            }
        }
    }
}
void dijkstra(int start)
{
    bool vis[1005];
    memset(vis, false, sizeof vis);
    vis[start] = true;
    for (int i = 1; i <= n; i++)
    {
        buf[i] = map[start][i];
    }
    int k;
    for (int i = 1; i <= n; i++)
    {

        k = -1;
        for (int j = 1; j <= n; j++)
        {
            
            if (!vis[j] && (buf[j] < buf[k] || k == -1))
            {
                k = j;
            }
        }

        vis[k] = true;
        for (int j = 1; j <= n; j++)
        {
            if (!vis[j]  && buf[j] > buf[k] + map[k][j])
            {
                buf[j] = buf[k] + map[k][j];
            }
        }
    }
}
int main()
{
    scanf("%d %d %d", &n, &m, &x);

    for (int i = 1; i <= n; i++)
    {
        map[i][i] = 0;
        for (int j = 1; j < i; j++)
        {
            map[i][j] = map[j][i] = INF;
        }
    }
    for (int i = 0; i < m; i++)
    {
        int a, b, c;
        scanf("%d %d %d", &a, &b, &c);
        if (c < map[a][b])
            map[a][b] = c;
    }

    dis[x] = 0;

    for (int i = 1; i <= n; i++)
    {
        if (i == x)
        {
            continue;
        }
        dis[i] = dijkstraTox(i);
    }
    dijkstra(x);

    int max = -1;
    for (int i = 1; i <= n; i++)
    {
        if (i == x)
            continue;
        if (dis[i] + buf[i] > max && dis[i] + buf[i] > 0)
        {
            max = dis[i] + buf[i];
        }
        // printf("%d: dis:%d buf:%d\n", i, dis[i] , buf[i]);
    }
    printf("%d", max);
    return 0;
}