zoukankan      html  css  js  c++  java
  • POJ-1847 Tram

    Tram

    Time Limit: 1000MS   Memory Limit: 30000K

    Description

    Tram network in Zagreb consists of a number of intersections and rails connecting some of them. In every intersection there is a switch pointing to the one of the rails going out of the intersection. When the tram enters the intersection it can leave only in the direction the switch is pointing. If the driver wants to go some other way, he/she has to manually change the switch. 

    When a driver has do drive from intersection A to the intersection B he/she tries to choose the route that will minimize the number of times he/she will have to change the switches manually. 

    Write a program that will calculate the minimal number of switch changes necessary to travel from intersection A to intersection B.

    Input

    The first line of the input contains integers N, A and B, separated by a single blank character, 2 <= N <= 100, 1 <= A, B <= N, N is the number of intersections in the network, and intersections are numbered from 1 to N. 

    Each of the following N lines contain a sequence of integers separated by a single blank character. First number in the i-th line, Ki (0 <= Ki <= N-1), represents the number of rails going out of the i-th intersection. Next Ki numbers represents the intersections directly connected to the i-th intersection.Switch in the i-th intersection is initially pointing in the direction of the first intersection listed.

    Output

    The first and only line of the output should contain the target minimal number. If there is no route from A to B the line should contain the integer "-1".

    Sample Input

    3 2 1
    2 2 3
    2 3 1
    2 1 2
    

    Sample Output

    0

    题解
    很简单的最短路问题,套版就行,建好图就行了,这里用未优化的Dijkstra就行了
    代码
    #include<iostream>
    #include<stdio.h>
    #include<string.h>
    #include<algorithm>
    using namespace std;
    
    const int maxn = 100+7;
    const int inf=0x3f3f3f3f;
    
    //*****************************************
    //Dijkstra-数组实现O(n^2)
    //单源最短路
    //lowcost[]-----从点beg到其他点的距离
    //*****************************************
    bool vis[maxn];
    void Dijkstra(int cost[][maxn],int lowcost[maxn],int n,int beg)
    {
        int minc;
        int i,j,w;
        memset(vis,false,sizeof(vis));
        vis[beg]=true;
        for(i=1;i<=n;i++) lowcost[i]=cost[beg][i];
        lowcost[beg]=0;
        for(i=1;i<=n;i++){
            minc=inf;
            for(j=1;j<=n;j++){
                if(!vis[j]&&lowcost[j]<minc){
                    minc=lowcost[j];
                    w=j;
                }
            }
            if(minc>=inf) break;
            vis[w]=true;
            for(j=1;j<=n;j++)
                if(!vis[j]&&lowcost[w]+cost[w][j]<lowcost[j])
                lowcost[j]=lowcost[w]+cost[w][j];
        }
    }
    
    int cost[maxn][maxn];
    int dist[maxn];
    int main()
    {
        int n,A,B;
        int k,t;
        while(scanf("%d%d%d",&n,&A,&B)!=EOF){
            for(int i=1;i<=n;i++){
                for(int j=1;j<=n;j++){
                    if(i==j) cost[i][j]=0;
                    else cost[i][j]=inf;
                }
            }
            for(int i=1;i<=n;i++){
                scanf("%d",&k);
                for(int j=0;j<k;j++){
                    scanf("%d",&t);
                    if(j==0) cost[i][t]=0;
                    else cost[i][t]=1;
                }
            }
            Dijkstra(cost,dist,n,A);
            if(dist[B]>=inf) printf("-1
    ");
            else printf("%d
    ",dist[B]);
        }
        return 0;
    }
     
  • 相关阅读:
    [OpenStack] openstack keystone api 实验(curl)(转载)(亲自动手实验,附带实验运行结果)
    [Hadoop in China 2011] 中兴:NoSQL应用现状及电信业务实践
    [转]Windows Server 2012 和 System Center 2012 SP1,Virtual Machine Manager 中启用的软件定义的网络
    [Hadoop in China 2011] Facebook Message在HBase基础上的应用
    [转] ETL工具介绍
    [Hadoop in China 2011] eBay:选择HBase建立搜索引擎的原因
    [Cloudera Hadoop] CDH 4.0 Quick Start Guide (动手实践,最新版CDH4.0,企业版Hadoop)
    云操作系统OpenStack 优势与问题并存
    [OpenStack Crowbar] Build Crowbar.ISO
    [OpenStack] OpenStack ESSEX 全新手动安装,动手,实践,出真知!
  • 原文地址:https://www.cnblogs.com/wangdongkai/p/5579237.html
Copyright © 2011-2022 走看看