poj 1860 Bellman算法
来源:互联网 发布:java 写二进制文件 编辑:程序博客网 时间:2024/06/06 20:52
Currency Exchange
Time Limit: 1000MS Memory Limit: 30000KTotal Submissions: 28705 Accepted: 10721
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
参照了大神的题解才写出来的---点击打开链接
/* *Li Wenjun *Email:1542113545@qq.com */#include<stdio.h>#include<string.h>#include<math.h>#include <iostream>#include <algorithm>#include <cstring>#include <cmath>#include <queue>#include <vector>#include <cctype>#include <stack>#include <list>#include <cstdlib>#include <set>#include <map>using namespace std;#define debug 0#define MAXN 110double dist[MAXN];struct node { int u,v; double rate,cost;}load[MAXN*2];int N,M,S;double V;bool Bellman(){ memset(dist,0,sizeof(dist)); dist[S]=V; for(int i=0;i<N;i++) { bool flag = false; for(int j=0;j<M<<1;j++) { if(dist[load[j].v]<(dist[load[j].u]-load[j].cost)*load[j].rate) { flag = true; dist[load[j].v] = (dist[load[j].u]-load[j].cost)*load[j].rate; } } if(!flag) return false; } for(int j=0;j<M<<1;j++) if(dist[load[j].v]<(dist[load[j].u]-load[j].cost)*load[j].rate) return true; return false;}int main(){ #if debug freopen("in.txt", "r", stdin);#endif //debug while(cin>>N>>M>>S>>V) { int u,v; double a,b,c,d; for(int i=0;i<M;i++) { cin>>u>>v>>a>>b>>c>>d; load[i<<1].u=u; load[i<<1].v=v; load[i<<1].rate=a; load[i<<1].cost=b; load[(i<<1)|1].u=v; load[(i<<1)|1].v=u; load[(i<<1)|1].rate=c; load[(i<<1)|1].cost=d; } if(Bellman()) cout << "YES" << endl; else cout << "NO" << endl; } return 0;}
0 0
- poj 1860 Bellman算法
- poj 1860 bellman ford算法
- poj 3259 bellman-ford算法
- Poj 3259 Bellman-Ford算法
- poj 1860 bellman-ford
- poj 1860 bellman 求正环
- poj 1860 Bellman-Ford
- poj 1860 (bellman-ford)
- poj 1860 Bellman-Ford
- POJ 1860 Currency Exchange (Bellman-Ford算法的运用)
- POJ 1860 最短路径的bellman算法
- poj 1860 Currency Exchange (最短路,Bellman-Ford算法)
- poj 1860 最短路—Bellman-Ford算法
- 图算法 Bellman算法 POJ-3259
- poj 2240 Arbitrage bellman-ford算法
- POJ 2240 Arbitrage 图论 Bellman-ford算法
- poj 2240-Arbitrage Bellman-ford算法
- poj 3259 Wormholes(Bellman-ford 算法)
- HDOJ题目分类
- opencv,图像处理,rgb转换为hsv空间
- 浅谈C/C++中运算符的优先级、运算符的结合性以及操作数的求值顺序
- 2017年3月4号。
- Dijistra求最短路(邻接表存储,前向星存储,堆优化)
- poj 1860 Bellman算法
- FastCGI和php-fpm的区别
- EasyClient实现IPCamera摄像机远程云台控制、语音对讲等功能
- TCP协议:三次握手,四次挥手
- Android开发library项目时,res资源和manifest配置
- 有关顺序表操作的函数实现
- CTF-安全杂项-BAT公司信息查询系统
- 解决HEXO出现ERROR Deployer not found: git的问题
- cf 779A Pupils Redistribution