ACM -二分图题目小结(更新中)

 1 #include<iostream>
 2 #include<cstring>
 3 #include<cmath>
 4 #include<algorithm>
 5 #include<cstdlib>
 6 #include<cstdio>
 7 #include<vector>
 8 #define MAXN 1005
 9 using namespace std;
10 bool gl[MAXN][MAXN];
11 int link[MAXN];
12 int n;
13 bool vis[MAXN];
14 
15 bool match(int x)
16 {
17     for(int i=1; i<=n; ++i)
18         if(gl[x][i]&&!vis[i])
19         {
20             vis[i]=true;
21             if(link[i]==-1||match(link[i]))
22             {
23                 link[i]=x;
24                 return true;
25             }
26         }
27     return false;
28 }
29 int main()
30 {
31     int T;
32     scanf("%d",&T);
33     while(T--)
34     {  int m;
35         scanf("%d%d",&n,&m);
36         memset(gl,0,sizeof(gl));
37         for(int i=0;i<m;++i)
38         {
39             int x,y;
40             scanf("%d%d",&x,&y);
41             gl[x][y]=true;
42         }
43         int res=0;
44         memset(link,-1,sizeof(link));
45         for(int i=1; i<=n; ++i)
46         {
47             memset(vis,0,sizeof(vis));
48             if(match(i)) res++;
49         }
50         printf("%d\n",n-res);
51     }
52     return 0;
53 }

#include<iostream>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<cstdlib>
#include<cstdio>
#include<vector>
#define MAXN 1505
using namespace std;
vector<int> gl[MAXN];
int link[MAXN];
int n;
bool vis[MAXN];
void init()
{
    memset(link,-1,sizeof(link));
    memset(vis,0,sizeof(vis));
}

bool match(int x)
{
    for(int i=0; i<gl[x].size(); ++i)
    {
        int &u=gl[x][i];
        if(!vis[u])
        {
            vis[u]=true;
            if(link[u]==-1||match(link[u]))
            {
                link[u]=x;
                return true;
            }
        }
    }

    return false;
}
int main()
{
    while(scanf("%d",&n)!=EOF)
    {
        memset(gl,0,sizeof(gl));
        for(int i=0; i<n; ++i)  gl[i].clear();
        for(int i=0; i<n; ++i)
        {
            int now,t,cn;
            scanf("%d:",&now);
            scanf("(%d)",&cn);
            while(cn--)
            {
                scanf("%d",&t);
                gl[now].push_back(t);
                gl[t].push_back(now);
            }
        }
        init();
        int res=0;
        for(int i=0; i<n; ++i)
        {
            memset(vis,0,sizeof(vis));
            if(match(i)) res++;
        }
        printf("%d\n",res/2);
    }
    return 0;
}

#include<iostream>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<cstdlib>
#include<cstdio>
#include<vector>
#define MAXN 1005
using namespace std;
bool gl[MAXN][MAXN];
int link[MAXN];
int n,m;
bool vis[MAXN];

bool match(int x)
{
    for(int i=1; i<=m; ++i)
        if(gl[x][i]&&!vis[i])
        {
            vis[i]=true;
            if(link[i]==-1||match(link[i]))
            {
                link[i]=x;
                return true;
            }
        }
    return false;
}
int main()
{
    int t;
    while(scanf("%d",&n)&&n)
    {
        scanf("%d%d",&m,&t);
        memset(gl,0,sizeof(gl));
        for(int i=0; i<t; ++i)
        {
            int x,y,z;
            scanf("%d%d%d",&z,&x,&y);
            gl[x][y]=true;
        }
        int res=0;
        memset(link,-1,sizeof(link));
        for(int i=1; i<=n; ++i)
        {
            memset(vis,0,sizeof(vis));
            if(match(i)) res++;
        }
        printf("%d\n",res);
    }
    return 0;
}

 1 #include<iostream>
 2 #include<cstring>
 3 #include<cmath>
 4 #include<algorithm>
 5 #include<cstdlib>
 6 #include<cstdio>
 7 #include<vector>
 8 #define MAXN 1005
 9 using namespace std;
10 bool gl[MAXN][MAXN];
11 int link[MAXN];
12 int n;
13 bool vis[MAXN];
14 void init()
15 {
16     memset(link,-1,sizeof(link));
17     memset(vis,0,sizeof(vis));
18 }
19 
20 bool match(int x)
21 {
22     for(int i=0; i<n; ++i)
23         if(gl[x][i]&&!vis[i])
24         {
25             vis[i]=true;
26             if(link[i]==-1||match(link[i]))
27             {
28                 link[i]=x;
29                 return true;
30             }
31         }
32     return false;
33 }
34 int main()
35 {
36     while(scanf("%d",&n)!=EOF)
37     {
38         memset(gl,0,sizeof(gl));
39         for(int i=0; i<n; ++i)
40         {
41             int now,t,cn;
42             scanf("%d: ",&now);
43             scanf("(%d) ",&cn);
44             while(cn--)
45             {
46                 scanf("%d",&t);
47                 gl[now][t]=true;
48             }
49         }
50         init();
51         int res=0;
52         for(int i=0; i<n; ++i)
53         {
54             memset(vis,0,sizeof(vis));
55             if(match(i)) res++;
56         }
57         printf("%d\n",(n*2-res)/2);
58     }
59     return 0;
60 }