tarjan+spfa 求最长路

要是给 spfa 里面 dis[s] 的初值附为 sum[s] 就会只对前三个点

#include<iostream>
#include<algorithm>
#include<cstring>
#include<vector>
#include<queue>
#include<stack>
#define int long long
using namespace std;
const int N=2e5+10;
struct node{int v,w,k;};
int n,m,cnt,tot,s,ans;
int h[N],dfn[N],low[N],vis[N],col[N],sum[N],dis[N];
vector<node> e[N];
vector<pair<int,int> > k[N];
stack<int> sta;
queue<int> q;
inline void tarjan(int u)
{
	dfn[u]=low[u]=++cnt;
	vis[u]=1;
	sta.push(u);
	for (register int i=0;i<e[u].size();i++)
	{
		int v=e[u][i].v;
		if (!dfn[v]) tarjan(v),low[u]=min(low[v],low[u]);
		else if (vis[v]) low[u]=min(dfn[v],low[u]);
	}
	if (low[u]==dfn[u])
	{
		tot++;
		int v=sta.top();
		sta.pop();
		vis[v]=0;
		col[v]=tot;
		while (u!=v)
		{
			v=sta.top();
			sta.pop();
			vis[v]=0;
			col[v]=tot;
		}
	}
	return ;
}
inline void SPFA(int s)
{
	memset(vis,0,sizeof vis );
	memset(dis,-0x3f,sizeof dis );
	q.push(s);
	vis[s]=true;
	dis[s]=0;
	while (!q.empty())
	{
		int u=q.front();
		q.pop();
		vis[u]=0;
		for (register int i=0;i<k[u].size();i++)
		{
			int v=k[u][i].first,w=k[u][i].second;
			if (dis[v]<dis[u]+sum[u]+w)
			{
				dis[v]=dis[u]+sum[u]+w;
				if (!vis[v]) q.push(v),vis[v]=1;
			}
		}
	}
	return ;
}
signed main()
{
	cin>>n>>m;
	for (register int i=1;i<=m;i++)
	{
		int u,v,w;
		double p;
		cin>>u>>v>>w>>p;
		e[u].push_back({v,w,p*10});
	}
	for (register int i=1;i<=n;i++)
		if (!dfn[i])
			tarjan(i);
	for (register int u=1;u<=n;u++)
		for (register int j=0;j<e[u].size();j++)
		{
			int v=e[u][j].v,w=e[u][j].w,p=e[u][j].k;
			if (col[u]==col[v])
				while (w)
					sum[col[u]]+=w,w=w*p/10;
			else
				k[col[u]].push_back({col[v],w});
		}
	cin>>s;
	s=col[s];
	SPFA(s);
	for (register int i=1;i<=tot;i++)
		ans=max(ans,dis[i]);
	cout<<ans<<endl;
	return 0;
}