zoukankan      html  css  js  c++  java
  • Asteroids(二分图的最大分配)

    ~题目链接~

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

    ~题目~

    Asteroids
    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 12708   Accepted: 6918

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

    最小点覆盖=最大匹配算法  匈牙利

     1 #include<iostream>
     2 #include<cstdio>
     3 #include<cstring>
     4 const int maxn=510;
     5 using namespace std;
     6 
     7 int n;
     8 int map[maxn][maxn];
     9 int dis[maxn],vis[maxn];
    10 
    11 int BFS(int c)
    12 {
    13     int i;
    14     for(i=1; i<=n; i++)
    15     {
    16         if(!vis[i] && map[c][i])
    17         {
    18             vis[i]=1;
    19             if(dis[i]==-1 || BFS(dis[i]))
    20             {
    21                 dis[i]=c;
    22                 return 1;
    23             }
    24         }
    25     }
    26     return 0;
    27 }
    28 int main()
    29 {
    30     int m;
    31     while(~scanf("%d%d",&n,&m))
    32     {
    33         int a,b;
    34         memset(map,0,sizeof(map));
    35         memset(dis,-1,sizeof(dis));
    36         while(m--)
    37         {
    38             cin>>a>>b;
    39             map[a][b]=1;
    40         }
    41         int i,sum=0;
    42         for(i=1; i<=n; i++)
    43         {
    44             memset(vis,0,sizeof(vis));
    45             if(BFS(i))
    46             sum++;
    47         }
    48         cout<<sum<<endl;
    49     }
    50 }
    View Code
  • 相关阅读:
    git本地分支管理
    SpringMVC的第一个入门案例
    原来热加载如此简单,手动写一个 Java 热加载吧
    Spring Boot2 系列教程(十七)SpringBoot 整合 Swagger2
    SpringBoot 开发案例之参数传递的正确姿势
    MENU Java 中的 final、finally、finalize 有什么不同?
    Java Web 学习(1) —— Servlet
    Spring 基础知识学习
    SpringBoot中如何灵活的实现接口数据的加解密功能?
    Java中常用的四种线程池
  • 原文地址:https://www.cnblogs.com/guoyongzhi/p/3307704.html
Copyright © 2011-2022 走看看