Description
For example, if you want to exchange 100 US Dollars into Russian Rubles at the exchange point, where the exchange rate is 29.75, and the commission is 0.39 you will get (100 - 0.39) * 29.75 = 2963.3975RUR.
You surely know that there are N different currencies you can deal with in our city. Let us assign unique integer number from 1 to N to each currency. Then each exchange point can be described with 6 numbers: integer A and B - numbers of currencies it exchanges, and real R AB, C AB, R BA and C BA - exchange rates and commissions when exchanging A to B and B to A respectively.
Nick has some money in currency S and wonders if he can somehow, after some exchange operations, increase his capital. Of course, he wants to have his money in currency S in the end. Help him to answer this difficult question. Nick must always have non-negative sum of money while making his operations.
Input
For each point exchange rates and commissions are real, given with at most two digits after the decimal point, 10 -2<=rate<=10 2, 0<=commission<=10 2.
Let us call some sequence of the exchange operations simple if no exchange point is used more than once in this sequence. You may assume that ratio of the numeric values of the sums at the end and at the beginning of any simple sequence of the exchange operations will be less than 10 4.
Output
If Nick can increase his wealth, output YES, in other case output NO to the output file.
题解
这一题跟3259相反,需要用BELLMAN找正环的最长路,需要注意汇率是有小数的(real)。
代码
const
maxn=100000;
type
ccc=record
a,b:longint;
c,d:real;
end;
var
a:array[1..maxn]of ccc;
dis:array[1..maxn]of real;
n,m,b:longint;
s:real;
procedure relax(a,b:longint;c,d:real);
begin
if (dis[a]-d)*c>dis[b] then dis[b]:=(dis[a]-d)*c;
end;
function bellman_ford:boolean;
var
i,j:longint;
begin
for i:=1to n do
for j:=1 to 2*m do
relax(a[j].a,a[j].b,a[j].c,a[j].d);
for i:=1 to 2*m do
if (dis[a[i].a]-a[i].d)*a[i].c>dis[a[i].b] then exit(true);
exit(false)
end;
procedure init;
var
i,j:longint;
begin
readln(n,m,b,s);
fillchar(a,sizeof(a),0);
fillchar(dis,sizeof(dis),0);
dis[b]:=s;
for j:=1 to m do
begin
readln(a[j*2-1].a,a[j*2-1].b,a[j*2-1].c,a[j*2-1].d);
a[j*2].a:=a[j*2-1].b;
a[j*2].b:=a[j*2-1].a;
end;
if bellman_ford then writeln('YES')
else writeln('NO')
end;
begin
init;
end.