poj 3041 Asteroids
来源:互联网 发布:mac bsd 编辑:程序博客网 时间:2024/06/06 07:12
Asteroids
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 20316 Accepted: 11019
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 <stdio.h>#include <string.h>#include <algorithm>#include <iostream>using namespace std;int e[502][502];int match[502];int book[502];int n,m;int dfs(int u){ int i; for(i = 1;i <= n; i++) { if(book[i] == 0 && e[u][i] == 1) { book[i] = 1; if(match[i] == 0 || dfs(match[i])) { match[i] = u; return 1; } } } return 0;}int main(){ int i; int x,y; int sum; while(~scanf("%d %d",&n,&m)) { sum = 0; memset(e,0,sizeof(e)); for(i = 0;i < m; i++) { scanf("%d %d",&x,&y); e[x][y] = 1; } memset(match,0,sizeof(match)); for(i = 1;i <= n; i++) { memset(book,0,sizeof(book)); if( dfs(i) ) sum++; } printf("%d\n",sum); }}
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
- linux编译ffmpeg2.8.4
- 【PAT】(乙级)1014. 福尔摩斯的约会 (20)
- Scala下载地址
- CodeForces 703D Mishka and Interesting sum
- LeetCode 120 Triangle
- poj 3041 Asteroids
- 深度学习caffe平台--制作自己.lmdb格式数据集及分类标签文件
- Java学习笔记(三):流程控制与数组(2)
- OAuth 微博
- ue4中的像素卡通渲染偏色问题和色彩校正理论
- tjut 2830
- ueditor使用_2_配置修改contextpath
- 在 Mac 下Django 使用PostgreSQL 出现的 No module named psycopg2
- 技术分享一览