POJ3014（最小覆盖点；匈牙利算法）

匈牙利算法

需要知道的知识点：
最小覆盖点==最大匹配
关于匈牙利算法的详解，可以看我的另外一篇博文。

例题：

Asteroids

Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 27787 Accepted: 14897
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

POJ3041

分析

有一个N×N的网格，网格上有小怪兽，一次操作可以清除一行或者一列的小怪兽，问至少多少次能消灭所有的。这个题目就是最小覆盖点的题，利用之前的知识点，把这个题目转化成求最大匹配的问题就是一个板子题了。

参考代码

#include <cstdio>
#include <iostream>
#include <cstring>
const int MAXN=505;
const int MAXM=10005;
using namespace std;

struct Edge{
    int to,next;
}edge[MAXM];
int head[MAXN],tot;
int N,K,r,c;

void init()
{
    tot=0;
    memset(head,-1,sizeof(head));
}

void addedge(int u,int v)
{
    edge[tot].to=v;
    edge[tot].next=head[u];
    head[u]=tot++;
}

int linker[MAXN];
bool used[MAXN];
int uN;

bool dfs(int u)
{
    for (int i=head[u];i!=-1;i=edge[i].next)
    {
        int v=edge[i].to;
        if (!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()
{
    cin >> N >> K;
    init();
    for (int i=0;i<K;i++)
    {
        scanf("%d%d",&r,&c);
        addedge(r,c);
    }
    uN=N;
    cout << hungary() << endl;
    return 0;
}