HDU 1217 Arbitrage(弗洛伊德算法)

　　　　　　　　　　   Arbitrage

　　　　　　　　　　　　Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)

　　　　　　　　　　　　　　　　　　 Total Submission(s): 3053    Accepted Submission(s): 1382

Problem Description

Arbitrage is the use of discrepancies in currency exchange rates to transform one unit of a currency into more than one unit of the same currency. For example, suppose that 1 US Dollar buys 0.5 British pound, 1 British pound buys 10.0 French francs, and 1 French franc buys 0.21 US dollar. Then, by converting currencies, a clever trader can start with 1 US dollar and buy 0.5 * 10.0 * 0.21 = 1.05 US dollars, making a profit of 5 percent.
Your job is to write a program that takes a list of currency exchange rates as input and then determines whether arbitrage is possible or not.

 

Input

The input file will contain one or more test cases. Om the first line of each test case there is an integer n (1<=n<=30), representing the number of different currencies. The next n lines each contain the name of one currency. Within a name no spaces will appear. The next line contains one integer m, representing the length of the table to follow. The last m lines each contain the name ci of a source currency, a real number rij which represents the exchange rate from ci to cj and a name cj of the destination currency. Exchanges which do not appear in the table are impossible. Test cases are separated from each other by a blank line. Input is terminated by a value of zero (0) for n.

 

Output

For each test case, print one line telling whether arbitrage is possible or not in the format "Case case: Yes" respectively "Case case: No".

 

Sample Input

3

USDollar

BritishPound

FrenchFranc

3

USDollar 0.5 BritishPound

BritishPound 10.0 FrenchFranc

FrenchFranc 0.21 USDollar

 

3

USDollar

BritishPound

FrenchFranc

6

USDollar 0.5 BritishPound

USDollar 4.9 FrenchFranc

BritishPound 10.0 FrenchFranc

BritishPound 1.99 USDollar

FrenchFranc 0.09 BritishPound

FrenchFranc 0.19 USDollar

 

0

 

Sample Output

Case 1: Yes

Case 2: No

 

题目链接1： http://acm.hdu.edu.cn/showproblem.php?pid=1217

题目链接2： http://poj.org/problem?id=2240

 

题目大意：给出N种货币，然后给出M种货币之间的兑换率，询问是否存在一种兑换方式使某种货币盈利。

 

题目分析：首先把N种货币映射到一个字符串数组中，然后利用disMap来保存它们之间的兑换率，

　　     然后利用弗洛伊德求出任意两种货币之间的最大兑换率，然后循环判断是否有disMap[i][i]>1.0,若有输出Yes。

 

 1 #include <stdio.h>
 2 #include <stdlib.h>
 3 #include <string.h>
 4 
 5 const int MAX_LEN = 50;
 6 
 7 double  disMap[MAX_LEN][MAX_LEN];        //记录各货币之间的兑率
 8 char    moneyName[MAX_LEN][MAX_LEN];     //记录各货币的名称
 9 int     totalMark = 0;                   //标识货币名称所在的下标
10 
11 void InitMoneyRate()
12 {
13     for(int i = 1; i <= MAX_LEN; i++)
14         for(int j = 1; j <= MAX_LEN; j++)
15         {
16             if(i == j)
17                 disMap[i][j] = 1.0;
18             else
19                 disMap[i][j] = 0.0;
20         }
21 }
22 
23 int FindMoneyName(char name[])      //查找name所在的下标位置
24 {
25     for(int i = 1; i <= totalMark; i++)
26     {
27         if(strcmp(moneyName[i], name) == 0)
28             return i;
29     }
30 
31     totalMark++;
32     strcpy(moneyName[totalMark], name);
33     return totalMark;
34 }
35 
36 void floyd(int N)                     //floyd算法求最短距离
37 {
38     for(int k = 1; k <= N; k++)
39         for(int i = 1; i <= N; i++)
40             for(int j = 1; j <= N; j++)
41                 if(disMap[i][j] < disMap[i][k] * disMap[k][j])
42                     disMap[i][j] = disMap[i][k] * disMap[k][j];
43 }
44 
45 int main()
46 {
47     int  N, M, cnt = 0;
48     char nameTemp[MAX_LEN];
49 
50     while(scanf("%d", &N) && N != 0)
51     {
52         cnt++;
53         getchar();
54         InitMoneyRate();
55 
56         for(int i = 0; i < N; i++)
57         {
58             scanf("%s", nameTemp);
59             FindMoneyName(nameTemp);
60         }
61 
62         double rate;
63         char strFirst[MAX_LEN];
64         char strSecond[MAX_LEN];
65         
66         scanf("%d", &M);
67         getchar();
68         while(M--)
69         {
70             scanf("%s %lf %s", strFirst, &rate, strSecond);
71             int sMark = FindMoneyName(strFirst);
72             int eMark = FindMoneyName(strSecond);
73             disMap[sMark][eMark] = rate;
74         }
75 
76         floyd(N);
77 
78         bool flag = false;
79         for(int i = 1; i <= N; i++)
80         {
81             if(disMap[i][i] > 1.0)
82             {
83                 flag = true;
84                 break;
85             }
86         }
87 
88         if(flag)
89             printf("Case %d: Yes\n", cnt);
90         else
91             printf("Case %d: No\n",  cnt);
92     }
93     return 0;
94 }

 

转载于:https://www.cnblogs.com/Dreamcaihao/archive/2013/05/24/3097793.html