50pts求条，悬赏4个关注

#include<bits/stdc++.h>
using namespace std;
const int N=1E6+5;
#define int long long
struct Edge{
	int x,y;
};
vector<Edge> G[N];
int dis[N],in[N];
bool vis[N];
int n,m,s;
bool spfa(int x){
	queue<int> q;
	memset(dis,0x7f,sizeof(dis));
	q.push(x);
    ++in[x];
	dis[x]=0,vis[x]=1;
	while(!q.empty()){
		int tmp=q.front();
		q.pop();
		vis[tmp]=0;
		for(auto [v,w]:G[tmp]){
			if(dis[v]>dis[tmp]+w){
				dis[v]=dis[tmp]+w;
				if(!vis[v]){
                    ++in[v];
                    if(in[v]>=n+1){
                        return 0;
                    }
					q.push(v);
					vis[v]=1;
				}
			}
		}
	}
	return 1;
} 
void work(){
	int u,v,w,op;
	cin>>n>>m;
	while(m--){
		cin>>op;
		if(op==1){
			cin>>u>>v;
			G[u].push_back({v,0});
			G[v].push_back({u,0});
		}else if(op==2){
			cin>>u>>v;
			G[v].push_back({u,-1});
		}else if(op==3){
			cin>>u>>v;
			G[u].push_back({v,0});
		}else if(op==4){
			cin>>u>>v;
			G[u].push_back({v,-1});
		}else{
			cin>>u>>v;
			G[v].push_back({u,0});
		}
		
	}for(int i=1;i<=n;++i) G[0].push_back({i,0});
    if(!spfa(0)) cout<<-1<<endl;
	else{
		int minn=0;
		for(int i=1;i<=n;++i){
            minn=min(minn,dis[i]);
		}
		int ans=0;
        for(int i=1;i<=n;++i){
            ans+=dis[i]-minn+1;
		}cout<<ans<<endl;
	}
	return ;
} 
signed main(){
    ios::sync_with_stdio(false);cin.tie(0),cout.tie(0);
	work();
    return 0;
}