Currency Exchange - poj 1860
2015-07-07 10:15
323 查看
Time Limit: 1000MS | Memory Limit: 30000K | |
Total Submissions: 22111 | Accepted: 7986 |
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.
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 这题使用Bellman-Ford算法,将判断条件修改一下即可,找到是否有权增加的回路
#include <iostream> #include<string.h> using namespace std; struct exch { int src, des; float rate, commission; } ex[202]; int main() { int cur_num, exp_num, cur; float init; float c[101]; while (cin >> cur_num >> exp_num >> cur >> init) { memset(c, 0, 101 * sizeof(float)); c[cur] = init; for (int i = 0; i < exp_num; i++) { int a, b; cin >> a >> b; ex[2 * i].src = a; ex[2 * i].des = b; cin >> ex[2 * i].rate >> ex[2 * i].commission; ex[2 * i + 1].src = b; ex[2 * i + 1].des = a; cin >> ex[2 * i + 1].rate >> ex[2 * i + 1].commission; } for (int i = 0; i < cur_num ; i++) { for (int j = 0; j < 2 * exp_num; j++) { if (c[ex[j].des] < (c[ex[j].src] - ex[j].commission) * ex[j].rate) { c[ex[j].des] = (c[ex[j].src] - ex[j].commission) * ex[j].rate; } } } int flag = 0; for (int j = 0; j < 2 * exp_num; j++) { if (c[ex[j].des] < (c[ex[j].src] - ex[j].commission) * ex[j].rate) { flag=1; break; } } if(flag==1){ cout<<"YES"<<endl; }else{ cout<<"NO"<<endl; } } return 0; }
相关文章推荐
- python process,queue
- 最大子序列和
- [置顶] intel编译器icc以及数学库MKL的下载与安装
- Eclipse 常用快捷键 (动画讲解)
- linux多进程之间的文件锁
- hdu 2222 Keywords Search (AC自动机)
- 日经社説 20150707 メコン諸国と細やかな連携を
- javascript中数组方法汇总
- 如何实现协议传值
- 7月初.公司域名注册总量TOP15:耐思尼克滑至榜尾
- 为什么设计师设计不出产品经理满意的作品?
- CF 554B Ohana Cleans Up
- jacob操作office分享
- 日经春秋 20150707
- xcode 6 修改组织及开发者
- redirect_uri 参数错误的解决办法
- 从客户端(hidXML="<FlexCell xml:space=...")中检测到有潜在危险的Request.Form值
- Mysql中一些比较有用的命令
- 黑马程序员——C/OC—OC对比C语言的差异化
- Check Point R75,R77 gaia expert 密码重置