Arbitrage
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 9795 Accepted: 4162
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
----------------------------------------------------------------------------------------------------------------------
判斷有向圖是否存在邊權積大於1的環，bellmanford，注意有指向自身的邊，對於字符串編號，Trie用不用都可以(數據規模比較小).
----------------------------------------------------------------------------------------------------------------------
Code:
program poj_2240;
type link=^node; node=record ch:array[0..255] of link; id:longint; end;
var trie:link;
n,m,tot,tc,i,j,k,a,b,code:longint;
flag:boolean;
g:array[1..30,1..30] of double;
dis:array[1..30] of double;
s:string;
procedure newnode(var p:link);
var i:longint;
begin
new(p);
for i:=0 to 255 do p^.ch[i]:=nil;
p^.id:=-1;
end;
function id(s:string):longint;
var i:longint; p:link;
begin
p:=trie;
for i:=1 to length(s) do begin
if p^.ch[ord(s[i])]=nil then
newnode(p^.ch[ord(s[i])]);
p:=p^.ch[ord(s[i])];
end;
if p^.id=-1 then begin
inc(tot);
p^.id:=tot;
end;
exit(p^.id);
end;
begin
tc:=0;
while true do begin
readln(n);
if n=0 then break;
inc(tc);
newnode(trie);
tot:=0;
for i:=1 to n do begin
readln(s);
id(s);
end;
fillchar(g,sizeof(g),0);
readln(m);
for i:=1 to m do begin
readln(s);
a:=id(copy(s,1,pos(#32,s)-1));
delete(s,1,pos(#32,s));
b:=id(copy(s,pos(#32,s)+1,length(s)-pos(#32,s)));
delete(s,pos(#32,s),length(s)-pos(#32,s)+1);
val(s,g[a,b],code);
//g[b,a]:=g[a,b];{Hit}
end;
fillchar(dis,sizeof(dis),0);
dis[1]:=1;
write('Case'+#32,tc,':'+#32);
for k:=1 to n do begin
flag:=false;
for i:=1 to n do
for j:=1 to n do
if dis[i]*g[i,j]>dis[j] then begin
flag:=true;
dis[j]:=dis[i]*g[i,j];
end;
if not flag then begin
writeln(‘No’);
break;
end;
if k=n then writeln(‘Yes’);
end;
readln;
end;
end.