HDU 1281 棋盘游戏

HDU 1281 二分图

题意 给你几个格子 问你像中国象棋一样放车能放几个

根据lyd说的0要素和1要素 我们把行和列直接建边 因为放了一个 就行和列都饱和 也就是1元素

然后行的点在左边 列的点在右边 也就是0元素

然后要检查一个非重要点 只要枚举这个点不建边 看是否最大匹配数少于所有边的最大匹配数 如果少于 则是非重要点

/*
    if you can't see the repay
    Why not just work step by step
    rubbish is relaxed
    to ljq
*/
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
using namespace std;

#define dbg(x) cout<<#x<<" = "<< (x)<< endl
#define dbg2(x1,x2) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<endl
#define dbg3(x1,x2,x3) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<" "<<#x3<<" = "<<x3<<endl
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))

typedef pair<int,int> pll;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int _inf = 0xc0c0c0c0;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll _INF = 0xc0c0c0c0c0c0c0c0;
const ll mod =  (int)1e9+7;

ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll ksm(ll a,ll b,ll mod){int ans=1;while(b){if(b&1) ans=(ans*a)%mod;a=(a*a)%mod;b>>=1;}return ans;}
ll inv2(ll a,ll mod){return ksm(a,mod-2,mod);}
vector<pll > vt;
const int MAX_N = 225;
bool use[MAX_N];
int p[MAX_N],eid,girl[MAX_N];
void init()
{
    memset(girl,0,sizeof(girl));
    memset(p,-1,sizeof(p));
    eid = 0;
}
struct edge
{
    int v,next;
}e[MAX_N];
void add(int u,int v)
{
    e[eid].v = v;
    e[eid].next = p[u];
    p[u] = eid++;
}
bool dfs(int u)
{
    for(int i = p[u];i+1;i=e[i].next)
    {
        int to = e[i].v;
        if(!use[to])
        {
            use[to] = true;
            if(!girl[to]||dfs(girl[to]))
            {
                girl[to] = u;
                return true;
            }
        }
    }
    return false;
}
int main()
{
    //ios::sync_with_stdio(false);
    //freopen("a.txt","r",stdin);
    //freopen("b.txt","w",stdout);
    int n,m,k,a,b,ans,ans_,ANS,Case = 0;
    while(scanf("%d%d%d",&n,&m,&k)==3)
    {
        vector<pll> tmp;
        swap(vt,tmp);
        ans = ans_ = 0;
        for(int i = 1;i<=k;++i)
        {
            scanf("%d%d",&a,&b);
            vt.push_back(pll(a,b));
        }
        init();
        for(int i = 0;i<k;++i)
        {
            add(vt[i].first,vt[i].second);
        }
        for(int i = 1;i<=n;++i)
        {
            memset(use,false,sizeof(use));
            if(dfs(i)) ans++;
        }
        for(int i = 0;i<k;++i)
        {
            init();
            ANS = 0;
            for(int j = 0;j<k;j++)
            {
                if(j==i) continue;
                //dbg2(vt[j].first,vt[j].second);
                add(vt[j].first,vt[j].second);
            }
            for(int i = 1;i<=n;++i)
            {
                memset(use,false,sizeof(use));
                if(dfs(i)) ANS++;
            }
            //dbg2(ANS,ans);
            if(ANS<ans) ans_++;
        }
        printf("Board %d have %d important blanks for %d chessmen.\n",++Case,ans_,ans);
    }
    //fclose(stdin);
    //fclose(stdout);
    //cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
    return 0;
}