hdu 1151 Air Raid(DAG最小路径覆盖)
来源:互联网 发布:使用管家婆存入软件 编辑:程序博客网 时间:2024/04/30 21:38
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1151
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
Source
Asia 2002, Dhaka (Bengal)
DAG最小路径覆盖=顶点数-最大匹配
代码:
#include<stdio.h>#include<string.h>const int maxn=505;int mp[maxn][maxn],cx[maxn],cy[maxn],vis[maxn];int nx,ny,n,m;int find(int u){ for(int i=1;i<=ny;i++) { if(mp[u][i]&&!vis[i]) { vis[i]=1; if(cy[i]==-1||find(cy[i])) { cy[i]=u; cx[u]=i; return 1; } } } return 0;}void match(){ int res=0; memset(cx,-1,sizeof(cx)); memset(cy,-1,sizeof(cy)); for(int i=1;i<=nx;i++) { if(cx[i]==-1) { memset(vis,0,sizeof(vis)); res+=find(i); } } //printf("res=%d ",res); printf("%d\n",n-res);}int main(){ //freopen("in.txt","r",stdin); int t; scanf("%d",&t); while(t--) { memset(mp,0,sizeof(mp)); scanf("%d %d",&n,&m); nx=n; ny=n; while(m--) { int a,b; scanf("%d %d",&a,&b); mp[a][b]=1; } match(); } return 0;}
0 0
- hdu 1151 Air Raid(DAG最小路径覆盖)
- hdu 1151 Air Raid DaG 图的最小路径覆盖
- hdu 1151 Air Raid 【DAG最小路径覆盖】
- hdu 1151 Air Raid DAG最小路径覆盖
- HDU 1151 Air Raid(DAG上的最小路径覆盖)
- POJ1422 Air Raid 【DAG最小路径覆盖】
- Air Raid 【DAG 最小路径覆盖】
- hdu 1151 Air Raid最小路径覆盖
- hdu 1151 Air Raid (最小路径覆盖)
- HDU 1151 Air Raid( 最小路径覆盖 )
- hdu 1151 Air Raid ( 最小路径覆盖 )
- Air Raid hdu 1151 最小路径覆盖
- [hdu 1151] Air Raid(最小路径覆盖)
- HDU 1151 Air Raid 最小路径覆盖
- HDU 1151 Air Raid【最小路径覆盖】
- HDU 1151 Air Raid (最小路径覆盖)
- HDU 1151 Air Raid( 最小路径覆盖)
- [HDU 1151] Air Raid 最小路径覆盖
- 在viewpager中使用FragmentPagerAdapter实现分页
- 【索引】Volume 2. Data Structures
- QThread与QWidget使用
- view的setTag() 和 getTag()应用
- 基于连通性的状态压缩DP
- hdu 1151 Air Raid(DAG最小路径覆盖)
- 【索引】Volume 3. Brute Force
- matlab 运行报错, license Manager error -103 Terminal server client not allowed
- C/C++学习笔记26:(一)C文件系统概述
- 【索引】String
- c语言
- 【九度OJ】1028【快排】【kruskal】【畅通工程系列2008】
- 实习的第一个月
- 【索引】Big Number