zoukankan      html  css  js  c++  java
  • Asteroids

     
    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 17258   Accepted: 9386

    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<stdio.h>
     3 #include<string.h>
     4 using namespace std;
     5 int map[500][500];
     6 int vis[500],match[500];
     7 int m,n;
     8 int DFS(int p){
     9     int v;
    10     for(int i=1;i<=m;i++){
    11         if(map[p][i]&&!vis[i]){
    12             vis[i]=1;
    13             v=match[i];
    14             if( v==-1 || DFS(v)){
    15                 match[i]=p;
    16                 return 1;
    17             }
    18 
    19         }
    20     }
    21     return 0;
    22 }
    23 int main() {
    24     while(~scanf("%d %d",&m,&n)){
    25         memset(map,0,500*500*sizeof(int));
    26         for(int i=0;i<n;i++){
    27             int a,b;
    28             scanf("%d %d",&a,&b);
    29             map[a][b]=1;
    30         }
    31         int result=0;
    32         memset(match,-1,500*sizeof(int));
    33         for(int i=1;i<=m;i++){
    34             memset(vis,0,500*sizeof(int));
    35             result+=DFS(i);
    36         }
    37         printf("%d
    ",result);
    38     }
    39     return 0;
    40 }
  • 相关阅读:
    Oracle OMF 创建数据库
    Oracle 数据库修改数据文件
    oracle 12c 安装文档
    mysql5.7 多次增量备份及恢复测试
    Mysql 数据库模拟误操作基于binlog恢复
    基于scn号恢复oracle数据库测试
    读源码 | metisMenu侧边栏插件
    JavaScript | JQuery插件定义方法
    JavaScript | 模拟文件拖选框样式 v1.0
    JavaScript | JSON基本格式
  • 原文地址:https://www.cnblogs.com/sdxk/p/4669419.html
Copyright © 2011-2022 走看看