zoukankan      html  css  js  c++  java
  • Asteroids

    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).
    题目在意如下:
    题目给出一个矩阵,上面有敌人,每个子弹可以打出一横行或者一竖行,问最少用多少子弹消灭都有敌人,如:
    X.X
    .X.
    .X.
    x表示敌人,显然用两个子弹就可以解决所有敌人。

    .
    .
    .
    .
    .
    分析
    建图:二分图的X部为每一行,Y部为每一列,如果(i,j)有一个敌人,那么连接X部的i与Y部的j。
    该二分图的最大匹配数则是最少要打的枪数。
    .
    .
    .
    .
    .
    程序:

    #include<iostream>
    #include<cstdio>
    #include<cstring>
    using namespace std;
    int ans,tj,n,m,link[4000],v[4000],head[4000];
    
    struct node
    {
    	int to,next;
    }f[4000];
    
    int find(int x)
    {
    	for (int i=head[x];i;i=f[i].next)
    	{
    		int j=f[i].to;
    		if (!v[j])
    		{
    			int q=link[j];
    		    link[j]=x;
    		    v[j]=1;
    		    if (!q||find(q)) return 1;
    		    link[j]=q;
    		}
    		
    	}
    	return 0;
    }
    
    int main()
    {
    	scanf("%d%d",&n,&m);
    	for (int i=1;i<=m;i++)
    	{
    		int x,y;
    		scanf("%d%d",&x,&y);
    		
    		f[++tj].next=head[x];
    		f[tj].to=y;
    		head[x]=tj;
    	}
    	for (int i=1;i<=n;i++)
    	{
    		memset(v,0,sizeof(v));
    		ans+=find(i);
    	}
    	printf("%d",ans);
    	return 0;
    }
    
  • 相关阅读:
    重拾vue1
    sublime text3添加到右键菜单open with sublime text3
    打造最强一款windows最强终端
    Windows下强大的包管理工具Scoop,安装软件一个命令全搞定
    SpringBoot通过proguard-maven-plugin插件进行实际项目代码混淆,实测可用
    贡献一个springboot项目linux shell启动脚本
    springboot2.x基础教程:集成spring-data-jpa
    springboot2.x基础教程:集成mybatis最佳实践
    springboot2.x基础教程:过滤器和拦截器详解
    springboot2.x基础教程:SpringCache缓存抽象详解与Ehcache、Redis缓存配置实战
  • 原文地址:https://www.cnblogs.com/YYC-0304/p/10292801.html
Copyright © 2011-2022 走看看