【图算法之二分图】HDU 1151---Air Raid
来源:互联网 发布:jquery.js文件下载 编辑:程序博客网 时间:2024/05/16 17:51
Air Raid
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3358 Accepted Submission(s): 2207
Problem 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<stdio.h>#include<string.h>int map[501][501],flag[501],pre[501],n,m;int get(int i){ int j,k,l; for(j=1;j<=m;j++) { if(map[i][j]&&flag[j]==0) { flag[j]=1; if(pre[j]==-1||get(pre[j])) { pre[j]=i; return 1; } } } return 0;}int main(){ int num,l,r,i,k; scanf("%d",&num); while(num--) { memset(map,0,sizeof(map)); memset(pre,-1,sizeof(pre)); scanf("%d%d",&m,&n); for(i=0;i<n;i++) { scanf("%d%d",&l,&r); map[l][r]=1; } int sum=0; for(int i=1;i<=m;i++) { memset(flag,0,sizeof(flag)); sum+=get(i); } printf("%d\n",m-sum); } return 0;}
0 0
- 【图算法之二分图】HDU 1151---Air Raid
- hdu 1151 Air Raid 二分图匹配
- HDU---1151-Air Raid(二分图)(HDU-1150)(POJ-3041)
- 【图算法之二分图】HDU1151---Air Raid
- HDU 1151 Air Raid(匈牙利算法 二分图的最小路径覆盖 )
- 【二分图+简单题】杭电 hdu 1151 Air Raid
- HDU 1151 Air Raid 二分图的最小路径覆盖
- HDU 1151 Air Raid 【二分图+增广路】
- HDU 1151 Air Raid(二分图最大匹配)
- hdu 1151 Air Raid(二分图匹配--最小路径覆盖)
- HDU 1151 Air Raid 二分图最小边覆盖
- hdu 1151 Air Raid (二分匹配)
- hdu 1151 Air Raid (二分匹配)
- 【二分图匹配(最小路径覆盖)】hdu 1151 Air Raid
- hdu 1151 &&poj 1422 Air Raid (二分图匹配 最小路径覆盖)
- HDOJ 1151 ——Air Raid 二分图匹配
- HDOJ 1151 Air Raid(二分图最小路径覆盖)
- HDU 1151 Air Raid 最小路径覆盖,二分图匹配匈牙利算法(邻接表存关系)处理有向图
- ACM之歌
- 素数求和问题
- c++ 使用TinyXML 读取xml数据
- linux 命令
- 判断整数转化为2进制之后1的个数
- 【图算法之二分图】HDU 1151---Air Raid
- ios设置小图标
- POJ 3264 RMQ Spare Table算法
- 面试知识点总结、积累
- HDU 1150 Machine Schedule(最小点覆盖)
- 结队开发之多storyboard
- hdu 3879 hdu 3917 构造最大权闭合图 俩经典题
- poj 1236
- [C++] vector数组越届及关于引用的