The Accomodation of Students HDU - 2444（二分图判断+匈牙利）

染色法判断二分图：对一个点染色为1，对其全部有连线的邻接点染色为与其不用的颜色0，再对所有邻接点的邻接点染色为1，以此类推，当发现一个点i，其邻接点中有一个点的颜色与点i相同则非二分图

#include<iostream>
#include<cstring>
#include<string>
#include<cstdio>
#include<vector>
#include<queue>
#include<cmath>
#include<stack>
#include<set>
#include<ctime>
#include<algorithm>
#define eps 1e-14
#define pi acos(-1)
#define ll long long
#define RD T*(rand()*2-RAND_MAX)
#define Drand (long double)rand()/RAND_MAX
#define INF 0x3f3f3f3f

using namespace std;
const int maxn=500;
const int mod=1e4+7;

int n,m;
int r[maxn];
int vis[maxn],used[maxn];
int g[maxn][maxn];
int col[maxn];


void init()
{
    memset(r,0,sizeof r);
    memset(vis,0,sizeof vis);
    memset(g,0,sizeof g);
    memset(col,0,sizeof col);
}


int dfs(int x)
{
    for(int i=1;i<=n;i++){
        if(used[i]==0 && g[x][i]==1){
            used[i]=1;
            if(r[i]==0 ||dfs(r[i])==1){
                r[i]=x;
                return 1;
            }
        }
    }
    return 0;
}

int Maxmatch()
{
    int ans=0;
    for(int i=1;i<=n;i++){
        memset(used,0,sizeof used);
        if(dfs(i))ans++;
    }
    return ans;
}

int bfs(int x)
{
    memset(col,-1,sizeof col);
    queue<int>q;
    q.push(x);
    col[x]=1;
    while(!q.empty()){
        int u=q.front();
        q.pop();
        for(int i=1;i<=n;i++){
            if(col[i]==-1 && g[u][i]==1){
                q.push(i);
                col[i]=!col[u];
            }
            if(g[u][i]==1 && col[i]==col[u])return 1;
        }
    }
    return 0;
}

int main()
{
//    freopen("in.txt","r",stdin);
    while(~scanf("%d%d",&n,&m)){
        init();
        int flag=0;
        for(int i=1;i<=m;i++){
            int a,b;
            scanf("%d%d",&a,&b);
            g[a][b]=1;
        }
        for(int i=1;i<=n;i++){
            if(bfs(i)==1)flag=1;
        }
        if(flag){
            cout<<"No"<<endl;
            continue;
        }
        cout<<Maxmatch()<<endl;

    }
    return 0;
}