poj 3041 二分图匹配一般 匈牙利算法
来源:互联网 发布:炽阳魔盒软件下载 编辑:程序博客网 时间:2024/06/03 16:32
点击打开题目
Asteroids
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 23806 Accepted: 12912
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题意:给你长为n的正方形,其中有k个点你要消除,你可以一次性消除一行或者一次性消除一列,问最小消除几次才能全部消除这些点。
思路:这个题想通了就是水题,想不通就gg,其实这个题可以把(x,y)看做对立的点进行二分图匹配,然后,就是模板了。
#include<stdio.h>#include<string.h>int G[500][500];int link[500],used[500];int n,k;int dfs(int u){for(int i=1;i<=n;i++){if(G[u][i]&&!used[i]){used[i]=1;if(!link[i]||dfs(link[i])){link[i]=u;return 1;}}}return 0;}int main(){while(~scanf("%d%d",&n,&k)){int i,u,v,ans=0;memset(G,0,sizeof(G));memset(link,0,sizeof(link));for(i=0;i<k;i++){scanf("%d%d",&u,&v);G[u][v]=1;}for(i=1;i<=n;i++){memset(used,0,sizeof(used));ans+=dfs(i);}printf("%d\n",ans);}}
阅读全文
0 0
- poj 3041 二分图匹配一般 匈牙利算法
- POJ 1325 二分图匹配/匈牙利算法
- poj 2446 二分图匹配,匈牙利算法
- POJ 1325 二分图匹配-匈牙利算法
- poj-2239-二分图匹配-匈牙利算法
- POJ 3041 Asteroids 二分图匹配 匈牙利算法
- poj 3041 Asteroids (匈牙利算法---二分图最大匹配)
- POJ 3041 Asteroids 匈牙利算法 二分图最大匹配
- poj 3041 Asteroids(二分图匹配匈牙利算法)
- poj 3041 Asteroids(二分图匹配匈牙利算法)
- POJ 3041 Asteroids(二分图匹配+匈牙利算法)
- POJ-3041 匈牙利算法 二分图最大匹配
- 二分图匹配:匈牙利算法
- 二分图匹配匈牙利算法
- 二分图匹配-匈牙利算法
- 匈牙利算法(二分图匹配)
- 二分图匹配 匈牙利算法
- 二分图匹配(匈牙利算法)
- Error:No service of type Factory available in ProjectScopeServices.
- N-Queens II:只记录下结果即可的N皇后问题
- maven项目报错:ResourcePathLocationType Project configuration is not up-to-date with pom.xml
- 简单实现二维码生成器
- 笔试_Java基础综合题2
- poj 3041 二分图匹配一般 匈牙利算法
- EL中的${param}
- 39平衡二叉树判断python
- Thread.currentThread()与this的区别
- mac系统下配置python环境
- G1垃圾收集器
- 命令行菜单小程序v2.0
- < 笔记 > HTML
- 剑指offer之正则表达式匹配