poj 1860 Currency Exchange
来源:互联网 发布:纯阳网络wenchunyang 编辑:程序博客网 时间:2024/06/03 21:38
Currency Exchange
Time Limit: 1000MS Memory Limit: 30000KTotal Submissions: 21936 Accepted: 7916
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
求是否存在正环路,如果能直接回到初始点就增大就可以直接退出~ 或者到最后有正环路也可以。
bellmax-ford的简单应用,利用他的k数组储存不同环长的信息。其中在比较时是sum>pro时松弛更新。算是bellmanford的求正环路吧。
#include <iostream>#include <stdio.h>#include <algorithm>#include <queue>#include <stack>#include <map>#include <vector>#include <set>#include <math.h>#include <string.h>#include <stdlib.h>using namespace std;struct p{int a,b;double r,c;}e[233];int t,n,s,cnt;double ans;double minn[233];int be,en;double r1,c1,r2,c2;bool relax(int q){double sum=(minn[e[q].a]-e[q].c)*e[q].r;if(sum>minn[e[q].b]){minn[e[q].b]=sum;return true;}return false;}bool bellford(){bool flag;for(int i=1;i<=n;i++) minn[i]=0;minn[s]=ans;for(int i=1;i<n;i++){flag=false;for(int j=1;j<=cnt;j++){if(relax(j)) flag=true;}if(minn[s]>ans) return true;if(!flag) {return false;}}for(int i=1;i<=cnt;i++){if(relax(i)) return true;}return false;}int main(){cin>>n>>t>>s>>ans;cnt=0;for(int i=1;i<=t;i++){cin>>be>>en>>r1>>c1>>r2>>c2;cnt++;e[cnt].a=be;e[cnt].b=en;e[cnt].r=r1;e[cnt].c=c1;cnt++;e[cnt].a=en;e[cnt].b=be;e[cnt].r=r2;e[cnt].c=c2;}bool k=bellford();if(k) cout<<"YES";else cout<<"NO";return 0;}
0 0
- POJ 1860 Currency Exchange
- poj 1860 Currency Exchange
- POJ 1860 Currency Exchange
- Poj 1860 Currency Exchange
- POJ 1860 Currency Exchange
- poj 1860 Currency Exchange
- POJ 1860 Currency Exchange
- poj 1860 Currency Exchange
- POJ 1860 Currency Exchange
- POJ 1860 Currency Exchange
- POJ 1860 Currency Exchange
- poj 1860 Currency Exchange
- POJ 1860 Currency Exchange
- poj 1860 Currency Exchange
- POJ-1860-Currency Exchange
- POJ 1860 Currency Exchange
- poj 1860 Currency Exchange
- POJ 1860 Currency Exchange
- Legal or Not
- Leetcode Probelm.3 Longest Substring Without Repeating Characters
- 为什么很多内置类如UITableViewController的delegate属性都是assign而不是retain的?
- Andorid调用系统的拍照功能和系统图库对图片进行裁剪
- srm 530
- poj 1860 Currency Exchange
- 格式化输出的函数printf()用法
- Leetcode Problem.7—Reverse Integer
- aapt的使用
- Nginx配置性能优化
- 多线程面试秒杀系列5--多线程入门
- GET获得json
- winfrom单实例应用方案汇总
- 第六章第6题