Currency Exchange
Time Limit: 1000MS | Memory Limit: 30000K | |
Total Submissions: 32175 | Accepted: 12253 |
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 R AB, C AB, R BA and C BA - 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 R AB, C AB, R BA and C BA - 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<=10
3.
For each point exchange rates and commissions are real, given with at most two digits (数字) after the decimal (小数) point, 10 -2<=rate<=10 2, 0<=commission<=10 2.
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 10 4.
For each point exchange rates and commissions are real, given with at most two digits (数字) after the decimal (小数) point, 10 -2<=rate<=10 2, 0<=commission<=10 2.
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 10 4.
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
Source
Northeastern Europe 2001, Northern Subregion
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;
int n, m, s;
double map[105] = { 0 }, g1[105][105] = { 0 }, g2[101][101] = { 0 }, v;
int floyd()
{
int i, j, k;
double d[105];//本金
for (i = 1; i <= n; i++)d[i] = map[i];
for (k = 1; k <= n; k++)//控制两点之间的中间点数量
for (i = 1; i <= n; i++)//两个for实现i到j之间的货币直接兑换
for (j = 1; j <= n; j++)
if ((map[i] - g2[i][j])*g1[i][j]>map[j])map[j] = (map[i] - g2[i][j])*g1[i][j];
for (i = 1; i <= n; i++)//判断是否存在正环
if (d[i]<map[i])return 1;
return 0;
}
int main()
{
//freopen("Text.txt", "r", stdin);
cin >> n >> m >> s >> v;
int i, j, k;
for (i = 1; i <= m; i++)
{
int a, b;
double c, d, e, f;
cin >> a >> b >> c >> d >> e >> f;
g1[a][b] = c, g2[a][b] = d;
g1[b][a] = e, g2[b][a] = f;
}
map[s] = v;
floyd();
if (floyd())cout << "YES\n";
else cout << "NO\n";
}
转载地址:http://blog.csdn.net/yslcl12345/article/details/50574213