[kuangbin]专题四最短路练习 Currency Exchange POJ - 1860【spfa】

最新推荐文章于 2019-08-31 15:46:12 发布

invoKer-

最新推荐文章于 2019-08-31 15:46:12 发布

阅读量163

点赞数 2

分类专栏：最短路

本文链接：https://blog.csdn.net/inv00ker/article/details/100141976

版权

最短路专栏收录该内容

20 篇文章 0 订阅

订阅专栏

【题目描述】
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.
我们的城市中有几个货币兑换点运作。假设每个点专门处理两种特定的货币，并且只对这些货币执行兑换操作。可以有几个点专门针对同一种货币。每个点都有自己的汇率，A到B的汇率是1A兑换的B的数量。另外，每个兑换点都有一定的佣金，你必须为你的兑换业务支付的金额。佣金总是以货币量收取。
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.
例如，如果你想在兑换点将100美元兑换成俄罗斯卢布，汇率为29.75，佣金为0.39，你将得到(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.
你当然知道，在我们的城市里，你可以使用N种不同的货币。让我们为每种货币分配从1到N的唯一整数。然后，每个交换点可以用6个数字来描述：整数A和B-它交换的货币号码，实数R_AB, C_AB, R_BA and C_BA-交换A到B和B到A的汇率和佣金。
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.
Nick有一些货币S，他想知道他是否可以某种方式，在一些外汇操作后，增加他的资本。当然，他最终想把钱换成S货币。帮助他回答这个难题。Nick在进行操作的时候总要有一笔非负的钱。

【输入】
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³.
输入的第一行包含四个整数：N-货币的数量，M-货币交换点的数量，S-Nick拥有的货币，V-他拥有的货币单位数量。后面M行包含每行6个整数-按上述顺序指定的相应交换点的说明。数字由一个或多个空格分隔。1<=S<=N<=100, 1<=M<=100, V is real number, 0<=V<=10³.
For each point exchange rates and commissions are real, given with at most two digits after the decimal point, 10^-2<=rate<=10², 0<=commission<=10^2.
对于每一个点的汇率和佣金都是实数，在小数点之后给出最多两位数，10^-2<=rate<=10², 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⁴.
如果在这个序列中没有不止一次使用交换点，那么让我们简单地调用交换操作的某些序列。您可以假设，在交换操作的任何简单序列的末尾和开始处的数字值的比率将小于10⁴。

【输出】
If Nick can increase his wealth, output YES, in other case output NO to the output file.
如果Nick能增加他的财富，就输出“YES”，否则就输出“NO”

【样例输入】
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

【样例输出】
YES

题目链接：https://cn.vjudge.net/problem/POJ-1860

改个松弛条件就行

代码如下：

#include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define INF 1e9
static const int MAXN=100;
struct Edge{
    int v;
    double rate,cost;
    Edge(int _v=0,double _rate=0,double _cost=0):v(_v),rate(_rate),cost(_cost){}
};
vector<Edge> E[MAXN+10];
bool vis[MAXN+10];
double dist[MAXN+10];
bool spfa(int n,int start,double v)
{
    for(int i=1;i<=n;i++)
    {
        vis[i]=false;
        dist[i]=0;
    }
    dist[start]=v;
    vis[start]=true;
    queue<int> Q;
    while(!Q.empty())
        Q.pop();
    Q.push(start);
    while(!Q.empty())
    {
        int u=Q.front();
        Q.pop();
        vis[u]=false;
        for(int i=0;i<E[u].size();i++)
        {
            int v=E[u][i].v;
            if(dist[v]<(dist[u]-E[u][i].cost)*E[u][i].rate)
            {
                dist[v]=(dist[u]-E[u][i].cost)*E[u][i].rate;
                if(!vis[v])
                {
                    vis[v]=true;
                    Q.push(v);
                }
            }
        }
        if(dist[start]>v)
            return true;
    }
    return false;
}
int main()
{
    std::ios::sync_with_stdio(false);
    std::cin.tie(0),cout.tie(0);
    int n,m,s;
    double v;
    cin>>n>>m>>s>>v;
    for(int i=1;i<=m;i++)
    {
        int a,b;
        double rab,cab,rba,cba;
        cin>>a>>b>>rab>>cab>>rba>>cba;
        E[a].push_back(Edge(b,rab,cab));
        E[b].push_back(Edge(a,rba,cba));
    }
    if(spfa(n,s,v))
        cout<<"YES"<<endl;
    else
        cout<<"NO"<<endl;
    return 0;
}