zoj 1092||poj2240(bellman_f…

Arbitrage

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 12086		Accepted: 5075

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

具体解法参看图论算法

// I'm the Topcoder

//C

#include

#include

#include

#include

#include

#include

//C++

#include

#include

#include

#include

#include

#include

#include

#include

#include

#include

#include

#include

#include

#include

#include

using namespace std;

//*************************OUTPUT*************************

#ifdef WIN32

#define INT64 "%I64d"

#define UINT64 "%I64u"

#else

#define INT64 "%lld"

#define UINT64 "%llu"

#endif

//**************************CONSTANT***********************

#define INF 0x3f3f3f3f

#define eps 1e-8

#define PI acos(-1.)

#define PI2 asin (1.);

typedef long long LL;

//typedef __int64 LL;   //codeforces

typedef unsigned int ui;

typedef unsigned long long ui64;

#define MP make_pair

typedef vector VI;

typedef pair PII;

#define pb push_back

#define mp make_pair

//***************************SENTENCE************************

#define CL(a,b) memset (a, b, sizeof (a))

#define sqr(a,b) sqrt ((double)(a)*(a) + (double)(b)*(b))

#define sqr3(a,b,c) sqrt((double)(a)*(a) + (double)(b)*(b) + (double)(c)*(c))

//****************************FUNCTION************************

template double DIS(T va, T vb) { return sqr(va.x - vb.x, va.y - vb.y); }

template inline T INTEGER_LEN(T v) { int len = 1; while (v /= 10) ++len; return len; }

template inline T square(T va, T vb) { return va * va + vb * vb; }

// aply for the memory of the stack

//#pragma comment (linker, "/STACK:1024000000,1024000000")

//end

#define maxn 50+10//顶点最大值

#define maxm 1000+10//边数最大值

struct exchange{

    int ci,cj;

    double cij;

}ex[maxm];//汇率关系数组

int n,m;

char name[maxn][20];//货币名称

char a[maxn],b[maxn];

double x;//存入的汇率

double maxdist[maxn];//源点i到其他每个顶点（包括本身）的最长路径长度

int flag;

int kase=0;

int readcase(){

    scanf("%d",&n);

    if(n==0)  return 0;

    //读入n个货币的名称

    for(int i=0;i

        scanf("%s",name[i]);

    }

    scanf("%d",&m);

    for(int i=0;i

        //读入汇率

        int j,k;

        scanf("%s %lf %s",a,&x,b);

        for( j=0;strcmp(a,name[j]);j++);//*****

        for( k=0;strcmp(b,name[k]);k++);

        ex[i].ci=j;  ex[i].cij=x;  ex[i].cj=k;//?????

// printf("ex[i].ci=%d\n",ex[i].ci);;

// printf("ex[i].cj=%d\n",ex[j].cj);

// printf("ex[i].cij=%lf\n",ex[i].cij);

    }

    return 1;

}

//bellman-ford算法：以顶点v0为源点，求它到每个顶点（包括它本事）的最大距离

void bellman(int v0){

    flag=0;

    memset(maxdist,0,sizeof(maxdist));

    maxdist[v0]=1;

    for(int k=1;k<=n;k++){

        //从maxdist[0]递推到maxdist[i],,,maxdist[n];

        for(int i=0;i

            //判断每条边，加入它是否能使最大距离增加

            if(maxdist[ex[i].ci]*ex[i].cij>maxdist[ex[i].cj]){

                maxdist[ex[i].cj]=maxdist[ex[i].ci]*ex[i].cij;

            }

        }

    }

    if(maxdist[v0]>1.0)  flag=1;

}

int main(){

    while(readcase()){

        for(int i=0;i

            bellman(i);

            if(flag)   break;

        }

        if(flag)

            printf("Case %d: Yes\n",++kase);

            //printf("Case %d: YES\n",++kase);

        else //printf("Case %d: No\n",++kase);

            printf("Case %d: No\n",++kase);

    }

    return 0;

}