zoukankan      html  css  js  c++  java
  • hdoj2680 Choose the best route

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)

    Total Submission(s): 10761    Accepted Submission(s): 3484


    Problem Description
    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.
     

    Input
    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.
     

    Output
    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”.
     

    Sample Input
    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
     

    Sample Output
    1 -1
    该题用到了最短路径万能源点,
    #include<queue>
    #include<stdio.h>  
    #include<string.h>
    #define INL 0x3f3f3f3f
    using namespace std;  
    int vid[10000],x[1080][1080],vist[10000];  
    int N,M,D;  
    void spfa()  
    {  
        for(int i=0;i<=N;i++)  
        {  
            vist[i]=INL;vid[i]=0;  
        }  
        queue<int> q;  
        vid[0]=1;  
        q.push(0);  
        vist[0]=0;
        while(!q.empty())  
        {  
            int u=q.front();  
                q.pop();  
               vid[u]=0;  
            for(int i=0;i<=N;i++)  
            {  
                if(vist[i]>vist[u]+x[u][i])  
                {  
                    vist[i]=vist[u]+x[u][i];  
                    if(!vid[i])  
                    {  
                        q.push(i);  
                        vid[i]=1;  
                    }  
                }  
            }  
        }  
    }  
    int main()  
    {  
        while(scanf("%d%d%d",&N,&M,&D)!=EOF)  
        {  
    	    memset(x,INL,sizeof(x));
            int a,b,c;
            for(int i=0;i<M;i++)
            {
            	 scanf("%d%d%d",&a,&b,&c);
            	 if(x[a][b]>c)
            	 x[a][b]=c;
            }
            int n,g,min;
            scanf("%d",&n);
    	        for(int i=0;i<n;i++)
    	        {
    	        	scanf("%d",&g);
    	        	x[0][g]=0;//万能源点知识
    	        }
            spfa();
            if(vist[D]==INL)
                 printf("-1
    ");
              else
                printf("%d
    ",vist[D]); 
        }  
        return 0;  
    }  





  • 相关阅读:
    发布spring cloud + vue项目
    以太坊上发行ERC20代币
    [转]大白话讲解Promise(一)
    比特币测试网络搭建
    非对称加密, 助记词, PIN, WIF
    搭建EOS未完
    [转]EOS智能合约 & 私链激活 & 基本操作
    [转]https://www.jianshu.com/p/06443248f4d8
    web3js 进行转账
    [转]How to Send Ethereum with Web3.js and Node
  • 原文地址:https://www.cnblogs.com/lytwajue/p/7151259.html
Copyright © 2011-2022 走看看