HDU 1054 Strategic Game

#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<iostream>
#include<vector>
#include<queue>
#include<cmath>
using namespace std;
#define INF 0x3fffffff
#define maxn 1705
int color[maxn];/// 1白色 2 黑色
int n, P[maxn], k, Head[maxn];
bool vis[maxn];
struct EdgeNode
{
    int e, next;
} edge[maxn*10];

void AddEdge(int s, int e)
{
    edge[k].next = Head[s];
    edge[k].e = e;
    Head[s] = k ++;
}

void DFS(int u,int Color)
{
    color[u] = Color;

    for(int i=Head[u]; i != -1; i=edge[i].next)
    {
        int v = edge[i].e;
        if(color[v] == 0)
            DFS(v, -Color);
    }
}

bool Find(int u)
{
    for(int i=Head[u]; i!=-1; i=edge[i].next)
    {
        int v = edge[i].e;
        if(!vis[v] )
        {
            vis[v] = true;
            if(P[v] == -1 || Find(P[v]) )
            {
                P[v] = u;
                return true;
            }
        }
    }
    return false;
}


int solve()
{
    int ans = 0;
    memset(P, -1, sizeof(P));
    memset(color, 0, sizeof(color));
    DFS(0, 1);///对图进行黑白染色
    for(int i=0; i<n; i++)
    {
        memset(vis, false, sizeof(vis));
        if(color[i] == 1 && Find(i))
            ans ++;
    }
    return ans;
}

int main()
{
    while( scanf("%d", &n) != EOF)
    {
        int a, b, m;
        k = 0;
        memset(Head, -1, sizeof(Head));

        for(int i=0; i<n; i++)
        {
            scanf("%d:(%d)", &a, &m);
            while(m --)
            {
                scanf("%d", &b);
                AddEdge(a, b);
                AddEdge(b, a);
            }
        }
        printf("%d\n", solve() );
    }
    return 0;
}