Asteroids(二分图最大匹配模板题)
2013-08-08 21:23
246 查看
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 12323 | Accepted: 6716 |
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<stdio.h> #include<string.h> int map[510][510]; int link[510]; int vis[510]; int n; bool dfs(int u) { int v; for(v = 1; v <= n; v++) { if(map[u][v] && !vis[v]) { vis[v] = 1; if(link[v] == -1 || dfs(link[v])) { link[v] = u; return true; } } } return false; } int main() { int k,u,v,res; memset(map,0,sizeof(map)); scanf("%d %d",&n,&k); while(k--) { scanf("%d %d",&u,&v); map[u][v] = 1; } memset(link,-1,sizeof(link)); res = 0; for(u = 1; u <= n; u++) { memset(vis,0,sizeof(vis)); if(dfs(u)) res++; } printf("%d\n",res); return 0; }
View Code
相关文章推荐
- (模板题)poj 3041 Asteroids(二分图的最大匹配匈牙利算法)
- POJ 3041 Asteroids 二分图最大匹配
- POJ-1274-The Perfect Stall【二分图最大匹配】【模板题】
- POJ3041--Asteroids--二分图最大匹配--Konig
- 二分图最大匹配(模板+题目)
- POJ 3041 Asteroids 二分图最大匹配
- POJ 3041 Asteroids 匈牙利算法 二分图最大匹配
- Asteroids(poj 3041,二分图最大匹配)
- HDOJ 2389 - Hopcroft-Carp模板二分图最大匹配
- HDU 2063 过山车(模板—— 二分图最大匹配问题)
- 【模板】KM算法模板(带注释)——二分图带权最大匹配
- POJ 3401 Asteroids 二分图最大匹配 最小点覆盖
- (模板)二分图最大匹配,最大流算法
- 【二分图最大权匹配】【KM算法模板】
- UOJ#80 二分图最大权匹配 [模板题]
- [kuangbin带你飞]专题十 匹配问题 (二分图最大匹配)(二分图染色)(模板)
- hdu3829及二分图最大匹配模板
- 二分图最大匹配(匈牙利算法Dfs模板)
- 二分图最大权匹配--KM算法模板
- HDU 2063 过山车 【二分图最大匹配(匈牙利模板)】