思路:利用vector存储图中点的关系,利用入度为0的点开始dfs遍历,用到了记忆化否则会超时
#include <iostream>
#include <vector>
using namespace std;
const int N = 100010, M = 200010;
int ru[N], chu[N], ans;
vector<int> node[M];
int f[N];
int n, m;
int dfs(int u)
{
if(f[u]) return f[u];
int step = 0;
if(!chu[u]) return 1;
for(int i = 0; i < node[u].size(); i++)
{
step += dfs(node[u][i]);
}
f[u] = step;
return step;
}
int main()
{
scanf("%d%d", &n, &m);
while(m--)
{
int u, v;
scanf("%d%d", &u, &v);
node[u].push_back(v);
chu[u]++;
ru[v]++;
}
for(int i = 1; i <= n; i++)
{
if(!ru[i] && !chu[i]) continue;
if(!ru[i])
{
ans += dfs(i);
}
}
cout << ans << endl;
return 0;
}