先用floyd求出传递闭包.答案就是总点数减去最大匹配.似乎就是可共用节点的最小路径覆盖.
/* I will wait for you */
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<ctime>
#include<algorithm>
#include<iostream>
#include<fstream>
#include<vector>
#include<queue>
#include<deque>
#include<set>
#include<map>
#include<string>
#define make make_pair
#define fi first
#define se second
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int,int> PII;
const int maxn=110;
const int maxm=1010;
const int maxs=26;
const int INF=1<<29;
const int P=1000000007;
const double error=1e-9;
int n,m,ans=0,ma[maxn][maxn],vis[maxn],fa[maxn];
int allow(int u)
{
int flag=0;
for(int i=1;!flag&&i<=n;i++) if(ma[u][i]&&!vis[i])
{
vis[i]=1;
if(!fa[i]||allow(fa[i])) fa[i]=u,flag=1;
}
return flag;
}
int main()
{
scanf("%d%d",&n,&m);
for(int i=1,u,v;i<=m;i++) scanf("%d%d",&u,&v),ma[u][v]=1;
for(int i=1;i<=n;i++) for(int s=1;s<=n;s++) for(int t=1;t<=n;t++)
ma[s][t]|=(ma[s][i]&ma[i][t]);
for(int i=1;i<=n;i++)
{
memset(vis,0,sizeof(vis));
if(allow(i)) ans++;
}
printf("%d\n",ans);
return 0;
}