1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
|
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
#define maxn 555
int n, k, a, b;
bool map[maxn][maxn],v[maxn];
int link[maxn];
bool dfs(int x)
{
int i;
for(i = 1; i <= n; i++){
if(!v[i] && map[x][i]){
v[i] = 1;
if(link[i]==0 || dfs(link[i]))
{
link[i] = x;
return true;
}
}
}
return false;
}
int main()
{
memset(link,0,sizeof(link));
memset(map,0,sizeof(map));
scanf("%d%d", &n, &k);
for (int i = 0; i < k; ++i)
{
scanf("%d%d", &a, &b);
map[a][b]=1;
}
int ans=0;
for (int i = 1; i <= n; ++i)
{
memset(v,0,sizeof(v));
if(dfs(i)){
ans++;
}
}
printf("%dn", ans);
return 0;
}
|