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

    Asteroids
    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 21646   Accepted: 11763

    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

     
     1 // 匈牙利算法 的 最小点覆盖
     2 #include<iostream>
     3 #include<cstring>
     4 #include<cstdio>
     5 using namespace std;
     6 const int maxn = 510;
     7 int head[maxn],link[maxn],n,ans,k;
     8 bool vis[maxn];
     9 struct Edge{
    10     int from,to,next;
    11 }e[maxn*maxn];
    12 void Add_Edge(int u,int v){
    13     e[++tot].from=u;e[tot].to=v;
    14     e[tot].next=head[u];head[u]=tot;
    15 }
    16 bool DFS(int u){
    17     for(int i=head[u];i;i=e[i].next){
    18         int v=e[i].to;
    19         if(!vis[v]){
    20             vis[v]=1;
    21             if(!link[v] || DFS(link[v])){
    22                 link[v]=u;
    23                 return true;
    24             }
    25         }
    26     }
    27     return false;
    28 }
    29 int main()
    30 {
    31     scanf("%d%d",&n,&k);
    32     for(int i=1,u,v;i<=k;i++){
    33         scanf("%d%d",&u,&v);
    34         Add_Edge(u,v);
    35     }
    36     int ans=0;
    37     memset(link,0,sizeof(link));
    38     for(int i=1;i<=n;i++){
    39         memset(vis,0,sizeof(vis));
    40         if(DFS(i))ans++;
    41     }
    42     printf("%d
    ",ans);
    43     return 0;
    44 }
  • 相关阅读:
    Java之路---Day09(继承)
    Java之路---Day08
    Java之路---Day07
    Java之路---Day06
    转载:js 创建对象、属性、方法
    Javascript类型检测
    jQuery 如何写插件
    js浮点数精度问题
    IE7.JS解决IE兼容性问题方法
    CSS 中文字体的英文名称 (simhei, simsun) 宋体 微软雅黑
  • 原文地址:https://www.cnblogs.com/suishiguang/p/6428996.html
Copyright © 2011-2022 走看看