floyed多源最短路--Uva567

原创 2013年12月02日 20:27:03


  Risk 

Risk is a board game in which several opposing players attempt to conquer the world. The gameboard consists of a world map broken up into hypothetical countries. During a player's turn, armies stationed in one country are only allowed to attack only countries with which they share a common border. Upon conquest of that country, the armies may move into the newly conquered country.


During the course of play, a player often engages in a sequence of conquests with the goal of transferring a large mass of armies from some starting country to a destination country. Typically, one chooses the intervening countries so as to minimize the total number of countries that need to be conquered. Given a description of the gameboard with 20 countries each with between 1 and 19 connections to other countries, your task is to write a function that takes a starting country and a destination country and computes the minimum number of countries that must be conquered to reach the destination. You do not need to output the sequence of countries, just the number of countries to be conquered including the destination. For example, if starting and destination countries are neighbors, then your program should return one.


The following connection diagram illustrates the first sample input.

Input 

Input to your program will consist of a series of country configuration test sets. Each test set will consist of a board description on lines 1 through 19. The representation avoids listing every national boundary twice by only listing the fact that country I borders country J when I < J. Thus, the Ith line, where I is less than 20, contains an integer X indicating how many ``higher-numbered" countries share borders with country I, then X distinct integers J greater than I and not exceeding 20, each describing a boundary between countries I and J. Line 20 of the test set contains a single integer ( $1 \le N \le 100$) indicating the number of country pairs that follow. The next N lines each contain exactly two integers ($1 \le A,B \le 20; A \ne B$) indicating the starting and ending countries for a possible conquest.


There can be multiple test sets in the input file; your program should continue reading and processing until reaching the end of file. There will be at least one path between any two given countries in every country configuration.

Output 

For each input set, your program should print the following message ``Test Set #T" where T is the number of the test set starting with 1 (left-justified starting in column 11).

The next NT lines each will contain the result for the corresponding test in the test set - that is, the minimum number of countries to conquer. The test result line should contain the start country code A right-justified in columns 1 and 2; the string `` to " in columns 3 to 6; the destination country code B right-justified in columns 7 and 8; the string ``: " in columns 9 and 10; and a single integer indicating the minimum number of moves required to traverse from country A to country B in the test set left-justified starting in column 11. Following all result lines of each input set, your program should print a single blank line.

Sample Input 

1 3
2 3 4
3 4 5 6
1 6
1 7
2 12 13
1 8
2 9 10
1 11
1 11
2 12 17
1 14
2 14 15
2 15 16
1 16
1 19
2 18 19
1 20
1 20
5
1 20
2 9
19 5
18 19
16 20
4 2 3 5 6
1 4
3 4 10 5
5 10 11 12 19 18
2 6 7
2 7 8
2 9 10
1 9
1 10
2 11 14
3 12 13 14
3 18 17 13
4 14 15 16 17
0
0
0
2 18 20
1 19
1 20
6
1 20
8 20
15 16
11 4
7 13
2 16

Sample Output   

Test Set #1
 1 to 20: 7
 2 to  9: 5
19 to  5: 6
18 to 19: 2
16 to 20: 2

Test Set #2
 1 to 20: 4
 8 to 20: 5
15 to 16: 2
11 to  4: 1
 7 to 13: 3
 2 to 16: 4

思路:floyed求多元最短路即可,主要是注意输出格式。
下面是代码:
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int INF=10000;
int grid[50][50];
void floyed()
{
    for(int k=1;k<=20;k++)
    {
        for(int i=1;i<=20;i++)
        {
            for(int j=1;j<=20;j++)
            if(i!=j)
            grid[i][j]=min(grid[i][j],grid[i][k]+grid[k][j]);
        }
    }
}
int main()
{
    //freopen("in.txt","r",stdin);
    int x,y;
    int loop=1;
    while(cin>>x)
    {
        for(int i=1;i<=20;i++)
        fill(grid[i],grid[i]+21,INF);
        for(int i=1;i<=x;i++)
        {
            scanf("%d",&y);
            grid[1][y]=grid[y][1]=1;
        }
        for(int i=2;i<=19;i++)
        {
            scanf("%d",&x);
            for(int j=1;j<=x;j++)
            {
                scanf("%d",&y);
                grid[i][y]=grid[y][i]=1;
            }
        }
        floyed();
        int enq;
        scanf("%d",&enq);
        cout<<"Test Set #"<<loop++<<endl;
        for(int i=1;i<=enq;i++)
        {
            scanf("%d%d",&x,&y);
            printf("%2d to %2d: %d\n",x,y,grid[x][y]);
        }
        cout<<endl;
    }
    return 0;
}


版权声明:本文为博主原创文章,未经博主允许不得转载。 举报

相关文章推荐

多源最短路径+源码<floyed>

the reason of failure:1、第一次的时候,给输入input的i 2、第二次是由于输入的少一个%d。 how to solve:修改  question:  where is...

uva567(最短路 + floyd)

#include #include const int M = 25; int g[M][M]; int INF = 1000; int main () { int flag; int a,b; ...

精选:深入理解 Docker 内部原理及网络配置

网络绝对是任何系统的核心,对于容器而言也是如此。Docker 作为目前最火的轻量级容器技术,有很多令人称道的功能,如 Docker 的镜像管理。然而,Docker的网络一直以来都比较薄弱,所以我们有必要深入了解Docker的网络知识,以满足更高的网络需求。

CodeForces 25C(Floyed 最短路)

CodeForces 25C(Floyed 最短路)

弗洛伊德算法Floyed(求各顶点间最短路径):可打印最短路径

#include #include #include using namespace std; #define INFINITY 65535 #define MAX_V...

hdu1690 Bus System floyed最短路

hdu1690 Bus System     floyd中3个循环的顺序弄反了 wa了一天 = =   正确顺序应该是先 中间节点 k ,然后才是 i , j。       #inc...

Floyed-Warshall-求最短路

Floyed-Warshall算法是通过枚举每一个点,看能否通过此点来松弛边,即假设a点到b点最初为5,又已知a->c为2,c->b为1,那么此时就可以通过点c来松弛a->b的距离,松弛为3. 采用...
  • yo_bc
  • yo_bc
  • 2017-03-06 22:35
  • 307

hdu 4034 Graph 最短路Floyed

反向最短路

最短路之 dijkstra & floyed &SPFA

最短路径问题:        寻找图中两个结点之间的最短路径。 求最短路算法: a:dijkstra算法       解决指定起点和终点的最短路径,是以最短路径长度递增,逐次生成最短路径的算...

POJ 2253 Frogger

//Time 63ms, Memory 572K#include #include #include using namespace std; class coordinate ...

最短路floyd与dijkstra浅析

为了备战noip,又将图论的基础知识拿出来练了练。 因为本文主要对象为初级选手,已简单易懂为宗旨,高级大犇不要喷。。靴靴。。。 首先,floyd算法:此算法是最短路最朴素的办法,用记忆...
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)