spfa判断负环回路

经典例题：虫洞

#include<cstdio>
#include<cmath>
#include<cstring>
#include<iostream>
#include<map>
#include<stack>
#include<queue>
#include<string>
#include<vector>
#include<algorithm>
#define ll long long
#define mem(a) memset(a,0,sizeof(a))
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define inf 0x3f3f3f3f
#define sf(n) scanf("%d", &n)
#define endl '\n'
#define cyes cout<<"yes"<<endl
#define debug(x) cout<<"-----"<<x<<endl

using namespace std;

const int N = 510, M = 6000;

int n, m, p;
struct node {int v, w, next;} edge[M];
int idx, head[N];

void add(int u, int v, int w)
{
	edge[idx] = {v, w, head[u]};
	head[u] = idx++;
}

int dis[N], cnt[N];
bool vis[N];

bool spfa()
{
	memset(cnt, 0, sizeof cnt);
	memset(vis, 0, sizeof vis);
//	memset(dis, 0, sizeof dis);
	
	queue<int> q;
	//这里可以换成栈，反而更快了
	
	for(int i = 1; i <= n; i++) //所有点全部入队
	{
		q.push(i);
		vis[i] = true;
	}
	
	while(!q.empty())
	{
		int u = q.front();
		q.pop(); vis[u] = false;
		
		for(int i = head[u]; ~i; i = edge[i].next)
		{
			int v = edge[i].v, w = edge[i].w;
			if(dis[v] > dis[u] + w)
			{
				dis[v] = dis[u] + w;
				
				cnt[v] = cnt[u] + 1; //更新v这个点所在路径的边数
				if(cnt[v] >= n)	return true; //边数等于n说明路径中有n+1个点，矛盾
				
				if(!vis[v])	q.push(v), vis[v] = true;
			}
		}
	}
	
	return false;
}

void solve()
{
	memset(head, -1, sizeof head);
	idx = 0;
	
	scanf("%d%d%d", &n, &m, &p);

	int u, v, w;
	while(m--)
	{	
		scanf("%d%d%d", &u, &v, &w);
		add(u, v, w); add(v, u, w);
	}
	
	while(p--)
	{
		scanf("%d%d%d", &u, &v, &w);
		add(u, v, -w);
	}
	
	if(spfa())	puts("YES");
	else	puts("NO");
}

int main()
{
	int t; cin >> t;
	while(t--)	solve();
	return 0;
}

---

观光奶牛

解法：01分数规划 + spfa判负环
设答案为ans

二分答案，设当前二分值为 mid。

设一个环 S 的边权为 t1,t2,t3…，点权为 f1,f2,f3…。
若 mid < ans，即存在一个环S使得 mid < ∑fi / ∑ti，变换一下：∑(fi - mid * ti) > 0

否则，则 mid>ans
每次 check的时候，一条 u 指向 v，边权为 w 的边权变为：f[u] - mid * w。我们只需检查这个图是否存在正环即可。

#include<cstdio>
#include<cmath>
#include<cstring>
#include<iostream>
#include<map>
#include<stack>
#include<queue>
#include<string>
#include<vector>
#include<algorithm>
#define ll long long
#define mem(a) memset(a,0,sizeof(a))
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define inf 0x3f3f3f3f
#define sf(n) scanf("%d", &n)
#define endl '\n'
#define cyes cout<<"yes"<<endl
#define debug(x) cout<<"-----"<<x<<endl

using namespace std;

const int N = 1e3 + 5, M = 5e3 + 5;

int n, m;
int f[N];
struct node {int v, w, next;} edge[M];
int idx, head[N];

void add(int u, int v, int w)
{
	edge[idx] = {v, w, head[u]};
	head[u] = idx++;
}

int cnt[N];
double dis[N];
bool vis[N];

bool check(double mid)
{
	for(int i = 1; i <= n; i++)	cnt[i] = vis[i] = 0;
	
	queue<int> q;
	//改用stack更快
	
	for(int i = 1; i <= n; i++)
	{
		q.push(i); vis[i] = true;
	}
	
	while(!q.empty())
	{
		int u = q.front();
		q.pop(); vis[u] = false;
		
		for(int i = head[u]; ~i; i = edge[i].next)
		{
			int v = edge[i].v, w = edge[i].w;
			
			if(dis[v] < dis[u] + f[u] - mid * w)
			{
				dis[v] = dis[u] + f[u] - mid * w;
				
				cnt[v] = cnt[u] + 1;
				if(cnt[v] >= n)	return true;
				
				if(!vis[v])	q.push(v), vis[v] = true;
			}
		}
	}
	
	return false;
}

int main()
{
	memset(head, -1, sizeof head);
	
	scanf("%d%d", &n, &m);
	for(int i = 1; i <= n; i++)	scanf("%d", &f[i]);
	
	while(m--)
	{
		int u, v, w;
		scanf("%d%d%d", &u, &v, &w);
		add(u, v, w);
	}
	
	double l = 0, r = 1001;
	while(r - l > 1e-4)
	{
		double mid = (l + r) / 2;
		
		if(check(mid))	l = mid;
		else	r = mid;
	}
	
	printf("%.2lf\n", l);
	
	return 0;
}