P2648 make money

https://www.luogu.com.cn/problem/P2648
This question is great , I always thought that the toxic tumor data would not let me pass , It's actually my own low-level mistake .
General train of thought ： Find the longest path , But because the starting point is uncertain , We need to introduce a super source , The distance from this source point to any point is 0.
Another key point of this topic is ： The weight of the point is converted to the edge , I believe everyone will ; however , We all know that this introduced super source is not profitable , But in the code, the value assigned to him is d, Because the city at the other end of our connection is by weight d Of , But we assign the edge 0, So we need to put the other end of the city d Move to the source .

#include <bits/stdc++.h>

using namespace std;
const int inf=0x3f3f3f3f;
const int maxn=5e5+5;
int head[maxn],d,p,c,f,s,cnt,pp[maxn],dis[maxn];
bool vis[maxn],flag;
struct node
{
    
    int to,dis,nxt;
}e[maxn];
void add_edge(int from,int to,int w)
{
    
    e[++cnt].to=to;
    e[cnt].dis=w;
    e[cnt].nxt=head[from];
    head[from]=cnt;
}
queue<int>q;
void spfa()
{
    
    dis[s]=d;
    q.push(s);
    vis[s]=1;
    pp[s]++;
    while(!q.empty())
    {
    
        int u=q.front();q.pop();
        vis[u]=0;
        if(++pp[u]>c)
        {
    
            printf("orz\n");
            flag=1;
            return;
        }
        for(int i=head[u];~i;i=e[i].nxt)
        {
    
            int v=e[i].to;
            if(dis[v]<dis[u]+e[i].dis)
            {
    
                dis[v]=dis[u]+e[i].dis;
                if(!vis[v])
                {
    
                    vis[v]=1;
                    q.push(v);
                }
            }
        }
    }
}
int main()
{
    
    scanf("%d%d%d%d",&d,&p,&c,&f);
    s=c+1;c=c+1;
    head[0]=-1;
    for(int i=1;i<=c;i++)
        head[i]=-1,dis[i]=-inf;
    for(int i=1;i<=p;i++)
    {
    
        int u,v;
        scanf("%d%d",&u,&v);
        add_edge(u,v,d);
    }
    for(int i=1;i<=f;i++)
    {
    
        int u,v,w;scanf("%d%d%d",&u,&v,&w);
        add_edge(u,v,d-w);
    }
    for(int i=1;i<=c;i++)
        add_edge(s,i,0);
    spfa();
    if(flag)
        return 0;
    int tmp=0;
    for(int i=1;i<=c;i++)
    {
    
        tmp=max(tmp,dis[i]);
    }
    cout<<tmp<<endl;
    return 0;
}