poj 1422 Air Raid 最小路径覆盖 二分图匹配 解题报告
来源:互联网 发布:php预约系统源码 编辑:程序博客网 时间:2024/05/07 04:22
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
思路:最小路径覆盖 = 节点数 - 最大匹配数
代码:
#include <cstdio>#include <cstring>#include <iostream>#include <algorithm>#define INF 0x3f3f3f3f#define MAXN 220#define MAXM 220using namespace std;int map[MAXN][MAXN];int vis[MAXN], use[MAXN];int n, m, t, v;int find(int x){ for(int j = 1; j <= n; j++) { if(map[x][j] && !vis[j]) { vis[j] = 1; if(use[j] == 0 || find(use[j]) == 1) { use[j] = x; return 1; } } } return 0;}int maxP(){ int sum = 0; memset(use, 0, sizeof(use)); for(int i = 1; i <= n; i++) { memset(vis, 0, sizeof(vis)); if(find(i)) sum++; } return sum;}int main(){ int T; scanf("%d", &T); while(T--) { scanf("%d%d", &n, &m); memset(map, 0, sizeof(map)); for(int i = 1; i <= m; i++) { scanf("%d%d", &t, &v); map[t][v] = 1; } printf("%d\n", n - maxP()); } return 0;}
0 0
- poj 1422 Air Raid 最小路径覆盖 二分图匹配 解题报告
- pku 1422 Air Raid 最小路径覆盖图 解题报告
- POJ-1422-Air Raid (二分图 最小路径覆盖)
- 【二分图|最小路径覆盖】POJ-1422 Air Raid
- POJ 1422 Air Raid 最小路径覆盖(二分图匹配)
- poj 1422 Air Raid(最小路径覆盖 + 二分图最大匹配)
- POJ 1422Air Raid(二分图最大匹配之最小路径覆盖)
- POJ 1422 Air Raid(二分图匹配最小路径覆盖)
- hdu 1151 &&poj 1422 Air Raid (二分图匹配 最小路径覆盖)
- POJ 1422 Air Raid(二分图匹配+最小路径覆盖+匈牙利算法)
- 最小路径覆盖(二分图最大匹配):Air Raid
- hdu 1151 Air Raid(二分图匹配--最小路径覆盖)
- [POJ]1422-Air Raid(最小路径覆盖)
- poj 1422Air Raid--最小路径覆盖
- poj 1422 Air Raid 最小路径覆盖
- poj 1422 Air Raid(最小路径覆盖)
- poj 1422 Air Raid(最小路径覆盖)
- poj 1422 Air Raid(最小路径覆盖)
- 基于Azure搭建PredictionIO和Spark的推荐引擎服务
- MySQL生产库主从重新同步操作注意事项
- Linux释放内存脚本
- 利用Navicat实现MySQL数据库结构对比和同步
- 循环矩阵的Matlab代码验证
- poj 1422 Air Raid 最小路径覆盖 二分图匹配 解题报告
- LeetCode | Pow(x, n)
- MariaDB10自动化安装部署
- MySQL只恢复某个库或某张表
- MariaDB多源复制环境搭建(多主一丛)
- 如何解决Sublime Text 3不能正确显示中文的问题
- MariaDB与MySQL在一台服务器同时运行
- 前端速学成财:第十四课-实战演练:用gulp+webpack构建用户登录(1)
- MySQL主从同步校验与重新同步