HDU 1281 棋盘游戏 二分图

在一个N*M大小的棋盘中，有K个空位置，（1）在这些空位置上最多能放多少的“车”（一行或一列最多一个）。（2）空位置中，有的位置若不放“车”，就无法保证放尽量多的“车”，这样的格子被称做重要点，求重要点的个数

可以看成行与列的二分匹配问题，因为每行每列至多只能放一个棋子

#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#define rep(i, j, k) for(int i = j; i <= k; i++)

using namespace std;

int n, m, k, edge[109][109], link[109], done[109], ans, ti = 0;
int answer, pp[109];

bool dfs (int x)
{
    rep (i, 1, m)
        if (edge[x][i] && !done[i])
        {
            done[i] = 1;
            if (link[i] == -1 || dfs (link[i]))
            {
                link[i] = x;
                return 1;
            }
        }
    return 0;
}

int solve ()
{
    int ret = 0;
    memset (link, -1, sizeof (link));
    rep (i, 1, n)
    {
        memset (done, 0, sizeof (done));
        if (dfs (i))
            ret++;
    }
        //rep (i, 1, n) printf ("link %d %d\n", i, link[i]);
    return ret;
}

int main ()
{
    while (scanf ("%d%d%d", &n, &m, &k) == 3)
    {
        ti++;
        memset (edge, 0, sizeof (edge));
        rep (i, 1, k)
        {
            int x0, y0;
            scanf ("%d%d", &x0, &y0);
            edge[x0][y0] = 1;
        }
        ans = solve ();
        memset (pp, 0, sizeof (pp));
        rep (i, 1, m)
            if (link[i] != -1)
                pp[link[i]] = i;
        //rep (i, 1, n) printf ("p %d %d\n", i, pp[i]);
        answer = 0;
        rep (i, 1, n)
            if (pp[i])
        {
            edge[i][pp[i]] = 0;
            if (solve () <  ans)
                answer++;
            //printf ("test %d %d\n", i, solve ());
            edge[i][pp[i]] = 1;
        }
        printf ("Board %d have %d important blanks for %d chessmen.\n", ti, answer, ans);
    }
    return 0;
}