hdu 1151 Air Raid DAG最小路径覆盖
2016-03-21 19:29
393 查看
[align=left]Problem Description[/align]
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.
[align=left]Input[/align]
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.
[align=left]Output[/align]
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.
[align=left]Sample Input[/align]
[align=left]Sample Output[/align]
最小路径覆盖数 = 顶点数 - 最大匹配数
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.
[align=left]Input[/align]
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.
[align=left]Output[/align]
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.
[align=left]Sample Input[/align]
2 4 3 3 4 1 3 2 3 3 3 1 3 1 2 2 3
[align=left]Sample Output[/align]
2 1
最小路径覆盖数 = 顶点数 - 最大匹配数
#include<iostream> #include<algorithm> #include<cstring> #include<vector> #include<cstdio> #include<cstdlib> using namespace std; vector<int> g[1505]; bool visited[1505]; int linker[1505];//记录与当前节点相连的结点 int n;//图的结点个数 bool dfs(int u) { for(int i=0;i<g[u].size();i++) if(!visited[g[u][i]]) { visited[g[u][i]]=1; if(linker[g[u][i]]==-1||dfs(linker[g[u][i]])) { linker[g[u][i]]=u; return true; } } return false; } int hungary()//匈牙利算法,返回最大匹配数的2倍 { int num=0; memset(linker,-1,sizeof(linker)); for(int u=1;u<=n;u++) { memset(visited,0,sizeof(visited)); if(dfs(u)) num++; } return num; } int main() { int T; cin>>T; while(T--) { for(int i=1;i<=1500;i++) g[i].clear(); int m; cin>>n>>m; for(int i=0;i<=m-1;i++) { int a,b; cin>>a>>b; g[a].push_back(b); } cout<< n-hungary()<<endl; } return 0; }
相关文章推荐
- Rails中使用邮箱验证及激活用户
- Dsamain
- rails 路由设置 无法匹配 小数点
- rails中select_tag的用法小结
- rails调试
- Rails插件之ckeditor
- Rails插件之byebug
- LeetCode 70 Climbing Stairs
- 简单AIDS的源码学习 <utils.c>
- [LeetCode]-DataBase-Delete Duplicate Emails
- strong,weak,assign,retain,copy区别与联系
- [LeetCode]-DataBase-Duplicate Emails
- async & await 的前世今生
- async 和 await 的异步处理
- Traits技术初探
- 循环 retain 问题
- 事务配置不对导致:•Could not obtain transaction-synchronized Session for current thread
- lightoj 1038-Race to 1 Again 期望类DP
- [LeetCode][智力题]Climbing Stairs
- 说说我们的通用型人工智能