HDU-2066-一个人的旅行(最短路,dijkstra)

最新推荐文章于 2021-08-25 11:10:40 发布

lyc1635566ty

最新推荐文章于 2021-08-25 11:10:40 发布

阅读量216

点赞数

分类专栏： ===图论=== 文章标签： dijkstra

本文链接：https://blog.csdn.net/lyc1635566ty/article/details/74115165

版权

===图论=== 专栏收录该内容

6 篇文章 0 订阅

订阅专栏

题目连接

思路：裸的dijkstra

#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<time.h>
#include<set>
#include<stack>
#include<vector>
#include<map>

#define pi acos(-1)
#define maxn 111111
#define maxm 11111
#define INF 0x3F3F3F3F
#define eps 1e-8

#define pb push_back

#define mem(a) memset(a,0,sizeof a)

using namespace std;

const long long mod = 1000000007;
/**lyc**/
int mp[1111][1111];
bool vis[1111];
int cost[1111];
int e[1111];
int T, S, D;
int n;
void init(void) {
    memset(mp, INF, sizeof mp);
    memset(vis, 0, sizeof vis);
    memset(cost, INF, sizeof cost);

}
void Dijkstra() {
    vis[0] = 1;
    for (int i = 1; i <= n; i++) {
        cost[i] = mp[0][i];
    }
    int pos = 0;
    for (int i = 1; i <= n; i++) {
        int minx = INF;
        for (int j = 1; j <= n; j++) {
            if (cost[j] < minx && !vis[j]) {
                pos = j;
                minx = cost[j];
            }
        }
        if (pos == 0) break;
        vis[pos] = 1;
        for (int j = 1; j <= n; j++) {
            if (cost[pos] + mp[pos][j] < cost[j] && !vis[j]) {
                cost[j] = cost[pos] + mp[pos][j];
            }
        }
    }

}
int main() {
    //init();
    while (scanf("%d%d%d", &T, &S, &D) != EOF) {
        init();
        n = 0;
        int time, a, b;
        for (int i = 1; i <= T; i++) {
            scanf("%d%d%d", &a, &b, &time);
            n = max(a, max(b, n));
            if (time < mp[a][b]) {
                mp[a][b] = mp[b][a] = time;
            }
        }
        int x;
        for (int i = 1; i <= S; i++) {
            scanf("%d", &x);
            mp[0][x] = mp[x][0] = 0;
        }
        for (int i = 1; i <= D; i++) {
            scanf("%d", &e[i]);
        }
        Dijkstra();
        int minx = INF;
        for (int i = 1; i <= D; i++) {
            minx = min(minx, cost[e[i]]);
        }
        printf("%d\n", minx);
    }
    return 0;
}