poj 2240 Arbitrage (最短路径)

Arbitrage

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 13800		Accepted: 5815

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

Source

Ulm Local 1996

//766 MS    772 KB    GNU C++
/*

    题意：
        给出一个图，n个点，m条边，每条边有一个权值，求是否存在一条回路，使边的权值积大于1
        
    最短路径：
        floyd小变异。数据比较小，直接用floyd遍历一遍，然后判断是否存在可行解 
 
*/
#include<iostream>
#include<map>
#include<string>
#include<stdio.h>
using namespace std;
double g[50][50];
int n,m;
void floyd()
{
    for(int k=1;k<=n;k++)
        for(int i=1;i<=n;i++)
            for(int j=1;j<=n;j++)
                if(g[i][k]!=-1 && g[k][j]!=-1)
                    if(g[i][j]==-1 || g[i][k]*g[k][j]>g[i][j])
                        g[i][j]=g[i][k]*g[k][j];
    int flag=0;
    for(int i=1;i<=n;i++){
        //printf("%lf
",g[i][i]);
        if(g[i][i]>1.0) 
            flag=1;
    }
    if(flag) puts("Yes");
    else puts("No");
} 
int main(void)
{
    string a,b;
    double c;
    int k=1;
    while(cin>>n,n)
    {
        for(int i=0;i<=n;i++)
            for(int j=0;j<=n;j++)
                g[i][j]=-1;
        map<string,int>M;
        for(int i=1;i<=n;i++){
            cin>>a;
            M[a]=i;
        }
        scanf("%d",&m);
        for(int i=0;i<m;i++){
            cin>>a>>c>>b;
            g[M[a]][M[b]]=c;
        }
        printf("Case %d: ",k++);
        floyd();
    }
    return 0;
}