题意:有M个货币兑换点,N种货币,一个兑换点只能用一种货币兑换另外一种,每个兑换点汇率不同(路径),可以有多个兑换点兑换相同的货币(重边),同时兑换的时候需要交佣金,计算方案为 货币B = (货币A - 佣金) * 汇率,问有没有兑换方法使得资产增加。
思路:spfa判断正环。(只要有一个正环使得资产增加一点,循环往复资产就会增加到INF)
代码:
#pragma GCC optimize(2)
#include<map>
#include<queue>
#include<string>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
#define fi first
#define se second
#define ff double
#define int long long
#define PII pair<int,int>
#define all(x) x.begin(),x.end()
#define debug(x) cout << x << endl
#define mem(a,b) memset(a,b,sizeof(a))
const int INF = 0x3f3f3f3f;
const int mod = 1e9 + 7;
const int N = 505;
int n, m, s, vis[N], cnt[N];
int h[N], e[N], ne[N], idx;
ff v, dis[N], w[N], r[N];
void add(int a, int b, ff c, ff d){e[idx] = b; w[idx] = c; r[idx] = d; ne[idx] = h[a]; h[a] = idx ++;}
int spfa(int s){
mem(dis, 0);
queue<int> q;
q.push(s);
vis[s] = 1; cnt[s] ++;
dis[s] = v;
while(q.size()){
int v = q.front(); q.pop();
vis[v] = 0;
for(int i = h[v]; i != -1;i = ne[i]){
int j = e[i];
if(dis[j] < (dis[v] - r[i]) * w[i]){
dis[j] = (dis[v] - r[i]) * w[i];
cnt[j] ++;
if(cnt[j] >= n) return 1;
if(!vis[j]) vis[j] = 1, q.push(j);
}
}
}
return 0;
}
signed main() {
mem(vis, 0); mem(cnt, 0); mem(h, -1); idx = 0;
cin >> n >> m >> s >> v;
while(m --){
int u, c;
ff x, y, z, t;
cin >> u >> c >> x >> y >> z >> t;
add(u, c, x, y);
add(c, u, z, t);
}
if(spfa(s)) puts("YES");
else puts("NO");
}