zoukankan      html  css  js  c++  java
  • HDU-3665(单源最短路)

    Problem Description
    XiaoY is living in a big city, there are N towns in it and some towns near the sea. All these towns are numbered from 0 to N-1 and XiaoY lives in the town numbered ’0’. There are some directed roads connecting them. It is guaranteed that you can reach any town from the town numbered ’0’, but not all towns connect to each other by roads directly, and there is no ring in this city. One day, XiaoY want to go to the seaside, he asks you to help him find out the shortest way.
     
    Input
    There are several test cases. In each cases the first line contains an integer N (0<=N<=10), indicating the number of the towns. Then followed N blocks of data, in block-i there are two integers, Mi (0<=Mi<=N-1) and Pi, then Mi lines followed. Mi means there are Mi roads beginning with the i-th town. Pi indicates whether the i-th town is near to the sea, Pi=0 means No, Pi=1 means Yes. In next Mi lines, each line contains two integers SMi and LMi, which means that the distance between the i-th town and the SMi town is LMi.
     
    Output
    Each case takes one line, print the shortest length that XiaoY reach seaside.
     
    Sample Input
    5 1 0 1 1 2 0 2 3 3 1 1 1 4 100 0 1 0 1
     
    Sample Output
    2
    思路:
    在Dijkstra的基础上稍作修改即可,注意0x7fffffff可能会超范围

    #include <iostream>
    #include <cstdio>
    #include <cstring>
    #define INF 0x7ffffff
    using namespace std;
    
    int N;
    int G[17][17];
    int tmp;
    int sea[17];
    int a,b;
    int s[17];
    int d[17];
    int minn; 
    int v;
    int ans;
    int st[107];
    
    int min(int a,int b)
    {
        return a<b?a:b;
    }
    
    int main()
    {
        while(~scanf("%d",&N))
        {
            if(N == 0){
                printf("0
    ");
                continue;
            }
            ans = INF;
            memset(s,0,sizeof(s));
            for(int i = 0;i < N;i++)
                for(int j = 0;j < N;j++)
                    G[i][j] = i==j?0:INF; 
            for(int i = 0;i < N;i++) {
                scanf("%d%d",&tmp,&sea[i]);
                while(tmp--) {
                    scanf("%d%d",&a,&b);
                    G[i][a] = b;
                }
            }
            if(sea[0]){
                printf("0
    ");
                continue;
            }
            s[0] = 1;
            for(int i = 0;i < N;i++)
                d[i] = G[0][i];
            for(int i = 1;i < N;i++) 
            {
                minn = INF;
                for(int j = 0;j < N;j++) 
                    if(!s[j] && d[j]<minn) minn = d[v=j];
                s[v] = 1;
                if(sea[v]) ans = min(ans,minn);
                for(int j = 0;j < N;j++)
                    if(!s[j] && d[j]>G[v][j]+minn) d[j] = G[v][j]+minn;
            }
            printf("%d
    ",ans);
        }
        return 0;
    }
  • 相关阅读:
    ubuntu-虚拟机跟主机资源共享的实现方法
    git- 仓库创建、修改、提交、撤销
    theme- 工作原理
    makeMtk- user 版本编译
    Button- 自定义控件添加自定义属性
    actionMode
    screen-Orientation 横竖屏设置
    worktools-mmx 添加编译模块
    eclipse- MAT安装及使用
    worktools-monkey 测试工具的使用
  • 原文地址:https://www.cnblogs.com/immortal-worm/p/4936984.html
Copyright © 2011-2022 走看看