题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1281
思路:
行x看成二分图左边的点,列y看成二分图右边的点,最大匹配就是最多可以放的车的数量。
先计算出最大匹配,然后枚举每个点,尝试去掉之后,若匹配数增大,则为“重要点”。
#include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
#include <algorithm>
#include <iostream>
#include <iterator>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#include <set>
//#define ONLINE_JUDGE
#define eps 1e-8
#define INF 0x7fffffff //INT_MAX
#define inf 0x3f3f3f3f //int??????????????????
#define FOR(i,a) for((i)=0;i<(a);(i)++) //[i,a);
#define MEM(a) (memset((a),0,sizeof(a)))
#define sfs(a) scanf("%s",a)
#define sf(a) scanf("%d",&a)
#define sfI(a) scanf("%I64d",&a)
#define pf(a) printf("%d\n",a)
#define pfI(a) printf("%I64d\n",a)
#define pfs(a) printf("%s\n",a)
#define sfd(a,b) scanf("%d%d",&a,&b)
#define sft(a,b,c)scanf("%d%d%d",&a,&b,&c)
#define for1(i,a,b) for(int i=(a);i<b;i++)
#define for2(i,a,b) for(int i=(a);i<=b;i++)
#define for3(i,a,b)for(int i=(b);i>=a;i--)
#define MEM1(a) memset(a,0,sizeof(a))
#define MEM2(a) memset(a,-1,sizeof(a))
#define MEM3(a) memset(a,0x3f,sizeof(a))
#define LL __int64
const double PI = acos(-1.0);
template<class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template<class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
template<class T> inline T Min(T a, T b) { return a < b ? a : b; }
template<class T> inline T Max(T a, T b) { return a > b ? a : b; }
using namespace std;
template<class T>
T Mint(T a, T b, T c) {
if (a>b) {
if (c>b)
return b;
return c;
}
if (c>a)
return a;
return c;
}
template<class T>
T Maxt(T a, T b, T c) {
if (a>b) {
if (c>a)
return c;
return a;
}
else if (c > b)
return c;
return b;
}
const int maxn=205;
int T,n,m,k;
int line[maxn][maxn],girl[maxn];
bool used[maxn];
int a,b;
bool dfs(int x){
for(int i=1;i<=n;i++){
if(line[x][i]&&!used[i]){
used[i]=1;
if(!girl[i]||dfs(girl[i])){
girl[i]=x;
return true;
}
}
}
return false;
}
int hungary(){
MEM1(girl);
int ans=0;
for(int i=1;i<=n;i++){
MEM1(used);
if(dfs(i))
ans++;
}
return ans;
}
int main() {
int t=1;
while(~sft(n,m,k)){
MEM1(line);
for1(i,0,k){
sfd(a,b);
line[a][b]=1;
}
int ans=hungary();
int cnt=0;
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
if(line[i][j]==1){
line[i][j]=0;
if(ans>hungary()){
cnt++;
}
line[i][j]=1;
}
}
}
printf("Board %d have %d important blanks for %d chessmen.\n",t++,cnt,ans);
}
return 0;
}