POJ 3041 Asteroids 求最大匹配数
来源:互联网 发布:网络语狗粮是什么意思 编辑:程序博客网 时间:2024/06/05 20:42
点击打开链接
Asteroids
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 12199 Accepted: 6641
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.
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.
* 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 41 11 32 23 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).
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
USACO 2005 November Gold
把方阵的行和列看作两个顶点集v1和v2.把障碍物的x和y看成连接x和y的坐标。然后求x和y的最大匹配数就行。
#include<stdio.h>#include<string.h>using namespace std;int g[507][507],link[507];int n,m;bool vis[507];bool find(int i){ for(int j=1;j<=n;j++) { if(g[i][j]&&!vis[j]) { vis[j]=true; if(!link[j]||find(link[j])) { link[j]=i; return true; } } } return false;}int main(){ scanf("%d%d",&n,&m); int a,b; memset(g,0,sizeof(g)); memset(link,0,sizeof(link)); for(int i=1;i<=m;i++) { scanf("%d%d",&a,&b); g[a][b]=1; } int ans=0; for(int i=1;i<=n;i++) { memset(vis,0,sizeof(vis)); if(find(i)) ans++; } printf("%d\n",ans); return 0;}
- POJ 3041 Asteroids 求最大匹配数
- poj 3041 Asteroids 最大匹配
- poj 3041 Asteroids 最大匹配
- POJ 3041 Asteroids ( 最小点覆盖数=最大匹配数, 二分图匹配)
- POJ 3041 Asteroids(最大二分匹配)
- Asteroids(poj 3041,二分图最大匹配)
- [二分图最大匹配] poj 3041 Asteroids
- POJ 3041 Asteroids (二分图最大匹配)
- poj 3041 Asteroids 二分图最大匹配
- POJ-3041 Asteroids(最大匹配)
- POJ 3041 Asteroids 二分图最大匹配
- 【POJ】-3041-Asteroids(二分最大匹配)
- POJ 3041 Asteroids 二分图最大匹配
- poj 3041 Asteroids (二分图最大匹配 == 最小点覆盖数)
- POJ 3041 Asteroids(最大匹配数=最小点覆盖)
- 【二分图+最大匹配】北大 poj 3041 Asteroids
- poj 3041 Asteroids 初级-》二分图最大匹配
- poj 3041 Asteroids (匈牙利算法---二分图最大匹配)
- zencart整合分享和登录
- TreeMap and TreeSet
- PS在图片的原始像素大小不变的情况下,把图片保存为较小的存储大小。
- 五大常用算法之三:贪心算法
- tomcat在conf/Catalina/localhost目录下配置项目路径
- POJ 3041 Asteroids 求最大匹配数
- js计时器
- zencart css没有加载 无法登录后台
- ubuntu支持exfat分区
- 五大常用算法之四:回溯法
- AD0错误:0x80040e14 在sysservers中找不到服务器QPGameUserDBLink
- MFC内结构结构体定义
- hdu 状态压缩dp小集(中低难度)
- zencart DPS payment gateway在哪里