显示代码纯文本
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<iostream>
#include<vector>
using namespace std;
const int maxn=100010;
int n,m,tr[maxn],ans[maxn],book[maxn],s,sum=0;
bool vis[maxn];
vector<int> node[maxn];
inline void AddEdge(int from,int to)
{
node[from].push_back(to);
++book[to];
}
int dfs(int x)
{
if(node[x].empty()) return 1;
if(vis[x]) return ans[x];
int ss=0;
for(int i=0;i<node[x].size();++i)
{
ss+=dfs(node[x][i]);
}
vis[x]=1;
ans[x]=ss;
return ss;
}
int main()
{
freopen("chain_2016.in","r",stdin);
freopen("chain_2016.out","w",stdout);
scanf("%d%d",&n,&m);
for(int i=0,u,v;i<m;++i)
{
scanf("%d%d",&u,&v);
AddEdge(u,v);
}
for(int i=1;i<=n;++i) if(!book[i] && !node[i].empty())
{
sum+=dfs(i);
}
printf("%d",sum);
return 0;
}