[hdu2444] 二分图判断与匹配

The Accomodation of Students

Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 6110 Accepted Submission(s): 2778

Problem Description
There are a group of students. Some of them may know each other, while others don’t. For example, A and B know each other, B and C know each other. But this may not imply that A and C know each other.

Now you are given all pairs of students who know each other. Your task is to divide the students into two groups so that any two students in the same group don’t know each other.If this goal can be achieved, then arrange them into double rooms. Remember, only paris appearing in the previous given set can live in the same room, which means only known students can live in the same room.

Calculate the maximum number of pairs that can be arranged into these double rooms.

Input
For each data set:
The first line gives two integers, n and m(1

#include<iostream>
#include<cstring>
#include<cstdio>

using namespace std;
const int N = 2000 + 5;

bool vis[N],col[N];
int link[N];
int tail,n,m;
struct Edge{
    int to;
    int next;
}edge[N*N];
int head[N];
void adde( int u, int v ) {
    edge[++tail].next = head[u];
    head[u] = tail;
    edge[tail].to = v;
}
void init() {
    tail = 0;
    memset(head,0,sizeof(head));
    memset(col,0,sizeof(col));
}
bool color( int u ) {//是否二分图（可以用1，2标记或初始化-1）
    for( int i = head[u]; i; i = edge[i].next ) {
        int v = edge[i].to;
        if( !col[v] ) {
            col[v] = !col[u];
            if( !color(v) ) return false;
        } else if( col[v] == col[u] ) return false;//相同颜色有边
    }
    return true;
}
bool dfs( int u ) {
    for( int i = head[u]; i; i = edge[i].next ){
        int v = edge[i].to;
        if( !vis[v] ) {
            vis[v] = 1;
            if( link[v] == -1 || dfs(link[v]) ) {
                link[v] = u;
                return true;
            }
        }
    }
    return false;
}
int find() {
    int ans = 0;
    memset( link, -1, sizeof(link));
    for( int i = 1; i <= n; i++ ) {
        memset( vis, 0, sizeof(vis));
        if( dfs(i) ) ans++;
    }
    return ans;
}
int main(){
    while( ~scanf("%d%d",&n,&m) ){
        if(n == 1){puts("No");continue;}
        init();
        while( m-- ){
            int u,v;
            scanf("%d%d", &u, &v);
            adde(u,v);adde(v,u);
        }
        col[1] = 1;
        if( !color(1) ){puts("No");continue;}
        printf("%d\n",find()>>1);//无向图的最大匹配要除以2
    }
    return 0;
}