zoukankan      html  css  js  c++  java
  • Hdoj 2680

    原题链接

    描述

    One day , Kiki wants to visit one of her friends. As she is liable to carsickness , she wants to arrive at her friend’s home as soon as possible . Now give you a map of the city’s traffic route, and the stations which are near Kiki’s home so that she can take. You may suppose Kiki can change the bus at any station. Please find out the least time Kiki needs to spend. To make it easy, if the city have n bus stations ,the stations will been expressed as an integer 1,2,3…n.

    输入

    There are several test cases.
    Each case begins with three integers n, m and s,(n<1000,m<20000,1=<s<=n) n stands for the number of bus stations in this city and m stands for the number of directed ways between bus stations .(Maybe there are several ways between two bus stations .) s stands for the bus station that near Kiki’s friend’s home.
    Then follow m lines ,each line contains three integers p , q , t (0<t<=1000). means from station p to station q there is a way and it will costs t minutes .
    Then a line with an integer w(0<w<n), means the number of stations Kiki can take at the beginning. Then follows w integers stands for these stations.

    输出

    The output contains one line for each data set : the least time Kiki needs to spend ,if it’s impossible to find such a route ,just output “-1”.

    样例输入

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

    样例输出

    1
    -1

    思路

    dijkstra算法
    这里有个小技巧,可以把每个起始点和0连起来,构成新的图,这样只要从0开始用1次dijkstra算法就可以了

    代码

    #include <bits/stdc++.h>
    #define INF 99999999
    #define maxn 1002
    using namespace std;
    
    int dist[maxn][maxn];
    int f[maxn], length[maxn];
    int m, n, s;
    
    void init()  
    {
    	memset(f, 0, sizeof(f));
    	for(int i = 0; i < maxn; i++)
    		for(int j = 0; j < maxn; j++)
    			dist[i][j] = INF;
    }
    
    void dijkstra(int v)
    {
    	for(int i = 0; i <= n; i++)
    		length[i] = dist[v][i];
    	f[v] = 1;
    	while(1)
    	{
    		int min = INF, k = -1;
    		for(int i = 1; i <= n; i++)
    			if(!f[i] && min > length[i]) {min = length[i]; k = i;}
    		if(k == -1) break;
    		f[k] = 1;
    		for(int i = 1; i <= n; i++)
    			if(!f[i] && length[i] > min + dist[k][i])
    				length[i] = min + dist[k][i];
    	}
    }
    
    int main()
    {
    	while(~scanf("%d%d%d", &n, &m, &s))
    	{
    		init();
        	for(int i = 0; i < m; i++)
        	{
        		int x, y, d;
        		scanf("%d%d%d", &x, &y, &d);
        		if(dist[x][y] > d) dist[x][y] = d;
    		}
    		int p; scanf("%d", &p);
    		while(p--)
    		{
    			int i; scanf("%d", &i);
    			dist[0][i] = 0;
    		}
    		dijkstra(0);
    		if(length[s] < INF) printf("%d
    ", length[s]);
    		else printf("-1
    ");
    	}
    	return 0;  
    }
    
  • 相关阅读:
    python-opencv-绘图函数
    sublime下package control安装无效解决
    关于vue.js中slot的理解
    关于vue.js父子组件数据传递
    oAuth2.0及jwt介绍
    nodejs文件上传组件multer使用
    nodejs设置服务端允许跨域
    添加swagger api文档到node服务
    关于for循环里面异步操作的问题
    nodejs记录2——一行代码实现文件下载
  • 原文地址:https://www.cnblogs.com/HackHarry/p/8436685.html
Copyright © 2011-2022 走看看