POJ 3041 Asteroids(二分图匹配)

Asteroids
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 25136 Accepted: 13579

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

题解:
每个小行星看做一条边,行星坐标为(x,y)则从x到y建一条边。问题转化为求
最少的点覆盖所有边,即最小点覆盖,在二分图中最小点覆盖等于最大匹配。
代码:

#include<cstdio>
#include<vector>
#include<string.h>
#include<algorithm>
using namespace std;
const int maxn=505;
int match[maxn];
bool vis[maxn];
vector<int>p[maxn];
bool dfs(int v)
{
    vis[v]=1;
    for(int i=0;i<p[v].size();i++)
    {
        int u=p[v][i],w=match[u];
        if(w<0||(!vis[w]&&dfs(w)))
        {
            //match[v]=u;
            match[u]=v;
            return 1;
        }
    }
    return 0;
}
int main()
{
    int n,k;scanf("%d%d",&n,&k);
    for(int i=0;i<k;i++)
    {
        int x,y;scanf("%d%d",&x,&y);
        p[x].push_back(y);
        //p[y].push_back(x);
    }
    int ans=0;
    memset(match,-1,sizeof(match));
    for(int i=1;i<=n;i++)
    {
        memset(vis,0,sizeof(vis));
        if(dfs(i))ans++;
    }
    printf("%d\n",ans);
    return 0;
}

阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/albertluf/article/details/79972287
个人分类: 网络流
上一篇埃森哲杯第十六届上海大学程序设计联赛春季赛暨上海高校金马五校赛 B-合约数(dfs序)
下一篇ZOJ 3805 Machine(dfs)
想对作者说点什么? 我来说一句

poj_3041 匈牙利算法

思路:

yeruby yeruby

2014-09-16 13:25:43

阅读数:2160

没有更多推荐了,返回首页

关闭
关闭