悬6关，60ptsWA，tarjan缩点+toposort Orz

# include<iostream>
# include<algorithm>
# include<cmath>
# include<stack>
# include<queue>
# define endl "\n"
# define int long long
using namespace std;
const int maxn=500001, maxm=500001, INF=0x7fffffff;
struct Node{
    int u, v, w, next;
}edge[maxm], new_edge[maxm];
int n, m, a[maxn], cnt=0, new_cnt=0, head[maxn], new_head[maxn]; 
int dfn[maxn], low[maxn], vis[maxn], color[maxn], tot[maxn], tim=0;
stack<int> s; queue<int> q;
int in_new_edge[maxn], dp[maxn], in[maxn], ans=0;
void add(int u, int v, int w) {
    cnt++;
    edge[cnt].u=u;
    edge[cnt].v=v;
    edge[cnt].w=w;
    edge[cnt].next=head[u];
    head[u]=cnt;
}
void new_add(int u, int v, int w) {
    new_cnt++;
    new_edge[new_cnt].u=u;
    new_edge[new_cnt].v=v;
    new_edge[new_cnt].w=w;
    new_edge[new_cnt].next=new_head[u];
    new_head[u]=new_cnt;
    in[v]++;
}
void tarjan(int u) {
    tim++; dfn[u]=low[u]=tim;
    s.push(u); vis[u]=true;
    for(int i=head[u]; i; i=edge[i].next) {
        int v=edge[i].v;
        if(!dfn[v]) {
            tarjan(v);
            low[u]=min(low[v], low[u]);
        } else if(vis[v]) low[u]=min(low[u], dfn[v]);
    }
    if(dfn[u]==low[u]) { 
        while(true) {
            int t=s.top();
            s.pop();
            vis[t]=0;
            color[t]=u;
            tot[u]++;
            if(u==t) break;
        }
    }
}
signed main() {
    cin >> n >> m;
    for(int i=1; i<=m; i++) {
        int x, a, b; cin >> x >> a >> b; 
        if(x==1) add(a, b, 0), add(b, a, 0);
        if(x==2) add(a, b, 1);
        if(x==3) add(b, a, 0);
        if(x==4) add(b, a, 1);
        if(x==5) add(a, b, 0);
    }
    
    for(int i=1; i<=n; i++)
        color[i]=i;
    for(int i=1; i<=n; i++)
        if(!dfn[i])
            tarjan(i);
            
    for(int i=1; i<=m; i++) {
        int u=color[edge[i].u], v=color[edge[i].v];
        if(u==v) cout << edge[i].w << endl;
        if(u!=v) new_add(u, v, edge[i].w);
    }
    for(int i=1; i<=n; i++) in_new_edge[color[i]]=true; 
    for(int i=1; i<=n; i++) dp[i]=-1;
    for(int i=1; i<=n; i++) vis[i]=false;
    for(int i=1; i<=n; i++) {
        if(in[i]==0 && in_new_edge[i]) {
            q.push(i);
            dp[i]=1;
        }
    } 
    
    while(!q.empty()) {
        int u=q.front();
        q.pop();
        for(int i=new_head[u]; i; i=new_edge[i].next) {
            int v=new_edge[i].v, w=new_edge[i].w;
            dp[v]=max(dp[v], dp[u]+w);
            in[v]--;
            if(in[v]==0) q.push(v);
        }
    }
    for(int i=1; i<=n; i++)
		ans+=dp[color[i]];
	cout << ans << endl;
    return 0;
}