POJ1422 Air Raid 【DAG最小路径覆盖】
来源:互联网 发布:淘宝店首页装修教程 编辑:程序博客网 时间:2024/05/17 08:13
Air Raid
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 6763 Accepted: 4034
Description
Consider a town where all the streets are one-way and each street leads from one intersection to another. It is also known that starting from an intersection and walking through town's streets you can never reach the same intersection i.e. the town's streets form no cycles.
With these assumptions your task is to write a program that finds the minimum number of paratroopers that can descend on the town and visit all the intersections of this town in such a way that more than one paratrooper visits no intersection. Each paratrooper lands at an intersection and can visit other intersections following the town streets. There are no restrictions about the starting intersection for each paratrooper.
With these assumptions your task is to write a program that finds the minimum number of paratroopers that can descend on the town and visit all the intersections of this town in such a way that more than one paratrooper visits no intersection. Each paratrooper lands at an intersection and can visit other intersections following the town streets. There are no restrictions about the starting intersection for each paratrooper.
Input
Your program should read sets of data. The first line of the input file contains the number of the data sets. Each data set specifies the structure of a town and has the format:
no_of_intersections
no_of_streets
S1 E1
S2 E2
......
Sno_of_streets Eno_of_streets
The first line of each data set contains a positive integer no_of_intersections (greater than 0 and less or equal to 120), which is the number of intersections in the town. The second line contains a positive integer no_of_streets, which is the number of streets in the town. The next no_of_streets lines, one for each street in the town, are randomly ordered and represent the town's streets. The line corresponding to street k (k <= no_of_streets) consists of two positive integers, separated by one blank: Sk (1 <= Sk <= no_of_intersections) - the number of the intersection that is the start of the street, and Ek (1 <= Ek <= no_of_intersections) - the number of the intersection that is the end of the street. Intersections are represented by integers from 1 to no_of_intersections.
There are no blank lines between consecutive sets of data. Input data are correct.
no_of_intersections
no_of_streets
S1 E1
S2 E2
......
Sno_of_streets Eno_of_streets
The first line of each data set contains a positive integer no_of_intersections (greater than 0 and less or equal to 120), which is the number of intersections in the town. The second line contains a positive integer no_of_streets, which is the number of streets in the town. The next no_of_streets lines, one for each street in the town, are randomly ordered and represent the town's streets. The line corresponding to street k (k <= no_of_streets) consists of two positive integers, separated by one blank: Sk (1 <= Sk <= no_of_intersections) - the number of the intersection that is the start of the street, and Ek (1 <= Ek <= no_of_intersections) - the number of the intersection that is the end of the street. Intersections are represented by integers from 1 to no_of_intersections.
There are no blank lines between consecutive sets of data. Input data are correct.
Output
The result of the program is on standard output. For each input data set the program prints on a single line, starting from the beginning of the line, one integer: the minimum number of paratroopers required to visit all the intersections in the town.
Sample Input
2433 41 32 3331 31 22 3
Sample Output
21
Source
Dhaka 2002
对于DAG,求最小路径覆盖有如下公式:最小路径覆盖数 = 节点数 - 对应的二分图最大匹配数。
用电脑自带的画图画了张草图,挫爆了 -_-!
题意:输入数据详解,t组数据,n个节点(从1开始),m条有向边,u到v。
题解:套公式。
#include <stdio.h>#include <string.h>const int maxn = 125;int n, m;int cx[maxn], cy[maxn];bool visy[maxn], G[maxn][maxn];void getMap() { memset(G, 0, sizeof(G)); int u, v; scanf("%d%d", &n, &m); while(m--) { scanf("%d%d", &u, &v); G[u][v] = true; }}int findPath(int x) { int i; for(i = 1; i <= n; ++i) { if(G[x][i] && !visy[i]) { visy[i] = 1; if(cy[i] == -1 || findPath(cy[i])) { cy[i] = x; return 1; } } } return 0;}int MaxMatch() { int ans = 0, i; memset(cx, -1, sizeof(cx)); memset(cy, -1, sizeof(cy)); for(i = 1; i <= n; ++i) { memset(visy, 0, sizeof(visy)); if(cx[i] == -1) ans += findPath(i); } return ans;}void solve() { printf("%d\n", n - MaxMatch());}int main() { // freopen("stdin.txt", "r", stdin); int t; scanf("%d", &t); while(t--) { getMap(); solve(); } return 0;}
0 0
- POJ1422 Air Raid 【DAG最小路径覆盖】
- poj1422 zoj1525 Air Raid 最小路径覆盖
- POJ1422-Air Raid(最小路径覆盖)
- 最小路径覆盖 poj1422 Air Raid
- Air Raid POJ1422 & HDU1151 最小路径覆盖
- Air Raid 【DAG 最小路径覆盖】
- POJ1422 Air Raid【二分图最小路径覆盖】
- hdu 1151 Air Raid DaG 图的最小路径覆盖
- POJ 1422 Air Raid(DAG最小路径覆盖)
- hdu 1151 Air Raid(DAG最小路径覆盖)
- hdu1151 Air Raid,DAG图的最小路径覆盖
- hdu 1151 Air Raid 【DAG最小路径覆盖】
- POJ 1422 Air Raid(DAG最小路径覆盖)
- hdu 1151 Air Raid DAG最小路径覆盖
- HDU 1151 Air Raid(DAG上的最小路径覆盖)
- POJ 1422 Air Raid(DAG最小路径覆盖)
- poj1422 Air Raid 最小路径覆盖=顶点数-最大匹配数
- POJ1422——Air Raid(二分图,最小路径覆盖)
- android中webview加载本地html并且相互交互
- Sundy嵌入式底层开发课程笔记2 --linux命令类库机制及常用命令
- 【后端】Popush后端添加对Haskell语言的支持
- gdb学习step by step
- 常用的CL6x编译选项
- POJ1422 Air Raid 【DAG最小路径覆盖】
- C《贪吃蛇》简易字符版
- 苹果推送 pem证书的生成
- html之js-1
- JavaScript学习笔记之JavaScript代码在HTML页面中的位置
- hdu 1021
- 茁壮网络C语言开发笔试
- java开发中JDBC连接数据库代码和步骤详解
- Effective C++ 读书笔记 条款32:确定你的public继承塑模出is-a关系