codeforces 999E Reachability from the Capital

http://www.elijahqi.win/archives/3824
tarjan缩点之后找出所有入度为0的点即可

#include<bits/stdc++.h>
using namespace std;
inline char gc(){
    static char now[1<<16],*S,*T;
    if (T==S){T=(S=now)+fread(now,1,1<<16,stdin);if (T==S) return EOF;}
    return *S++;
}
inline int read(){
    int x=0,f=1;char ch=gc();
    while(!isdigit(ch)) {if (ch=='-') f=-1;ch=gc();}
    while(isdigit(ch)) x=x*10+ch-'0',ch=gc();
    return x*f;
}
const int N=5500;
struct node{
    int x,y,next;
}data[N<<1];
int dfn[N],low[N],h[N],in[N],n,m,s,b[N],q[N],top,num,S;bool stackf[N];
inline void insert1(int x,int y){
    data[++num].y=y;data[num].next=h[x];h[x]=num;data[num].x=x;
}
inline void tarjan(int x){
    dfn[x]=low[x]=++num;q[++top]=x;stackf[x]=1;
    for (int i=h[x];i;i=data[i].next){
        int y=data[i].y;
        if (!dfn[y]) tarjan(y),low[x]=min(low[x],low[y]);
        else if(stackf[y]) low[x]=min(low[x],dfn[y]);
    }
    if (dfn[x]==low[x]){
        ++s;int y;
        do{
            y=q[top--];stackf[y]=0;b[y]=s;
        }while(y!=x);
    }
}
int main(){
//  freopen("e.in","r",stdin);
    n=read();m=read();S=read();
    for (int i=1;i<=m;++i){
        int x=read(),y=read();
        insert1(x,y);
    }int nm=num;num=0;
    for (int i=1;i<=n;++i) if (!dfn[i]) tarjan(i);num=0;
    for (int i=1;i<=nm;++i){
        int x=data[i].x,y=data[i].y;
        if (b[x]==b[y]) continue;
        insert1(b[x],b[y]);++in[b[y]];
    }int cnt=0;

    for (int i=1;i<=s;++i) if (!in[i])  if (i!=b[S]) ++cnt;
    printf("%d\n",cnt);
    return 0;
}