zoukankan      html  css  js  c++  java
  • HDU 2680 Choose the best route(最短路)

    Choose the best route
    Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u

    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<cstdio>
    #include<cstring>
    #include<cmath>
    #include<iostream>
    #include<algorithm>
    #define INF 1000000000
    using namespace std;
    int w[1000+10][1000+10];
    int d[1000+10];
    int v[1000+10];
    int n,t,ans;
    void dij()
    {
        memset(v,0,sizeof(v));
        for(int i=0;i<=n;i++) {d[i]=(i==0?0:INF);}
        for(int i=0;i<=n;i++)
        {
            int x,m=INF;
            for(int y=0;y<=n;y++) if(!v[y]&&d[y]<=m) m=d[x=y];
            v[x]=1;
            for(int y=0;y<=n;y++)
            {
                if(d[y]>d[x]+w[x][y])
                {
                    d[y]=d[x]+w[x][y];
                }
            }
        }
    }
    int main()
    {
        int i,j,m;
        int f,to,time;
        while(scanf("%d%d%d",&n,&m,&t)!=EOF)
        {
            for(i=0;i<=n;i++)
            {
                for(j=0;j<=n;j++)
                {
                    w[i][j]=INF;
                }
            }
            while(m--)
            {
                scanf("%d%d%d",&f,&to,&time);
                if(time<w[f][to]) w[f][to]=time;
            }
            int coun;
            scanf("%d",&coun);
            while(coun--)
            {
                int temp;
                scanf("%d",&temp);
                w[0][temp]=0;
            }
            dij();
            if(d[t]<INF) printf("%d
    ",d[t]);
            else printf("-1
    ");
        }
        return 0;
    }
    

      

  • 相关阅读:
    MySQL的事务和视图
    MySQL中的常用函数
    高级查询(一)
    街道管理系统
    深入.NET平台和C#编程的错题
    appium python下的API方法
    Charles 使用教程
    appium,iOS下,ios_predicate等定位方式
    Linux -常用命令
    python-列表以及相关函数认识
  • 原文地址:https://www.cnblogs.com/sola1994/p/4074301.html
Copyright © 2011-2022 走看看