棋盘游戏 HDU - 1281

每一行每一列当成一个点，找重要点的时候每个点判断一遍

#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 mapr[maxn],mapc[maxn];
int used[maxn],match[maxn],g[maxn][maxn];
int n,m,k;

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

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

int main()
{
//    freopen("in.txt","r",stdin);
    int cas=1;
	while(~scanf("%d%d%d",&n,&m,&k)){
        memset(g,0,sizeof g);
        memset(match,0,sizeof match);
        while(k--){
            int a,b;
            scanf("%d%d",&a,&b);
            g[a][b]=1;
        }
        int ans=Maxmatch(),point=0;
        for(int i=1;i<=n;i++){
            for(int j=1;j<=m;j++){
                if(g[i][j]==1){
                    g[i][j]=0;
                    memset(match,0,sizeof match);
                    if(Maxmatch()!=ans)point++;
                    g[i][j]=1;
                }
            }
        }
        printf("Board %d have %d important blanks for %d chessmen.\n",cas++,point,ans);
	}
	return 0;
}