zoukankan      html  css  js  c++  java
  • (最短路 SPFA)Currency Exchange -- poj -- 1860

    链接:

    http://poj.org/problem?id=1860

    Time Limit: 1000MS   Memory Limit: 30000K
    Total Submissions: 23261   Accepted: 8419

    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

    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 <cstdio>
    #include <cstring>
    #include <stdlib.h>
    #include <math.h>
    #include <queue>
    #include <algorithm>
    using namespace std;
    
    #define N 1100
    
    int Head[N], cnt, n;
    double V, vv[N]; ///vv中记录的是兑换到此种货币的最大值
    
    struct node
    {
        int u, v;
        double rate, commission;
        int next;
    }a[N];
    
    void Init()
    {
        memset(Head, -1, sizeof(Head));
        memset(vv, 0, sizeof(vv));
        cnt = 0;
    }
    
    void Add(int u, int v, double rate, double commission)
    {
        a[cnt].u = u;
        a[cnt].v = v;
        a[cnt].rate = rate;
        a[cnt].commission = commission;
        a[cnt].next = Head[u];
        Head[u] = cnt++;
    }
    
    int SPFA(int s)
    {
        queue<int>Q;
        Q.push(s);
    
        while(Q.size())
        {
            int p = Q.front(); Q.pop();
    
            for(int i=Head[p]; i!=-1; i=a[i].next)
            {
                int u = a[i].u;
                int v = a[i].v;
                double k = (vv[u]-a[i].commission) * a[i].rate;
    
                if(vv[v] < k)
                {
                    vv[v] = k;
                    Q.push(v);
                }
            }
    
            if(vv[s]>V)
                return 1;
        }
        return 0;
    }
    
    int main()
    {
        int m, s;
    
        while(scanf("%d%d%d%lf", &n, &m, &s, &V)!=EOF)
        {
            int i, u, v;
            double rate1, rate2, commission1, commission2;
    
            Init();
            for(i=1; i<=m; i++)
            {
                scanf("%d%d%lf%lf%lf%lf", &u, &v, &rate1, &commission1, &rate2, &commission2);
                Add(u, v, rate1, commission1);
                Add(v, u, rate2, commission2);
            }
    
            vv[s] = V;
    
            int ans = SPFA( s );
    
            if(ans)
                printf("YES
    ");
            else
                printf("NO
    ");
        }
        return 0;
    }
    勿忘初心
  • 相关阅读:
    sudo 之后 unable to resolve host的问题解决办法
    Linux 查找具体的文件名称
    linux 访问远程务器代码
    spark 安装配置
    R基本介绍
    BIEE多层表头报表的制作方法
    支付宝新漏洞引发恐慌,那如何关闭小额免密支付呢
    大家注意了,支付宝被曝重大安全漏洞,回应称正在跟进排查
    2017年5个不应该被忽视的机器学习项目
    婚前最后一次加班
  • 原文地址:https://www.cnblogs.com/YY56/p/4789021.html
Copyright © 2011-2022 走看看