- POJ 1860 - Currency Exchange
- Time: 1000MS
- Memory: 30000K
- 难度: 初级
- 分类: 最短路径算法
0x00 POJ 原题
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 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
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<=10^(3).
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.
Sample Input
3 2 1 20.0
1 2 1.00 1.00 1.00 1.00
2 3 1.10 1.00 1.10 1.00
Sample Output
YES
Source
Northeastern Europe 2001, Northern Subregion
0x10 题目概述
有多种汇币,汇币之间可以交换,这需要手续费,当你用 100A 币交换 B 币时,A 到 B 的汇率是 29.75,手续费是 0.39,那么你可以得到(100 - 0.39) * 29.75 = 2963.3975 B 币。问 s 币的金额经过交换最终得到的 s 币金额数能否增加
货币的交换是可以重复多次的,所以我们需要找出是否存在正权回路,且最后得到的 s 金额是增加的
怎么找正权回路呢?(正权回路:在这一回路上,顶点的权值能不断增加即能一直进行松弛)
0x20 解题思路
关键在于反向利用 Bellman-Ford 算法
一种货币就是图上的一个点
一个“兑换点”就是图上两种货币之间的一个兑换环,相当于“兑换方式”M 的个数,是双边
唯一值得注意的是权值,当拥有货币 A 的数量为 V 时,A 到 A 的权值为 K,即没有兑换
而 A 到 B 的权值为 (V-Cab)*Rab
本题是“求最大路径”,之所以被归类为“求最小路径”是因为本题题恰恰与 bellman-Ford 算法的松弛条件相反,求的是能无限松弛的最大正权路径,但是依然能够利用 bellman-Ford 的思想去解题。
因此初始化 d(S)=V,而源点到其他店的距离(权值)初始化为无穷小(0),当 s 到其他某点的距离能不断变大时,说明存在最大路径
0x30 AC 源码
//Memory Time
//252K 16MS
#include<iostream>
using namespace std;
int n; //货币种数
int m; //兑换点数量
int s; //持有第s种货币
double v; //持有的s货币的本金
int all; //边总数
double dis[101]; //s到各点的权值
class exchange_points
{
public:
int a; //货币a
int b; //货币b
double r; //rate
double c; //手续费
}exc[202];
bool bellman(void)
{
memset(dis,0,sizeof(dis)); //这里与bellman的目的刚好相反。初始化为源点到各点距离无穷小
dis[s]=v; //即bellman本用于找负环,求最小路径,本题是利用同样的思想找正环,求最大路径
/*relax*/
bool flag;
for(int i=1;i<=n-1;i++)
{
flag=false;
for(int j=0;j<all;j++)
if(dis[exc[j].b] < (dis[exc[j].a] - exc[j].c) * exc[j].r) //寻找最长路径
{ //进行比较的是"某点到自身的权值"和"某点到另一点的权值"
dis[exc[j].b] = (dis[exc[j].a] - exc[j].c) * exc[j].r;
flag=true;
}
if(!flag)
break;
}
/*Search Positive Circle*/
for(int k=0;k<all;k++)
if(dis[exc[k].b] < (dis[exc[k].a] - exc[k].c) * exc[k].r) //正环能够无限松弛
return true;
return false;
}
int main(void)
{
int a,b;
double rab,cab,rba,cba; //临时变量
while(cin>>n>>m>>s>>v)
{
all=0; //注意初始化
for(int i=0;i<m;i++)
{
cin>>a>>b>>rab>>cab>>rba>>cba;
exc[all].a=a;
exc[all].b=b;
exc[all].r=rab;
exc[all++].c=cab;
exc[all].a=b;
exc[all].b=a;
exc[all].r=rba;
exc[all++].c=cba;
}
/*Bellman-form Algorithm*/
if(bellman())
cout<<"YES"<<endl;
else
cout<<"NO"<<endl;
}
return 0;
}