poj 3041 Asteroids

最新推荐文章于 2022-01-30 18:01:29 发布

理想主义文艺青年

最新推荐文章于 2022-01-30 18:01:29 发布

阅读量843

点赞数

分类专栏：图论

本文链接：https://blog.csdn.net/u011699990/article/details/41689167

版权

图论专栏收录该内容

137 篇文章 1 订阅

订阅专栏

Asteroids

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 15847		Accepted: 8635

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

Sample Output

简单的二分匹配

#include <cstdio>
#include <iostream>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <string.h>
#include <string>

#define eps 1e-8
#define op operator
#define MOD  10009
#define MAXN  100100
#define INF 0x7fffffff
#define MEM(a,x)    memset(a,x,sizeof a)
#define ll __int64

using namespace std;

int n,k;
int mp[510][510];
int link[510];
int vis[510];
int ans;

bool dfs(int u)
{
    for(int i=1;i<=n;i++)
    {
        if(mp[u][i]&&!vis[i])
        {
            vis[i]=1;
            if(link[i]==-1||dfs(link[i]))
            {
                link[i]=u;
                return 1;
            }
        }
    }
    return 0;
}

void hungary()
{
    MEM(link,-1);
    for(int i=1;i<=n;i++)
    {
        MEM(vis,0);
        if(dfs(i))  ans++;
    }
}

int main()
{
//freopen("ceshi.txt","r",stdin);
    while(scanf("%d%d",&n,&k)!=EOF)
    {
        MEM(mp,0);
        int u,v;
        for(int i=0;i<k;i++)
        {
            scanf("%d%d",&u,&v);
            mp[u][v]=1;
        }
        ans=0;
        hungary();
        printf("%d\n",ans);
    }
    return 0;
}