poj1860 Currency Exchange(bellman_flod判环)
来源:互联网 发布:数据库快速入门教程 编辑:程序博客网 时间:2024/05/29 12:15
Currency Exchange
Time Limit: 1000MS Memory Limit: 30000KTotal Submissions: 20988 Accepted: 7521
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.
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.
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.
Sample Input
3 2 1 20.01 2 1.00 1.00 1.00 1.002 3 1.10 1.00 1.10 1.00
Sample Output
YES
Source
Northeastern Europe 2001, Northern Subregion
/*用一个for(i=1---n)循环判断为什么会错呢?不懂,,加油!!!Time:2015-1-5 13:25*/#include<cstdio>#include<cstring>#include<algorithm>using namespace std;const int MAX=205;#define INF 0x3f3f3f3f#define eps 1e-9struct Node{ int u,v; double r,c;}p[MAX];int S;//持有第S种货币double V;double dis[MAX];int num,n;bool bellman_ford(){ for(int i=1;i<=num;i++){ dis[i]=0; }dis[S]=V; bool flag; while(dis[S]<=V+eps){ flag=false; for(int j=0;j<num;j++){ double tmp=(dis[p[j].u]-p[j].c)*p[j].r; if(tmp>dis[p[j].v]+eps){ dis[p[j].v]=tmp; flag=true; } } if(!flag) return dis[S]>V;//不松弛了就跳出循环了 } return true;}int main(){ int n,m; while(scanf("%d%d%d%lf",&n,&m,&S,&V)!=EOF){ double rAB,rBA,cAB,cBA; int a,b; num=0; for(int i=1;i<=m;i++){ scanf("%d%d%lf%lf%lf%lf",&a,&b,&rAB,&cAB,&rBA,&cBA); p[num].u=a;p[num].v=b; p[num].r=rAB;p[num++].c=cAB; p[num].u=b;p[num].v=a; p[num].r=rBA;p[num++].c=cBA; } if(bellman_ford())printf("YES\n"); else puts("NO"); }return 0;}
0 0
- poj1860 Currency Exchange(bellman_flod判环)
- poj1860 Currency Exchange 最短路变形 spfa 判环 思考
- POJ1860:Currency Exchange
- poj1860 - Currency Exchange
- Currency Exchange poj1860
- poj1860--Currency Exchange
- poj1860 Currency Exchange
- poj1860--Currency Exchange
- POJ1860 Currency Exchange
- POJ1860 Currency Exchange
- poj1860--Currency Exchange
- POJ1860-Currency Exchange
- POJ1860 - Currency Exchange
- POJ1860---Currency Exchange
- poj1860 Currency Exchange (bellman_ford)
- poj1860 - Currency Exchange
- 【POJ1860】Currency Exchange
- POJ1860-Currency Exchange
- windbg调试死锁问题
- JNI由浅入深_4_JNI基础知识详解
- 优化网站设计(十七):延迟或按需加载内容
- Xcode 6中添加预编译pch文件
- sgu-207 Robbers
- poj1860 Currency Exchange(bellman_flod判环)
- DD
- 果断Mark!国外程序员收集整理的PHP资源大全
- Python菜鸟学习手册13----标准库简介
- 优化网站设计(十八):预加载内容
- 5个步骤帮你更好地管理文件
- Android so lib库远程http下载和动态注册
- 【深入Java虚拟机】之七:Javac编译与JIT编译
- android推拉门效果(Scroller)