POJ 1422 Air Raid
2016-05-03 19:30
615 查看
Language: Default Air Raid
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. 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. 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 2 4 3 3 4 1 3 2 3 3 3 1 3 1 2 2 3 Sample Output 2 1 |
把一个点拆成出和入两个点,那么在原图中出度,入度为1就可以轻松转化成二分图。那么就变成了最小路径覆盖=节点数-最大匹配,这样就可以运用匈牙利算法进行二分图匹配了。
【代码】
#include <cstdio> #include <cstring> using namespace std; #define M(a) memset(a,0,sizeof a) #define F(i,j,k) for (int i=j;i<=k;++i) int map[501][501],match[501],vis[501],line[501][501],n,m; bool find(int x) { F(i,1,n) if (line[x][i]&&vis[i]==0){ vis[i]=1; if (!match[i]||find(match[i])){ match[i]=x; return true; } } return false; } int main() { while (scanf("%d%d",&n,&m)==2){ M(map); M(line); M(match); M(vis); if (n==0&&m==0) return 0; F(i,1,n)F(j,1,n) map[i][j]=5000; F(i,1,m){ int u,v; scanf("%d%d",&u,&v); map[u][v]=1; } F(k,1,n)F(i,1,n)F(j,1,n) if (map[i][k]+map[k][j]<map[i][j]) map[i][j]=map[i][k]+map[k][j]; F(i,1,n)F(j,1,n)if (map[i][j]<5000&&i!=j) line[i][j]=1; int ans=0; F(i,1,n){M(vis); if(find(i)) ans++;} printf("%d\n",n-ans); } }
相关文章推荐
- Air Infomation System 基于控制台的航班信息系统(方法总结)
- Intel S5000VSA(SAS)主板设置RAID 步骤【转】
- linker command failed with exit code 1 (use -v to see invocation)
- WM_PAINT 消息与 OnDraw、OnPaint()
- IDEA快捷键 如syso(sout Tab键)main(psvm Tab键)
- CodeForces 616E Sum of Remainders(数论)
- 山东省第一届ACM大学生程序设计竞赛 Fairy tale 大模拟
- samba “The specified network name is no longer available” 出错的解决办法
- 利用正则表达式:找到一段字符串中所有的IP地址和Email地址
- TensorFlow教程02:针对机器学习初学者的MNIST实验——Softmax回归
- mac上google chrome helper占内存,mac air 发热
- rails路由全解
- 在foxmail和outlook中设置QQ邮箱、gmail邮箱、新浪邮箱、微软邮箱、网易邮箱等的方法
- 【STL】SGI STL私房菜:_type_traits
- Failure to transfer org.apache.maven:maven-archiver:jar:x.x from https://repo.maven.apache.org/maven
- Rails技巧之tap&try
- androidStudio-importProject异常-Error:(1, 0) Your project path contains non-ASCII characters.
- HDU 4300 Clairewd’s message(扩展kmp)
- RAID磁盘利用率详解
- Software caused connection abort: recv failed