zoukankan      html  css  js  c++  java
  • POJ 3041 Asteroids(最小点覆盖集)

                                                                      Asteroids
    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 20748   Accepted: 11278

    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).
    #include <iostream>
    #include <cstring>
    #include <cstdio>
    #include <algorithm>
    #include <cmath>
    #include <string>
    #include <map>
    #include <queue>
    #include <vector>
    #define inf 0x7fffffff
    #define met(a,b) memset(a,b,sizeof a)
    typedef long long ll;
    using namespace std;
    const int N = 1005;
    const int M = 24005;
    int read() {
        int x=0,f=1;
        char c=getchar();
        while(c<'0'||c>'9') {
            if(c=='-')f=-1;
            c=getchar();
        }
        while(c>='0'&&c<='9') {
            x=x*10+c-'0';
            c=getchar();
        }
        return x*f;
    }
    int n1,n2,k;
    int mp[N][N],vis[N],link[N];
    int dfs(int x) {
        for(int i=1; i<=n2; i++) {
            if(mp[x][i]&&!vis[i]) {
                vis[i]=1;
                if(link[i]==-1||dfs(link[i])) {
                    link[i]=x;
                    return 1;
                }
            }
        }
        return 0;
    }
    
    int main()
    {
        int cas ;
            int s=0;
            scanf("%d%d",&n1,&k);
            met(mp,0);n2=n1;
           int xx,yy;
            for(int i=0; i<k; i++) {
                scanf("%d%d",&xx,&yy);
                mp[xx][yy]=1;
            }
            memset(link,-1,sizeof(link));
            for(int i=1; i<=n1; i++) {
                memset(vis,0,sizeof(vis));
                if(dfs(i)) s++;
            }
            printf("%d
    ",s);
        return 0;
    }
  • 相关阅读:
    我用到的存储过程
    yii2图片处理扩展yii2-imagine的使用
    yii2——自定义widget
    YII2之 Scenario
    PHP获取某月天数
    docker版wordpress
    RBAC中 permission , role, rule 的理解
    mysql开启远程连接
    windows系统和ubuntu虚拟机之间文件共享——samba
    php生成随机字符串
  • 原文地址:https://www.cnblogs.com/jianrenfang/p/5935883.html
Copyright © 2011-2022 走看看