poj 3041 二分图典型题

Asteroids

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 14588		Accepted: 7942

Description

Bessie wants to navigate her spaceship through a dangerous asteroid field in the shape of an N x N grid (1 <= N <= 500). The grid contains K asteroids (1 <= K <= 10,000), which are conveniently located at the lattice points of the grid. 

Fortunately, Bessie has a powerful weapon that can vaporize all the asteroids in any given row or column of the grid with a single shot.This weapon is quite expensive, so she wishes to use it sparingly.Given the location of all the asteroids in the field, find the minimum number of shots Bessie needs to fire to eliminate all of the asteroids.

Input

* Line 1: Two integers N and K, separated by a single space. 
* Lines 2..K+1: Each line contains two space-separated integers R and C (1 <= R, C <= N) denoting the row and column coordinates of an asteroid, respectively.

Output

* Line 1: The integer representing the minimum number of times Bessie must shoot.

Sample Input

3 4
1 1
1 3
2 2
3 2

Sample Output

2

Hint

INPUT DETAILS: 
The following diagram represents the data, where "X" is an asteroid and "." is empty space: 
X.X 
.X. 
.X. 

OUTPUT DETAILS: 
Bessie may fire across row 1 to destroy the asteroids at (1,1) and (1,3), and then she may fire down column 2 to destroy the asteroids at (2,2) and (3,2).

Source

USACO 2005 November Gold

题目大意是，一个n*n矩阵，某些位置有小行星，有一种炸弹，一次可以炸掉一行或者一列，现在问题是需要最少用多少这样的炸弹。

分析：模型转化，非常巧妙的利用二分图来解决。利用二分图必须有左顶点和右顶点，我们把行作为左顶点，列作为右顶点，如果该行和该列的交点有小行星，就连线。求此二分图的最大匹配就是了。对这个问题展开思考，为什么可以这么转化。其实从最小顶点覆盖的角度来想比较好理解，左边的顶点和右边的顶点只有当有小行星的时候才有连线，那么只要找到最少的顶点把所有的边覆盖了，那么就是所求的解了。最小顶点覆盖等值于最大匹配。

代码：

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <string>
#include <cstring>
#include <cmath>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <functional>
#include <sstream>
#include <iomanip>
#include <cmath>
#include <cstdlib>
#include <ctime>
typedef long long ll;
#pragma comment(linker, "/STACK:1024000000,1024000000")  //手动扩栈
#define INF 1e9
#define maxn 500+10
#define maxm 100086+10
#define mod 1000000007
#define eps 1e-7
#define PI acos(-1.0)
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define scan(n) scanf("%d",&n)
#define scanll(n) scanf("%I64d",&n)
#define scan2(n,m) scanf("%d%d",&n,&m)
#define scans(s) scanf("%s",s);
#define ini(a) memset(a,0,sizeof(a))
#define out(n) printf("%d\n",n)
using namespace std;
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define MAXE 123+10
#define MAXN 510
#define SET(a,b) memset(a,b,sizeof(a))
int uN,vN;
int g[MAXN][MAXN];
int linker[MAXN];
bool used[MAXN];
bool dfs(int u)
{
    for(int v = 1; v <= vN;v++)
        if(g[u][v] && !used[v])
        {
            used[v] = true;
            if(linker[v] == -1 || dfs(linker[v]))
            {
                linker[v] = u;
                return true;
            }
        }
    return false;
}
int hungary()
{
    int res = 0;
    memset(linker,-1,sizeof(linker));
    for(int u = 1; u <= uN;u++)
    {
        memset(used,false,sizeof(used));
        if(dfs(u))res++;
    }
    return res;
}
int main()
{
#ifndef ONLINE_JUDGE
    freopen("in.txt","r",stdin);
   // freopen("out.txt","w",stdout);
#endif
    int n,m;
    while(~scanf("%d%d",&n,&m))
    {
		int x,y;
        while(m--)
		{
			scanf("%d%d",&x,&y);
			g[x][y] = 1;
		}
        uN = vN = n;
        int cnt=hungary(); 
		cout<<cnt<<endl;     
    }
    return 0;
}