Arbitrage POJ - 2240 最短路Bellman判断正环

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

题意：已知n种货币，以及m种货币汇率，问通过货币转换，能否使财富增加。输入第一行为n种货币，往下n行为货币名称
然后一个数字为m种货币汇率，往下m行为a，汇率，b。a到b的转换。但输入n为0 时结束测试。输出是否能通过货币转换使财富增加

思路：财富增加的话肯定是以同种货币作比较，否则没有意义，因此题意大致可以变成在一个n个顶点的图中能否找到一个正权环，这里的正权环指财富增加，很明显可用Bellman
这里给的顶点时货币的英文名，为了方便简洁，用map 将货币名 与 编号一一对应。

代码：

  1 #include <cstdio>
  2 #include <fstream>
  3 #include <algorithm>
  4 #include <cmath>
  5 #include <deque>
  6 #include <vector>
  7 #include <queue>
  8 #include <string>
  9 #include <cstring>
 10 #include <map>
 11 #include <stack>
 12 #include <set>
 13 #include <sstream>
 14 #include <iostream>
 15 #define mod 998244353
 16 #define eps 1e-6
 17 #define ll long long
 18 #define INF 0x3f3f3f3f
 19 using namespace std;
 20 
 21 //用于存放货币的转换
 22 struct node
 23 {
 24     //x源来的钱的种类，b转换后钱的种类
 25     int x,y;
 26     //s表示汇率
 27     double s;
 28 };
 29 //ve表示有多少个汇率
 30 vector<node> ve;
 31 //mp用于给货币种类编号
 32 map<string,int> mp;
 33 //dis表示起点转换成其他点后的钱数
 34 double dis[35];
 35 //bellman用于判断是否有正环
 36 //n表示有了n个点，v表示起点
 37 bool bellman(int n,int v)
 38 {
 39     //初始钱数为0；
 40     for(int i=1;i<=n;i++)
 41     {
 42         dis[i]=0;
 43     }
 44     //将起点的钱数设为1，为方便计算
 45     dis[v]=1;
 46     //n-1次遍历
 47     for(int i=1;i<n;i++)
 48     {
 49         //对每个汇率进行遍历
 50         for(int j=0;j<ve.size();j++)
 51         {
 52             int a=ve[j].x;
 53             int b=ve[j].y;
 54             //更新b之间的钱数
 55             if(dis[b]<dis[a]*ve[j].s)
 56             {
 57                 dis[b]=dis[a]*ve[j].s;
 58             }
 59         }
 60     }
 61     //在进行一次遍历，判断是否有正环
 62     for(int j=0;j<ve.size();j++)
 63     {
 64         int a=ve[j].x;
 65         int b=ve[j].y;
 66         //如果钱还能增加，则有正环
 67         if(dis[b]<dis[a]*ve[j].s)
 68         {
 69             return true;
 70         }
 71     }
 72     return false;
 73 }
 74 int main()
 75 {
 76     int n,ans=1;
 77     while(scanf("%d",&n)&&n!=0)
 78     {
 79         string str;
 80         for(int i=1;i<=n;i++)
 81         {
 82             cin>>str;
 83             //对钱的种类进行标记
 84             mp[str]=i;
 85         }
 86         int m;
 87         scanf("%d",&m);
 88         string a,b;
 89         node no;
 90         for(int i=0;i<m;i++)
 91         {
 92             cin>>a>>no.s>>b;
 93             no.x=mp[a];
 94             no.y=mp[b];
 95             //记录汇率
 96             ve.push_back(no);
 97         }
 98         printf("Case %d: ",ans++);
 99         //枚举所有的起点
100         for(int i=1;i<=n;i++)
101         {
102             //判断有正环
103             if(bellman(n,i))
104             {
105                 printf("Yes\n");
106                 break;
107             }//如果到最后一个起点后海没有正环，则表示财富无法增加
108             else if(i==n)
109             {
110                 printf("No\n");
111             }
112         }
113         //清除STL容器的内存
114         ve.clear();
115         mp.clear();
116     }
117 }