ZOJ1092 Arbitrage

Arbitrage

---

Time Limit: 1 Second      Memory Limit: 32768 KB

---

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 Specification

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 c_i of a source currency, a real number r_ij which represents the exchange rate from c_i to c_j and a name c_j 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 Specification

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: University of Ulm Local Contest 1996

 

看到题目的第一眼真没想到什么算法，后来知道是Floyd才恍然大悟。

 

思路：把各个国家看做是顶点，然后相互之间的汇率是权值，我们只需要利用Floyd来求出最长路径（注意是最长可不是最短）。还有一点值得注意在Floyd实现的时候，有两个权值相加然后与原权值比较的过程，又因为我们是要对汇率进行累乘了，所以我们要把汇率都取log2(),这样子相加的话就相当于相乘了。还有，因为各个顶点都是字符串，我们要字符串数组给他们存起来并依次编号，这样子用的时候查找一下编号就可以了。

 

我的时间是0.02s ，第一的大牛是0.00s 。。。。

 

Code:

/* *JackyZheng *2010/12/19 *C */ #include<stdio.h> #include<string.h> #include<math.h> short n,m; float graph[30][30]; char name[30][20]; int main() { short i,j,k; short num; short cases=0; while(scanf("%d",&n)&&n) { memset(graph,0,sizeof(graph)); char p1[20]; char p2[20]; num=0; double r; for(i=0;i<n;i++) { scanf("%s",name[num++]); } scanf("%d",&m); for(i=0;i<m;i++) { scanf("%s%lf%s",p1,&r,p2); for(j=0;j<num;j++) { if(!strcmp(name[j],p1)) { break; } } for(k=0;k<num;k++) { if(!strcmp(name[k],p2)) { break; } } graph[j][k]=log2(r); } for(k=0;k<n;k++) { for(i=0;i<n;i++) { for(j=0;j<n;j++) { if(graph[i][j]<graph[i][k]+graph[k][j]) { graph[i][j]=graph[i][k]+graph[k][j]; } } } } int flag=0; for(i=0;i<num;i++) { if(graph[i][i]>0) { flag=1; break; } } printf("Case %d: ",++cases); printf("%s/n",flag?"Yes":"No"); } return 0; }