POJ 1860 Currency Exchange（BellmanFord算法的變形，求正環）

/*
POJ 1860

有多種匯幣，匯幣之間可以交換，這需要手續費，當你用100A幣
交換B幣時，A到B的匯率是29.75，手續費是0.39，那么你可以得到
(100 - 0.39) * 29.75 = 2963.3975 B幣。問s幣的金額經過交換最終
得到的s幣金額數能否增加
貨幣的交換是可以重復多次的，所以我們需要找出是否存在
正權回路，且最后得到的s金額是增加的
怎么找正權回路呢？（正權回路：在這一回路上，頂點的權值能不斷增加即能一直進行松弛）

關鍵在於反向利用Bellman-Ford算法


單源最短路徑算法，因為題目可能存在負邊，所以用Bellman Ford算法，
原始Bellman Ford可以用來求負環，這題需要改進一下用來求正環

一種貨幣就是圖上的一個點
一個“兌換點”就是圖上兩種貨幣之間的一個兌換環，相當於“兌換方式”M的個數，是雙邊
唯一值得注意的是權值，當擁有貨幣A的數量為V時，A到A的權值為K，即沒有兌換
而A到B的權值為(V-Cab)*Rab
本題是“求最大路徑”，之所以被歸類為“求最小路徑”是因為本題題恰恰
與bellman-Ford算法的松弛條件相反，求的是能無限松弛的最大正權路徑，
但是依然能夠利用bellman-Ford的思想去解題。
因此初始化d(S)=V   而源點到其他店的距離（權值）初始化為無窮小（0），
當s到其他某點的距離能不斷變大時，說明存在最大路徑
*/
//G++ 696K 0MS

#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<iostream>
using namespace std;

const int MAXN=110;
const int MAXE=210;//兩倍

double dist[MAXN];

int tol;//邊的總數
int D[MAXE][2];//存邊的起點和終點
double C[MAXE][2];//存匯率和手續費

//修正后的Bellman，求正環
bool Bellman(int start,int n,double V)
{
    for(int i=1;i<=n;i++) dist[i]=0;
    dist[start]=V;
    for(int i=1;i<n;i++)//做n-1次
    {
        bool flag=false;//優化
        for(int j=0;j<tol;j++)
        {
            int u=D[j][0];
            int v=D[j][1];
            if(dist[v] < (dist[u]-C[j][1])*C[j][0])//求最大
            {
                flag=true;
                dist[v]=(dist[u]-C[j][1])*C[j][0];
            }
        }
        if(!flag)return false;//沒有更新，不存在正環
    }
    for(int j=0;j<tol;j++)
      if(dist[D[j][1]]<(dist[D[j][0]]-C[j][1])*C[j][0])
        return true;//有正環
    return false;
}


int main()
{
    int n;
    int M;
    int a,b;
    double c,d,e,f;
    int S;
    double V;
    while(scanf("%d%d%d%lf",&n,&M,&S,&V)!=EOF)
    {
        tol=0;
        while(M--)
        {
            scanf("%d%d%lf%lf%lf%lf",&a,&b,&c,&d,&e,&f);
            D[tol][0]=a;
            D[tol][1]=b;
            C[tol][0]=c;
            C[tol][1]=d;
            tol++;
            D[tol][0]=b;
            D[tol][1]=a;
            C[tol][0]=e;
            C[tol][1]=f;
            tol++;
        }
        if(Bellman(S,n,V)) printf("YES\n");
        else printf("NO\n");
    }
    return 0;
}

 

Currency Exchange

Time Limit: 1000MS		Memory Limit: 30000K
Total Submissions: 13585		Accepted: 4669

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.

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 ³.
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 ².
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 ⁴.

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