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

    Choose the best route

    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 <cstdlib>
    #include <iostream>
    #include <cstring>
    #include <string>
    #include <cmath>
    #include <algorithm>
    using namespace std;
    const int MAXN=99999999;
    
    int n,m,s,map[1010][1010],dis[1010],q;
    bool mark[1010];
    
    void Dijkstra(int x)
    {
        int i,j,k,Min;
        for(i=1;i<=n;i++)
        {
            mark[i]=false;
            dis[i]=map[x][i];
        }
        mark[x]=true;
        do
        {
            Min=MAXN;
            k=-1;
            for(i=1;i<=n;i++)
                if((mark[i]==false)&&(dis[i]<Min))
                {
                    Min=dis[i];
                    k=i;
                }
            if(k>-1)
            {
                mark[k]=true;
                for(i=1;i<=n;i++)
                    if(dis[i]>dis[k]+map[k][i]) dis[i]=dis[k]+map[k][i];
            }
        }while(k>-1);
    }
    
    int main()
    {
        while(scanf("%d%d%d",&n,&m,&s)!=EOF)
        {
            q=0;
            for(int i=0;i<=n;i++)
            {
                for(int j=0;j<=n;j++)
                    map[i][j]=MAXN;
            }
            int x,y,z;
            for(int i=1;i<=m;i++)
            {
                scanf("%d%d%d",&x,&y,&z);
                n=max(max(y,x),n);
                if(z<map[x][y]) map[x][y]=z;
            }
            scanf("%d",&m);
            for(int i=1;i<=m;i++)
            {
                scanf("%d",&x);
                map[0][x]=0;
            }
            Dijkstra(0);
            if(dis[s]==MAXN) printf("-1
    ");
            else printf("%d
    ",dis[s]);
        }
        return 0;
    }
  • 相关阅读:
    几行代码搞定图片模糊模式
    SVN源代码管理规范
    模仿苹果手机虚拟键的代码分享,有兴趣的可以玩玩。 下面的是链接,复制粘贴到浏览器就能下载
    keytool使用方法
    Unity导出APk出错解决方法二
    学习网址
    eclipse中手动设置library,选择编译工具方法
    apk接入google play邮箱登陆及充值注意事项
    unity导出apk错误出错解决方法
    java自动生成jar包工具
  • 原文地址:https://www.cnblogs.com/wanghaixv/p/8998775.html
Copyright © 2011-2022 走看看