zoukankan      html  css  js  c++  java
  • poj 3041 Asteroids

    Asteroids
    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 14388   Accepted: 7828

    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

    将模型转化为二分图   依据匈牙利算法直接套用模板就可以
    #include<iostream>
    #include<cstring>
    using namespace std;
    #define M 505
    int map[M][M];
    int vis[M],flag[M];
    int n,m,ans;
    int xyl(int x)
    {
        int i;
        for(i=1;i<=n;i++)
        {
            if(map[x][i]&&!vis[i])
            {
                vis[i]=1;
                if(!flag[i]||xyl(flag[i]))
                {
                    flag[i]=x;
                    return 1;
                }
            }
        }
        return 0;
    }
    int main()
    {
        int i,j,x,y;
        while(cin>>n>>m)
        {
            memset(map,0,sizeof(map));
            memset(flag,0,sizeof(flag));
            for(i=0;i<m;i++)
            {
                 cin>>x>>y;
                 map[x][y]=1;
            }
            ans=0;
            for(i=1;i<=n;i++)
            {
                memset(vis,0,sizeof(vis));
                ans+=xyl(i);
            }
            cout<<ans<<endl;
    
        }
        return 0;
    
    }
    


  • 相关阅读:
    关于global和$GLOBALS[]的一些实践
    java环境配置的新手教程
    echart图表 resize()方法使用
    使用git上传下载项目
    windows 系统新建 vue 项目的坑
    Java版求1000以内的完全数
    Java版经典兔子繁殖迭代问题——斐波那契(Fibonacci)数列
    Java版冒泡排序和选择排序
    AngularJS 动画总结
    Mac下sublime text 的“package control”安装
  • 原文地址:https://www.cnblogs.com/yutingliuyl/p/6918934.html
Copyright © 2011-2022 走看看