Going from u to v or from v to u? 【POJ - 2762】【Tarjan + 拓扑】

题目链接

---

  这道题，很容易想到一个环自然就可以到达环内各点，所以不影响，然后呢，在考虑接下来有向图两点同时存在x到不了y与y到不了x的情况，就一定是两点可以同时作为拓扑排序的起点，并且是同时作为起点，两点相互没有边关系了，这里就可以用拓扑来解决这个问题。

1
5 6
1 2
2 3
1 4
3 4
3 5
4 5
Yes

#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <limits>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#define lowbit(x) ( x&(-x) )
#define pi 3.141592653589793
#define e 2.718281828459045
#define INF 0x3f3f3f3f
#define efs 1e-6
#define HalF (l + r)>>1
#define lsn rt<<1
#define rsn rt<<1|1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr
#define myself rt, l, r
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
const int maxN = 1e3 + 7, maxE = 2e4 + 7;
int N, M, cnt, head[maxN], du[maxN];
struct Eddge
{
    int nex, to;
    Eddge(int a=-1, int b=0):nex(a), to(b) {}
}edge[maxE];
inline void addEddge(int u, int v)
{
    edge[cnt] = Eddge(head[u], v);
    head[u] = cnt++;
}
int dfn[maxN], low[maxN], tot, Belong[maxN], Bcnt, Stap[maxN], Stop;
bool instack[maxN];
void Tarjan(int u)
{
    dfn[u] = low[u] = ++tot;
    Stap[++Stop] = u;
    instack[u] = true;
    for(int i=head[u], v; ~i; i=edge[i].nex)
    {
        v = edge[i].to;
        if(!dfn[v])
        {
            Tarjan(v);
            low[u] =min(low[u], low[v]);
        }
        else if(instack[v] && dfn[v] < low[u]) low[u] =  dfn[v];
    }
    int v;
    if(dfn[u] == low[u])
    {
        Bcnt++;
        do
        {
            v = Stap[Stop--];
            Belong[v] = Bcnt;
            instack[v] = false;
        }while(u != v);
    }
}
int top[maxN], _Index;
struct Path
{
    int nex, to;
    Path(int a=-1, int b=0):nex(a), to(b) {}
}path[maxE];
inline void addPath(int u, int v)
{
    path[_Index] = Path(top[u], v);
    top[u] = _Index++;
}
queue<int> Q;
inline bool tuopu()
{
    while(!Q.empty()) Q.pop();
    int siz = 0;
    for(int i=1; i<=Bcnt; i++) if(!du[i]) { Q.push(i); siz++; }
    if(siz > 1) return false;
    while(!Q.empty())
    {
        int u = Q.front(); Q.pop(); siz--;
        for(int i=top[u], v; ~i; i=path[i].nex)
        {
            v = path[i].to;
            if(--du[v] == 0)
            {
                Q.push(v);
                siz++;
            }
        }
        if(siz > 1) return false;
    }
    return true;
}
inline void init()
{
    cnt = Stop = tot = Bcnt = _Index = 0;
    for(int i=1; i<=N; i++)
    {
        top[i] = head[i] = -1;
        dfn[i] = du[i] = 0;
        instack[i] = false;
    }
}
int main()
{
    int Cas; scanf("%d", &Cas);
    while(Cas--)
    {
        scanf("%d%d", &N, &M);
        init();
        for(int i=1, u, v; i<=M; i++)
        {
            scanf("%d%d", &u, &v);
            addEddge(u, v);
        }
        for(int i=1; i<=N; i++) if(!dfn[i]) Tarjan(i);
        for(int u=1; u<=N; u++)
        {
            for(int i=head[u], v; ~i; i=edge[i].nex)
            {
                v = edge[i].to;
                if(Belong[u] == Belong[v]) continue;
                addPath(Belong[u], Belong[v]);
                du[Belong[v]]++;
            }
        }
        printf(tuopu() ? "Yes\n" : "No\n");
    }
    return 0;
}