CodeForces 1547G :How Many Paths? DFS + 拓扑怕排序

传送门

题意

分析

首先我们用$dfs$判断每一个点的可达性，然后用拓扑排序去判断是否存在环，同时对路径计数
路径记录的范围很大，可以手动控制到2以内

代码

#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 4e5 + 10,M = N * 2;
const ll mod = 1000000007;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a) {
    char c = getchar(); T x = 0, f = 1; while (!isdigit(c)) {if (c == '-')f = -1; c = getchar();}
    while (isdigit(c)) {x = (x << 1) + (x << 3) + c - '0'; c = getchar();} a = f * x;
}
int gcd(int a, int b) {return (b > 0) ? gcd(b, a % b) : a;}
int h[N],e[M],ne[M],idx;
int ans[N];
bool st[N],cul[N];
int num[N],d[N];
int n,m;

void add(int x,int y){
    ne[idx] = h[x],e[idx] = y,h[x] = idx++;
}

void init(){
    for(int i = 0;i <= n;i++){
        h[i] = -1;
        ans[i] = 0;
        st[i] = cul[i] = false;
        num[i] = d[i] = 0;
    }
    idx = 0;
}

void bfs(){
    queue<int> q;
    q.push(1);
    while(q.size()){
        int t = q.front();
        q.pop();
        if(st[t]) continue;
        st[t] = true;
        ans[t] = 1;
        for(int i = h[t];~i;i = ne[i]) q.push(e[i]);
    }
}

void topsort(){
    for(int i = 1;i <= n;i++)
        if(st[i]) for(int j = h[i];~j;j = ne[j]) d[e[j]]++;
    queue<int> q;
    for(int i = 1;i <= n;i++) if(!d[i] && st[i]) q.push(i),num[i] = 1;
    while(q.size()){
        int t = q.front();
        q.pop();
        cul[t] = true;
        for(int i = h[t];~i;i = ne[i]){
            int j = e[i];
            d[j]--;
            num[j] += num[t];
            if(num[j] > 2) num[j] = 2;
            if(!d[j]) q.push(j);
        }
    }
    if(!cul[1]){
        for(int i = 1;i <= n;i++) if(st[i]) ans[i] = -1;
        return;
    }
    for(int i = 1;i <= n;i++){
        if(st[i]){
            if(!cul[i]) ans[i] = -1;
            else if(num[i] >= 2) ans[i] = 2;
        }
    }
}

int main() {
    int T;
    read(T);
    while(T--){
        read(n),read(m);
        init();
        for(int i = 1;i <= m;i++){
            int x,y;
            read(x),read(y);
            add(x,y);
        }
        bfs();
        topsort();
        for(int i = 1;i <= n;i++) printf("%d ",ans[i]);
        puts("");
    }
    return 0;
}