匈牙利模板--poj 3041最小匹配
来源:互联网 发布:华为mate9网络频段 编辑:程序博客网 时间:2024/05/16 03:19
Asteroids
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 23596 Accepted: 12806
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).
这道题只用套用匈牙利算法就可以解决
将问题看成匹配 题就可以转换为匈牙利算法了
#include<iostream>#include <string.h>#define maxn 501using namespace std;int n,k;bool map[maxn][maxn],vis[maxn];int connect[maxn];void input(){int i; for (i =0; i < k; i++){ int a, b; cin>>a>>b; map[a][b] =1; }}bool work(int a){int i; for (i =1; i <= n; i++) if (map[a][i] &&!vis[i]){ vis[i] =true; if (connect[i] ==-1|| work(connect[i])) { connect[i] = a; return true; } } return false;}int main(){ios::sync_with_stdio(false); //没有加速反而多了十几ms cin>>n>>k; input(); int i; memset(connect, -1, sizeof(connect));int ans =0; for (i =1; i <= n; i++){ memset(vis, false, sizeof(vis)); if(work(i)) ans++; } cout<<ans; return 0;}
阅读全文
0 0
- 匈牙利模板--poj 3041最小匹配
- POJ 3041 匈牙利算法 最小覆盖 最大二分匹配
- poj 匈牙利二分匹配 模板 poj题目
- poj 3041 Asteroids 二分匹配 匈牙利算法 模板题
- POJ 3041 Asteroids(最小顶点覆盖,匈牙利算法模板)
- poj 1469 匈牙利最大匹配 模板
- poj-3041-匈牙利算法模板
- poj3041 最小点覆盖即最大匹配(匈牙利算法)(模板)
- poj 3020 Antenna Placement 匈牙利二分匹配 最小覆盖数 !!!!
- poj 3020 最小边覆盖与最大匹配 匈牙利算法
- POJ 1325 简单基础匈牙利二分匹配:最小点覆盖
- 二分图最大匹配匈牙利算法(poj)3041(模板)
- (模板题)poj 3041 Asteroids(二分图的最大匹配匈牙利算法)
- (匈牙利模板)二分图匹配-poj-2226
- poj 3041(二分匹配,匈牙利)
- POJ 3041 Asteroids(匈牙利算法模板)
- POJ 3041 Asteroids 匈牙利算法模板题
- POJ:3041-Asteroids(匈牙利算法模板)
- Linux网络编程——I/O多路复用
- 17.8.27 校内赛 解题报告【卢卡斯定理】【dfs+hash】【线段树】
- 小白文科生眼中的Linux系统
- Spring 事务详解
- 51Nod 迷宫游戏
- 匈牙利模板--poj 3041最小匹配
- 【asp.net】小结
- Go 语言,开源服务端代码自动生成 框架
- Anaconda使用总结
- This software comes from a 3rd party and may contain non-free components的解决方法
- 无符号整数的bitmap
- 杂记
- 最长公共子串
- UE4学习笔记18th:Playing In Editor