POJ 3041 Asteroids
来源:互联网 发布:网络灰色项目一天一万 编辑:程序博客网 时间:2024/05/19 20:42
二分图:最小点覆盖==最大匹配
Asteroids
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 15582 Accepted: 8506
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
#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>using namespace std;const int maxn=505;int n,m;struct Edge{ int to,next;}edge[11000];int Adj[maxn],Size;void init(){ memset(Adj,-1,sizeof(Adj)); Size=0;}void Add_Edge(int u,int v){ edge[Size].to=v; edge[Size].next=Adj[u]; Adj[u]=Size++;}int linker[maxn];bool used[maxn];bool dfs(int u){ for(int i=Adj[u];~i;i=edge[i].next) { int v=edge[i].to; if(!used[v]) { used[v]=true; if(linker[v]==-1||dfs(linker[v])) { linker[v]=u; return true; } } } return false;}int hungary(){ int res=0; memset(linker,-1,sizeof(linker)); for(int u=1;u<=n;u++) { memset(used,false,sizeof(used)); if(dfs(u)) res++; } return res;}int main(){ while(scanf("%d%d",&n,&m)!=EOF) { init(); for(int i=0;i<m;i++) { int r,c; scanf("%d%d",&r,&c); Add_Edge(r,c); } printf("%d\n",hungary()); } return 0;}
0 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
- java二维码生成与解析代码实现
- VB.net学习笔记之发送邮件:System.Net.Mail
- xcode cocos2d-x js lus 脚本更新代码
- 如何将整数int转换成字符串String?
- 利用MVC4将数据保存为CSV格式文件并指定目录
- POJ 3041 Asteroids
- Invalid use of SingleClientConnManager: connection still allocated解决方案
- BlazeDS中Java与ActionScript类型对应表
- hdu 1052
- Chrome 自带的 user agent stylesheet 与 html中<!DOCTYPE>标签
- MQ的安装和下载
- 51nod1262 扔球(欧拉函数)
- Android 自动完全组件(SocialTokenAutoComplete)—— 一种更友好的方式@某人在社交应用中
- struts2随笔(一)Action、struts.xml、Interceptor细节