I - Arbitrage POJ - 2240（找正回路+反向bellman）

I - Arbitrage POJ - 2240

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种货币汇率及方式，问能否通过货币转换，使得财富增加。

思路：这里给的顶点时货币的英文名，为了方便简洁，用map 将货币名 与 编号一一对应。反向使用bellman_ford 判断是否存在正回路（存在正回路，财富增加）。

注： 用string类，必须#include ，引用cstring没用。使用map引用#include和#include

代码：

#include <iostream>
#include <algorithm>
#include <map>
#include <stdlib.h>
#include <queue>
#include <cstring>
#include <string>
#define inf 0x3f3f3f

using namespace std;

double a[32][32]; // j到k的汇率
double now[32]; // 每个节点的钱数
int n,m;

int bellman() // 反向使用bellman，找正回路
{
    int isp;
    int i,j,k;
    memset(now,0,sizeof(now)); // 全部设成0，方便往大了松弛
    now[1] = 1;
    for ( i=1; i<=n; i++ ) {
        isp = 0;
        for ( j=1; j<=n; j++ ) {
            for ( k=1; k<=n; k++ ) {
                double t = now[j]*a[j][k]; // 这个很巧妙
                if ( t>now[k] ) {  // 往大了松弛
                    now[k] = t;
                    isp = 1;
                }
            }
        }
        if ( isp==0 ) {
            return 0;
        }
    }

    isp = 0;
    for ( j=1; j<=n; j++ ) {
        for ( k=1; k<=n; k++ ) {
            double t = now[j]*a[j][k];
            if ( t>now[k] ) {
                now[k] = t;
                isp = 1;
            }
        }
    }
    return isp;
}

int main()
{
    int i,j,cnt = 1;
    string s1,s2;
    double x;
    map <string,int> M;  // 将字符串转抽象成数字
    while ( cin>>n && n!=0 ) {
        for ( i=1; i<=n; i++ ) {
            cin >> s1;
            M[s1] = i;
        }
        memset(a,0,sizeof(a));
        cin >> m;
        for ( i=1; i<=m; i++ ) {
            cin >> s1 >> x >> s2;
            a[M[s1]][M[s2]] = x;
        }

        int ans = bellman();
        cout << "Case " << cnt++ << ": ";
        if ( ans==1 ) {
            cout << "Yes" << endl;
        }
        else {
            cout << "No" << endl;
        }
    }

    return 0;
}