zoukankan      html  css  js  c++  java
  • E-Dijkstal

    1005 输出用%f,1009别做了

    Problem E

    Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other)
    Total Submission(s) : 96   Accepted Submission(s) : 51
    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 S[sub]Mi[/sub] and L[sub]Mi[/sub], which means that the distance between the i-th town and the S[sub]Mi[/sub] town is L[sub]Mi[/sub].
     

    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
     
    #include<cstdio>
    #include<cstring>
    #include<cmath>
    #include<algorithm>
    #define INF 0x3f3f3f3f
    using namespace std;
    int map[11][11],dis[11];
    bool used[11];
    int sea[11];
    int n,k,minx;
    void init()
    {
        for(int i=0;i<n;i++)
        {
            for(int j=0;j<n;j++)
                {
                    if(i==j) map[i][j] = 0;
                         map[i][j] = INF;
                }
        } 
    }
    void dijkstral(int s)
    {
        memset(used,false,sizeof(used));
        for(int i=0;i<n;i++)
        {
            dis[i] = map[0][i];
        }
        
        dis[s] = 0;
        while(1)
        {
            int v = -1;
            for(int u=0;u<n;u++)
            {
                if(!used[u]&&(v==-1||dis[u]<dis[v]))    v = u;
            }
            if(v==-1)    break;
            used[v] = true;
            for(int u=0;u<n;u++)
            {
                dis[u] = min(dis[u],dis[v]+map[v][u]);
            }
        }
        int minm = INF;
    
        for (int i=0;i<k;i++)
        {
            minm = min(minm,dis[sea[i]]);
        }
        printf ("%d
    ",minm);
    }
    int main()
    {
        int s,l;
        int M,P; 
        int N;
        while(~scanf("%d",&N))
        {
        int cnt = 0; 
        int y = 0;
        n = N;    
        init();
        while(N--)
        {
    
            scanf("%d%d",&M,&P);
            if(P) 
            {
                sea[y++] = cnt;
            }
            for(int i=0;i<M;i++)
            {
                scanf("%d%d",&s,&l);
                map[cnt][s] = min(l,map[cnt][s]);
                map[s][cnt] = min(l,map[cnt][s]);
            }
            cnt++;
        }
        dijkstral(0);
    }
        return 0;
    }
  • 相关阅读:
    Dubbo支持的协议的详解
    db2 SQL6036N解决办法
    9-5 HTTP注解演示及注意事项讲解
    9-4 Feign之HTTP注解介绍
    9-3 Feign演示及Feign注解解析
    9-2 Feign环境准备
    9-1 Feign自我介绍
    8-30 Hystrix章节总结
    8-29 实战技巧:如何设置线程池
    8-28 Hystrix监控讲解与演示
  • 原文地址:https://www.cnblogs.com/valar/p/4750065.html
Copyright © 2011-2022 走看看