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

    http://poj.org/problem?id=3041

    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 <stdio.h>
    #include <string.h>
    #include <algorithm>
    #include <cstdio>
    using namespace std;
    
    const int maxn = 550;
    int N, K;
    int mp[maxn][maxn];
    int vis[maxn], match[maxn];
    
    int path(int u) {
        for(int v = 1; v <= N; v ++) {
            if(mp[u][v] && !vis[v]) {
                vis[v] = 1;
                if(match[v] == -1 || path(match[v])) {
                    match[v] = u;
                    return 1;
                }
            }
        }
        return 0;
    }
    
    int main() {
        memset(mp, 0, sizeof(mp));
        memset(match, -1, sizeof(match));
        scanf("%d%d", &N, &K);
    
        for(int i = 0; i < K; i ++) {
            int x, y;
            scanf("%d%d", &x, &y);
            mp[x][y] = 1;
        }
        int cnt = 0;
        for(int i = 1; i <= N; i ++) {
            memset(vis, 0, sizeof(vis));
            if(path(i))
                cnt ++;
            else continue;
        }
        printf("%d
    ", cnt);
        return 0;
    }
    

      匈牙利算法 求最小点集覆盖 

  • 相关阅读:
    js面对对象和jQuery的使用
    感知器PLA算法
    MSP430G2系列学习笔记
    数学建模——规划问题
    51单片机学习(一)
    打靶法求解两点边值问题
    GAOT工具箱(遗传算法)的应用
    数学建模方法
    关于mysql 5.7 版本登录时出现错误 1045的随笔
    oracle复习(二)
  • 原文地址:https://www.cnblogs.com/zlrrrr/p/10669651.html
Copyright © 2011-2022 走看看