HDU/HDOJ 1217 Arbitrage University of Ulm Local Contest 1996

Arbitrage

Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 1373Accepted Submission(s): 624

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

University of Ulm Local Contest 1996

这个题给了一个非常有趣的问题：换钱

因为各种钱之间有不同的汇率。问题是能不能找到一个环，让我的钱一直在这个环里面一直转一直转，然后钱越来越多。。Orz

如果有的话输出yes，反之就输出no

这个题我首先就想到了图论中的负环判断。不过迟迟不知道怎么建图

因为他这个边权要相乘才会有意义。

但是我们的最短路算法可是处理的相加啊。。

等等，相加，相乘？？

取对数！

恩这个就是我的思路过程了

只要想到了这一点就很容易解决问题了，边权就赋值为log(1/rate)

这样两条边的边权想加，其实就是相乘。很巧妙的转化

紧接着，就是用spfa进行负环的判断就OK了

我的代码：

#pragma warning(disable:4786) #include<stdio.h> #include<math.h> #include<string.h> #include<vector> #include<algorithm> #include<map> #include<string> #include<queue> #define maxn 35 #define inf 99999999 using namespace std; struct node { int v; double len; }; vector<node>graph[maxn]; map<string,int>my; void init(int n) { int i; for(i=0;i<maxn;i++) graph[i].clear(); my.clear(); } bool spfa(int s,int n) { int i,num[maxn]; double dis[maxn]; bool used[maxn]; queue<int>q; for(i=0;i<maxn;i++) dis[i]=inf; memset(used,0,sizeof(used)); memset(num,0,sizeof(num)); dis[s]=0; used[s]=true; q.push(s); while(!q.empty()) { int u=q.front(); q.pop(); used[u]=false; for(i=0;i<graph[u].size();i++) { node p=graph[u][i]; if(dis[p.v]>dis[u]+p.len) { dis[p.v]=dis[u]+p.len; if(!used[p.v]) { used[p.v]=true; if(num[p.v]>n) return true; q.push(p.v); num[p.v]++; } } } } return false; } int main() { int i,n,m,num,a,b,cnt=1; double rate; char s1[35],s2[35]; node p; while(scanf("%d",&n)!=EOF) { if(n==0) break; init(n); num=0; for(i=1;i<=n;i++) { scanf("%s",s1); num++; my[s1]=num; } scanf("%d",&m); for(i=1;i<=m;i++) { scanf("%s%lf%s",s1,&rate,s2); a=my[s1],b=my[s2]; p.v=b; p.len=log(1.0/rate); graph[a].push_back(p); } if(spfa(1,n)) printf("Case %d: Yes\n",cnt++); else printf("Case %d: No\n",cnt++); } return 0; }