zoukankan      html  css  js  c++  java
  • POJ:3041-Asteroids(匈牙利算法模板)

    传送门:http://poj.org/problem?id=3041

    Asteroids

    Time Limit: 1000MS Memory Limit: 65536K

    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).


    解题心得:

    • 题意就是要将图中的 X消去,每次可以消去一行或者消去一列。可以将行和列看做一个节点,而一个点的坐标可以看成在x和y节点上连接的一条边,要求用最小的边数目将已经覆盖的节点全部覆盖。说了那么多就是一个裸地匈牙利算法。

    • 很好懂的匈牙利算法传送门:这里写链接内容

      • 匈牙利算法的核心就在一个可不可以让出一个位置,dfs可以看成向上递归,只要已经安排的点有一个可以让出一个位置就可以安放当前。

    #include<stdio.h>
    #include<string.h>
    using namespace std;
    const int maxn = 510;
    int n,m;
    int match[maxn];
    bool maps[maxn][maxn],vis[maxn];
    
    void init()
    {
        memset(maps,0,sizeof(maps));
        memset(match,0,sizeof(match));
        while(m--)
        {
            int x,y;
            scanf("%d%d",&x,&y);
            maps[x][y] = true;
        }
    }
    
    bool dfs(int x)
    {
        for(int i=1;i<=n;i++)
        {
            if(maps[x][i] && !vis[i])
            {
                vis[i] = true;
                if(match[i] == 0 || dfs(match[i]))//可以让出就ans++,不然就不能连接
                {
                    match[i] = x;
                    return true;
                }
            }
        }
        return false;
    }
    
    int get_ans()
    {
        int ans = 0;
        for(int i=1;i<=n;i++)
        {
            memset(vis,0,sizeof(vis));
            if(dfs(i))
                ans++;
        }
        return ans;
    }
    
    int main()
    {
        while(scanf("%d%d",&n,&m) != EOF)
        {
            init();
            int ans = get_ans();
            printf("%d
    ",ans);
        }
        return 0;
    }
    
  • 相关阅读:
    C#在二维码中添加圆角logo
    保存emoji到数据库
    参数名ASCII码从小到大排序(字典序)
    SQL SERVER 2008 获取表字段的类型
    js对Cookie的读写操作
    sql server2008根据经纬度计算两点之间的距离
    sql server2008给数据表,字段,添加修改注释
    关闭浏览器的放大缩小功能
    SQL Server 阻止了对组件 'Ole Automation Procedures' 的 过程'sys.sp_OACreate' 的访问,因为此组件已作为此服务器安全配置的一部分而被关闭。系统管理员可以通过使用 sp_configur
    ASP.NET正则表达式(URL,Email)
  • 原文地址:https://www.cnblogs.com/GoldenFingers/p/9107234.html
Copyright © 2011-2022 走看看