pk1860 Currency Exchange
2016-05-04 17:41
357 查看
Description
Several currency exchange points are working in our city. Let us suppose that each point specializes in two particular currencies and performs exchange operations only with these currencies. There can be several points specializing in the same pair of currencies.
Each point has its own exchange rates, exchange rate of A to B is the quantity of B you get for 1A. Also each exchange point has some commission, the sum you have to pay for your exchange operation. Commission is always collected in source currency.
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 RAB, CAB, RBA and CBA - 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
The first line of the input contains four numbers: N - the number of currencies, M - the number of exchange points, S - the number of currency Nick has and V - the quantity of currency units he has. The following M lines contain 6 numbers each - the description
of the corresponding exchange point - in specified above order. Numbers are separated by one or more spaces. 1<=S<=N<=100, 1<=M<=100, V is real number, 0<=V<=103.
For each point exchange rates and commissions are real, given with at most two digits after the decimal point, 10-2<=rate<=102, 0<=commission<=102.
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 104.
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.
Several currency exchange points are working in our city. Let us suppose that each point specializes in two particular currencies and performs exchange operations only with these currencies. There can be several points specializing in the same pair of currencies.
Each point has its own exchange rates, exchange rate of A to B is the quantity of B you get for 1A. Also each exchange point has some commission, the sum you have to pay for your exchange operation. Commission is always collected in source currency.
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 RAB, CAB, RBA and CBA - 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
The first line of the input contains four numbers: N - the number of currencies, M - the number of exchange points, S - the number of currency Nick has and V - the quantity of currency units he has. The following M lines contain 6 numbers each - the description
of the corresponding exchange point - in specified above order. Numbers are separated by one or more spaces. 1<=S<=N<=100, 1<=M<=100, V is real number, 0<=V<=103.
For each point exchange rates and commissions are real, given with at most two digits after the decimal point, 10-2<=rate<=102, 0<=commission<=102.
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 104.
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.
相关文章推荐
- Hdu2066(一个人的旅行)
- Poj2638 网络流+最短路+二分答案
- Aizu1311 分层图最短路 (...大概)
- pku1733 Parity game(离散化+并查集)
- 最短路径 -- spfa
- 单源最短路深度分析
- hdu5137最短路
- hdoj 1874 畅通工程 vector邻接表测试
- poj 3255 Roadblocks
- 【POJ1860】Currency Exchange
- Dijkstra求最短路与次短路
- 2014西安邀请赛部分题解
- 2014 西安邀请赛状压DP
- 2013长沙邀请赛Travel in time
- 最短路dij——POJ 2387 Til the Cows Come Home题解
- 带负权的最短路bellman_ford——POJ 3259 Wormholes题解
- hdu 2544 最短路(简单的Floyd)
- hdu 3790 最短路径问题 (dijkstra算法+memset()用法)
- poj 2253 Frogger(dijkstra)
- hdu 2544 最短路 (Bellman_Ford算法)