poj-3041 Asteroids
来源:互联网 发布:国网网络大学怎么考试 编辑:程序博客网 时间:2024/06/05 02:43
Asteroids
Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u
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).
#include<cstdio>#include<cstring> int k,n;int fri[505][505];int f[505]; int vis[505];int find(int x){ for(int i=1; i<=n; i++) { if(vis[i]==0 && fri[x][i]==1) { vis[i]=1; if(f[i]==0) { f[i]=x; return 1; } else if(find(f[i])==1) { f[i]=x; return 1; } } } return 0;}int main(){ while( ~scanf("%d%d",&n,&k) ) { memset(fri,0,sizeof(fri)); memset(f,0,sizeof(f)); for(int i=1; i<=k; i++) { int x,y; scanf("%d%d",&x,&y); fri[x][y]=1; } int ans=0; for(int i=1; i<=n; i++) { memset(vis,0,sizeof(vis)); if(find(i)==1) ans++; } printf ("%d\n",ans); } return 0;}
- POJ 3041 Asteroids
- poj 3041 Asteroids
- POJ-3041 Asteroids
- Poj 3041 Asteroids
- poj 3041 Asteroids
- poj 3041 Asteroids
- POJ:3041Asteroids
- 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
- 觉得比较好NET相关书籍(其他技术,平台也有)
- 安装虚拟机总结
- Java多线程
- 23种设计模式全解析
- 数据库的索引原理
- poj-3041 Asteroids
- hdu_4350_数组模拟_函数调用数组
- Oracle 11G RAC:生产环境下架构
- 【deep learnign】关于 epoch、 iteration和batchsize
- 怎么设置原理图导入到pcb中的默认字体类型(大小,字体)?
- 【C#基础知识】——初识委托(delegate)
- 静态变量和成员变量的区别
- 【算法学习】求两数组求差数(Java,三重境界)
- IntelliJ IDEA+SpringBoot用JDBC做一个小型的javaWeb程序