题目链接:点击这里
#include<cstring>
#include<iostream>
#include<queue>
#include<cstdio>
#include<algorithm>
using namespace std;
inline int read(){
int a=0;char x=getchar();
while(x<'0'||x>'9')x=getchar();
while(x>='0'&&x<='9')a=(a<<3)+(a<<1)+x-48,x=getchar();
return a;
}
struct edge{
int to,w,next;
}kkk[300005];
int head[100005],neg[100005],dis[100005],vis[100005],numedge,n,m;
void addedge(int u,int v,int w){
kkk[++numedge].to=v;
kkk[numedge].w=w;
kkk[numedge].next=head[u];
head[u]=numedge;
}
bool spfa(int s){
queue<int>q;
dis[s]=0,vis[s]=1;
q.push(s);
while(!q.empty()){
int u=q.front();
q.pop();
vis[u]=0;
for(int i=head[u];i;i=kkk[i].next){
int v=kkk[i].to;
if(dis[v]<dis[u]+kkk[i].w){
dis[v]=dis[u]+kkk[i].w;
if(!vis[v]){
vis[v]=1,++neg[v];
if(neg[v]>n) return true;
q.push(v);
}
}
}
}
return false;
}
int main()
{
scanf("%d%d",&n,&m);
for(int i=n;i>=1;--i)
addedge(0,i,1);
for(int i=1;i<=m;++i){
int type,u,v;
type=read();
u=read();
v=read();
if(type==1){
//u==v 一样多
addedge(u,v,0);
addedge(v,u,0);
}
else if(type==2){
//shaoyu a少于b 即 u-v<=-1
if(u==v){
printf("-1");
return 0;
}
addedge(u,v,1);
}
else if(type==3){
addedge(v,u,0);
}
else if(type==4){
if(u==v){
printf("-1");
return 0;
}
addedge(v,u,1);
}
else if(type==5){
addedge(u,v,0);
}
}
if(spfa(0)){
printf("-1");
}
else{
long long sum=0;
for(int i=1;i<=n;++i) sum+=dis[i];
printf("%lld",sum);
}
return 0;
}