poj-1860 Currency Exchange
2015-08-03 19:33
253 查看
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.
Sample Input
Sample Output
实质上是求一个最长路,因为题中要求让手里的钱能兑换的更多,那么只要在最长路基础上检查是否还能再增加就行了。
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
实质上是求一个最长路,因为题中要求让手里的钱能兑换的更多,那么只要在最长路基础上检查是否还能再增加就行了。
#include <iostream> #include <stdio.h> #include <string.h> #include <stdlib.h> #include <algorithm> #define INF 0x3f3f3f3f #define mod 1000000007 using namespace std; int s,n,m,k; double v; struct node { int a,b; double r,c; }arr[202]; double dis[200]; int bf() { int i,j; memset(dis,0,sizeof(dis)); dis[s]=v; for (i=1;i<n;i++) { int flag=0; for (j=0;j<k;j++) { int a=arr[j].a,b=arr[j].b; if(dis[b]<(dis[a]-arr[j].c)*arr[j].r) {dis[b]=(dis[a]-arr[j].c)*arr[j].r;flag=1;} } if(!flag) break; } for (i=0;i<k;i++) if(dis[arr[i].b]<(dis[arr[i].a]-arr[i].c)*arr[i].r) return 1; return 0; } int main() { int a,b,i; double rab,cab,rba,cba; while (~scanf("%d%d%d%lf",&n,&m,&s,&v)) { k=0; for (i=1;i<=m;i++) { scanf("%d%d%lf%lf%lf%lf",&a,&b,&rab,&cab,&rba,&cba); arr[k].a=a; arr[k].b=b; arr[k].r=rab; arr[k++].c=cab; arr[k].a=b; arr[k].b=a; arr[k].r=rba; arr[k++].c=cba; } if(bf()) printf("YES\n"); else printf("NO\n"); } return 0; }
相关文章推荐
- 关于三星某些系列笔记本电脑无法安装Windows10的原因及解决办法
- 设计模式 迪米特法则
- 【linux高级程序设计】(第十三章)Linux Socket网络编程基础 4
- Redis服务器剖析
- 简单登陆页面的创建(页面跳转.键盘回收.实现换行.清除textField中的文字)
- python常用函数
- 初窥Linux 之 我最常用的20条命令
- hdoj 2553 N皇后问题
- 全站编码问题 请求和响应编码的处理
- poj-1860-Currency Exchange-Bellman
- hdu 1045 Fire Net(最大流)
- boost使用出现问题
- 【leetcode】Search a 2D Matrix II
- 自定义的ListView 点击事件无响应解决办法
- USACO 2.1.4 Healthy Holsteins
- smb
- ios例子
- Linux多线程——使用信号量同步线程
- poj2065--SETI(高斯消元)
- Eclipse删除workspace的技巧