coreBugZJ

此 blog 已棄。

POJ 1603 Risk

/*
2

POJ 1603 Risk
3

----問題描述：
6

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.
8

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.
10

The following connection diagram illustrates the first sample input.
12

----輸入：
15

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 <= N <= 100) indicating the number of country pairs that follow. The next N lines each contain exactly two integers (1 <= A,B <= 20; A!=B) indicating the starting and ending countries for a possible conquest.
17

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.
19

----輸出：
22

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. 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 the string " to " the destination country code B ; the string ": " and a single integer indicating the minimum number of moves required to traverse from country A to country B in the test set. Following all result lines of each input set, your program should print a single blank line.
24

----樣例輸入：
27

1 3
29

2 3 4
30

3 4 5 6
31

1 6
32

1 7
33

2 12 13
34

1 8
35

2 9 10
36

1 11
37

1 11
38

2 12 17
39

1 14
40

2 14 15
41

2 15 16
42

1 16
43

1 19
44

2 18 19
45

1 20
46

1 20
47

5
48

1 20
49

2 9
50

19 5
51

18 19
52

16 20
53

----樣例輸出：
56

Test Set #1
58

1 to 20: 7
59

2 to 9: 5
60

19 to 5: 6
61

18 to 19: 2
62

16 to 20: 2
63

----分析：
66

Floyd 算法。
68

*/
71

#include <stdio.h>
74

#include <string.h>
75

#define N 23
77

#define INF 0x3F3F3F3F
78

int main() {
80

int n, w[ N ][ N ], i, j, k, td = 0;
81

while ( 1 == scanf( "%d", &k ) ) {
82

memset( w, 0x3F, sizeof(w) );
83

for ( i = 0; i < k; ++i ) {
84

scanf( "%d", &j );
85

w[ 1 ][ j ] = w[ j ][ 1 ] = 1;
86

}
87

for ( i = 2; i <= 19; ++i ) {
88

scanf( "%d", &k );
89

while ( 0 < k-- ) {
90

scanf( "%d", &j );
91

w[ i ][ j ] = w[ j ][ i ] = 1;
92

}
93

}
94

for ( k = 1; k <= 20; ++k ) {
96

for ( i = 1; i <= 20; ++i ) {
97

for ( j = 1; j <= 20; ++j ) {
98

if ( (i != j) && (i != k) && (k != j) ) {
99

if ( w[ i ][ j ] > w[ i ][ k ] + w[ k ][ j ] ) {
100

w[ i ][ j ] = w[ i ][ k ] + w[ k ][ j ];
101

}
102

}
103

}
104

}
105

}
106

107

scanf( "%d", &n );
108

printf( "Test Set #%d\n", ++td );
109

while ( 0 < n-- ) {
110

scanf( "%d%d", &i, &j );
111

printf( "%d to %d: %d\n", i, j, w[ i ][ j ] );
112

}
113

printf( "\n" );
114

}
115

return 0;
116

}
117

posted on 2012-05-14 16:13 coreBugZJ 閱讀(638) 評論(0) 編輯收藏引用所屬分類: ACM 、Algorithm 、課內作業

只有注冊用戶登錄后才能發表評論。


相關文章: 微軟2014實習生及秋令營技術類職位在線測試 TopCoder SRM 593 DIV2 第三題生成全排列的非回溯方法（TopCoder SRM 591 DIV 2） A* 算法求解八數碼問題，POJ 1077 Eight POJ 1067 取石子游戲 POJ 2068 Nim POJ 2975 Nim POJ 3696 The Luckiest number POJ 3604 Professor Ben EOJ 1117 剩余定理

網站導航: 博客園 IT新聞 BlogJava 博問 Chat2DB 管理

青青草原综合久久大伊人导航_色综合久久天天综合_日日噜噜夜夜狠狠久久丁香五月_热久久这里只有精品

coreBugZJ

My Links

Blog Stats

常用鏈接

留言簿(10)

隨筆分類(458)

隨筆檔案(268)

相冊

ACM

AI

LaTeX

安全

編程語言

好有道理

技術

開源

科學

數學

圖形圖像

文化

問題（練習＆有趣）

資源

最新隨筆

搜索

最新評論

閱讀排行榜

評論排行榜

POJ 1603 Risk