题目大意
- 给出n个顶点,m条边,原点s及初始金钱v。每条边有6个参数from, to, c1, r1, c2, r2。
- 假设在from出有v的金钱,从from -> to,金钱 = (v - c1) * r1;
假设在to出有v的金钱,从to -> from,金钱 = (v - c2) * r2; - 求从s出发,最终回到s时金钱能否增长
分析
- 把每条双向边改写成两条单向边。
- 只需用Bellman-Ford算法判断出图中是否有正环即可,因为只有存在正环的情况金钱才会增加。
代码
#include <iostream>
#include <vector>
using namespace std;
const int maxn = 110;
struct edges {
int from , to;
double r , c;
edges() {}
edges(int x , int y , double z , double w) {
from = x; to = y;
r = z; c = w;
}
};
vector<edges> edgess;
double dis[maxn];
bool bellman_ford(int m , int n , int s , double v)
{
for(int i = 0; i <= n; i++) dis[i] = 0;
dis[s] = v;
for(int i = 1; i < n; i++) for(int j = 0; j < 2 * m; j++) {
double tmp = (dis[edgess[j].from] - edgess[j].c) * edgess[j].r;
if(tmp > dis[edgess[j].to]) dis[edgess[j].to] = tmp;
}
for(int j = 0; j < 2 * m; j++) {
double tmp = (dis[edgess[j].from] - edgess[j].c) * edgess[j].r;
if(tmp > dis[edgess[j].to]) return true;
}
return false;
}
int main()
{
int m , n , s;
double v;
while(cin >> n >> m >> s >> v)
{
edgess.clear();
for(int i = 0; i < m; i++) {
int from , to; double c1 , c2 , r1 , r2;
cin >> from >> to >> r1 >> c1 >> r2 >> c2;
edgess.push_back(edges(from , to , r1 , c1));
edgess.push_back(edges(to , from , r2 , c2));
}
if(bellman_ford(m , n , s , v)) cout << "YES" << endl;
else cout << "NO" << endl;
}
return 0;
}