ACM: 匈牙利算法 图论题 poj 3041 …
来源:互联网 发布:杭州创业软件官网 编辑:程序博客网 时间:2024/05/18 23:53
Description
Bessie wants to navigate her spaceship through a dangerousasteroid field in the shape of an N x N grid (1 <= N<= 500). The grid contains K asteroids (1<= K <= 10,000), which areconveniently located at the lattice points of the grid.
Fortunately, Bessie has a powerful weapon that can vaporize all theasteroids in any given row or column of the grid with a singleshot.This weapon is quite expensive, so she wishes to use itsparingly.Given the location of all the asteroids in the field,find the minimum number of shots Bessie needs to fire to eliminateall of the asteroids.
Input
* Line 1: Two integers N and K, separated by a singlespace.
* Lines 2..K+1: Each line contains two space-separated integers Rand C (1 <= R, C <= N) denoting therow and column coordinates of an asteroid, respectively.
Output
* Line 1: The integer representing the minimum number of timesBessie 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 asteroidand "." 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 asteroidsat (2,2) and (3,2).
题意: Bessie 要消灭grid中所有的障碍, 她每发射一次可以摧毁一行 or 一列 的障碍.
解题思路:
代码:
#include <cstdio>
#include <iostream>
#include <cstring>
using namespace std;
#define MAX 505
int n, m;
int graph[MAX][MAX];
bool vis[MAX];
int state[MAX];
void read_graph()
{
}
bool find(int u)
{
}
int Edmonds()
{
}
int main()
{
//
}
- ACM: 匈牙利算法 图论题 poj 3041 …
- ACM: 匈牙利算法二分图 图论题 poj…
- ACM: 匈牙利算法 图论题 poj 3020
- ACM: 图论题 poj 2240 (floyd + ST…
- ACM: 直接敲出LCA算法 图论题 poj …
- ACM: 图论题 poj 3…
- ACM: 图论题 poj 1…
- ACM: 图论题 poj 1…
- ACM: 差分约束 图论题 poj 2983 sp…
- ACM: 有向欧拉图 图论题 poj 1386 …
- ACM: polay定理 数论题 poj 1286 …
- ACM: 图论题 poj 2253 (poj上的dou…
- ACM: 图论题 poj 1135
- ACM: 图论题 BFS + STL + priority…
- ACM: 二分图最佳匹配 图论题 poj 3…
- ACM: 二分图最大匹配 图论题 poj 2…
- ACM: 图论题 poj 1161 (把图重建成…
- ACM: 图论题 poj 1789 (一次AC的水…
- QuickContactBadge的学习 快速关联联系人
- ACM: polay定理 数论题 poj 1286 …
- ACM: 回文串 dp题 poj 1159 (滚动…
- ACM: 匈牙利算法 图论题 poj 3020
- 心灵捕手观后感
- ACM: 匈牙利算法 图论题 poj 3041 …
- ACM: 匈牙利算法二分图 图论题 poj…
- ACM: 网络流 图论 poj 1459
- ACM: hash题 poj 2503
- ACM: 哈希暴力求解 哈希题 poj 184…
- ACM: 最小费用最大流 图论题 poj 2…
- ACM: K次最小费用最大流 图论题 po…
- ACM: 最小费用用最大流 图论题 poj…
- ACM: spfa求解 图论题 (对差分约束…