【poj 3401 二分图最大匹配】
来源:互联网 发布:qq聊天记录数据恢复 编辑:程序博客网 时间:2024/06/05 08:55
点击打开链接
Asteroids
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 23503 Accepted: 12749
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).
#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int f[505];bool fr[505][505];bool vis[505];int k,n,m;bool find(int x){for(int i = 1;i <= n;i++){if(fr[x][i] && !vis[i]){vis[i] = true;if(f[i] == -1){f[i] = x;return true;}else if(find(f[i])){f[i] = x;return true;}}}return false;}int main(){while(~scanf("%d%d",&n,&k)){memset(f,-1,sizeof(f));memset(fr,false,sizeof(fr));for(int i = 1;i <= k;i++){int x,y;scanf("%d%d",&x,&y);fr[x][y] = true;}int ans = 0;for(int i = 1; i <= n; i++){memset(vis,false,sizeof(vis));if(find(i)) ans++;}printf("%d\n",ans);}return 0;}
阅读全文
0 0
- POJ 3401 Asteroids 二分图最大匹配
- 【poj 3401 二分图最大匹配】
- POJ 3401 Asteroids 二分图最大匹配 最小点覆盖
- POJ 1274 二分图最大匹配
- POJ 1469 二分图最大匹配
- POJ 2239 二分图最大匹配
- Asteroids(poj 3041,二分图最大匹配)
- poj 1274 二分图 最大匹配
- poj 1469 二分图最大匹配
- POJ 1469二分图最大匹配
- poj 1274 二分图最大匹配
- POJ 1469 二分图最大匹配 COURSES
- poj 2446 二分图 最大匹配
- poj 2536 二分图 最大匹配
- POJ 3692 二分图最大匹配
- Muddy Fields+POJ+二分图最大匹配
- POJ 1469 COURSES(二分图最大匹配)
- POJ 2446 Chessboard(二分图最大匹配)
- 求count的值
- 温故知新python3--基础知识2(函数基础)
- hdu 3715 2-sat + 二分
- 并查集入门--hd1874 起点终点设定 dj+fl
- [PAT甲级]1008. Elevator (20)(求电梯运行时间)
- 【poj 3401 二分图最大匹配】
- PHP基础教程-27 课后作业06
- 【KMP+优化】HDU 6153/CCPC 1003 A Secret
- 2017.8.20暑假集训第二十一天
- Unity进阶技巧
- Java对象的生成
- BigInteger类和BigDecimal类
- HDU-2176-取(m堆)石子游戏 【nimm】
- Maven配置环境变量