LIGHTOJ 1002 – COUNTRY ROADS 【求最大边最小的路径】

最新推荐文章于 2018-11-14 11:30:39 发布

mfcheer

最新推荐文章于 2018-11-14 11:30:39 发布

阅读量432

点赞数

分类专栏： ----------最短路

本文链接：https://blog.csdn.net/u014427196/article/details/46383209

版权

----------最短路专栏收录该内容

31 篇文章 0 订阅

订阅专栏

题目链接：http://www.lightoj.com/volume_showproblem.php?problem=1002

dij简单变形；

代码：

#include<stdio.h>     
#include<iostream>     
#include<math.h>     
#include<stdlib.h>     
#include<ctype.h>     
#include<algorithm>     
#include<vector>     
#include<string.h>     
#include<stack>     
#include<set>        
#include<sstream>     
#include<time.h>     
#include<utility>     
#include<malloc.h>     
#include<stdexcept>     
#include<iomanip>     
#include<iterator>     

using namespace std;

int t, cases = 1;
int n, m, f;

const int MAXN = 510;
const int INF = 10000000;
int map[MAXN][MAXN];
int a, b, c;
bool vis[MAXN];
int lowcost[MAXN];

void dijkstra(int cost[][MAXN], int lowcost[], int n, int beg)
{
    for (int i = 0; i < n; i++)
    {
        vis[i] = false;
        lowcost[i] = cost[beg][i];
    }
    lowcost[beg] = 0;
    vis[beg] = true;
    for (int j = 0; j < n; j++)
    {
        int k = -1;
        int MIN = INF;
        for (int i = 0; i < n; i++)
            if (!vis[i] && lowcost[i] < MIN)
            {
                MIN = lowcost[i];
                k = i;
            }
        if (k == -1) break;
        vis[k] = true;

        for (int i = 0; i < n; i++)
        {
            if (!vis[i] && max(lowcost[k] , cost[k][i]) < lowcost[i])
            {
                lowcost[i] = max(lowcost[k], cost[k][i]);

            }
        }
    }
}

int main()
{
    scanf("%d",&t);
    while (t--)
    {
        scanf("%d%d",&n,&m);
        for (int i = 0; i <= n; i++)
            for (int j = 0; j <= n; j++)
            {
                if (i == j)
                    map[i][i] = 0;
                else
                    map[i][j] = map[j][i] = INF;
            }
        for (int i = 1; i <= m; i++)
        {
            scanf("%d%d%d", &a, &b, &c);
            if (map[a][b] > c)
            map[a][b] = map[b][a] = c;
        }
        scanf("%d",&f);
        dijkstra(map, lowcost, n, f);
        /*for (int k = 0; k < n; k++)
            for (int i = 0; i < n; i++)
                for (int j = 0; j < n; j++)
                {
                    if (max(map[i][k], map[k][j]) < map[i][j])
                        map[i][j] = max(map[i][k], map[k][j]);
                }
        */
        printf("Case %d:\n",cases++);
        for (int i = 0; i < n; i++)
        {
            if (lowcost[i] != INF)
                printf("%d\n", lowcost[i]);
            else
                puts("Impossible");
        }
    }
    return 0;
}