【Asteroids】二分图
来源:互联网 发布:c语言中switch 编辑:程序博客网 时间:2024/05/18 11:12
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).
#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int n,k;int coordinate[505][505];int f[505];int vis[505];bool find(int x){ for(int i = 1; i <= n; i++) { if(coordinate[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(){ scanf("%d%d",&n,&k); memset(coordinate, false, sizeof(coordinate)); memset(f, -1, sizeof(f)); for(int i = 1; i <= k; i++) { int x,y; scanf("%d%d",&x,&y); coordinate[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;}
- POJ3041 Asteroids(二分图)
- Asteroids--二分图
- Asteroids 二分图
- Asteroids(二分图匹配)
- Asteroids (二分图)
- Poj3041-Asteroids-【二分图】
- 【Asteroids】二分图
- [二分图]Asteroids
- Asteroids+POJ+二分图匹配
- poj 3041 Asteroids 二分图
- 【POJ 3041 Asteroids】+ 二分图
- 【二分图】poj 3041 Asteroids
- 【POJ3041】Asteroids(二分图)
- 二分 Asteroids
- POJ3041--Asteroids--二分图最大匹配--Konig
- Asteroids(poj 3041,二分图最大匹配)
- poj 3041 Asteroids 二分图匹配
- poj 3041 Asteroids (二分图匹配)
- 安装wamp
- 【今日荐文】三十五年经验分享:程序员进阶八法
- NKOJ1698 兔子 题解
- codility CyclicRotation
- 爱上Java和JVM的10大理由
- 【Asteroids】二分图
- Merge Intervals--LeetCode
- Day02 Jinja2模板引擎&Bootstrap
- c代码实现大位数减法
- 对int main(int argc,char* argv[])的理解
- 【Noip2011】选择客栈
- 转载:电子商务软件测试的探讨
- POJ3252-Round Numbers
- Idea的插件管理——持续更新