题目描述
题解
同CTSC2008 river
代码
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
using namespace std;
#define N 205
int n,m,x,y,ans;
int tot,point[N],nxt[N*N],v[N*N];
int belong[N],vis[N];
bool d[N][N];
void floyed()
{
for (int k=1;k<=n;++k)
for (int i=1;i<=n;++i)
for (int j=1;j<=n;++j)
d[i][j]|=d[i][k]&d[k][j];
}
void add(int x,int y)
{
++tot; nxt[tot]=point[x]; point[x]=tot; v[tot]=y;
}
bool find(int x,int k)
{
for (int i=point[x];i;i=nxt[i])
if (vis[v[i]]!=k)
{
vis[v[i]]=k;
if (!belong[v[i]]||find(belong[v[i]],k))
{
belong[v[i]]=x;
return 1;
}
}
return 0;
}
int main()
{
scanf("%d%d",&n,&m);
for (int i=1;i<=m;++i)
{
scanf("%d%d",&x,&y);
d[x][y]=1;
}
floyed();
for (int i=1;i<=n;++i)
for (int j=1;j<=n;++j)
{
if (i==j||!d[i][j]) continue;
add(i,j);
}
for (int i=1;i<=n;++i)
if (find(i,i)) ++ans;
printf("%d\n",n-ans);
}