Air Raid(匈牙利)
来源:互联网 发布:win10优化用什么软件好 编辑:程序博客网 时间:2024/06/06 01:12
Air Raid
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 5542 Accepted Submission(s): 3726
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.
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
#include<iostream>#include<cstdio>#include<cstring>using namespace std;int n, m, k;int ma[121][121];int v[121];int match[121];bool dfs(int u)//匈牙利算法{ for(int i=1;i<=n;i++) { if(v[i]==0&&ma[u][i]==1) { v[i] = 1; if(match[i]==-1||dfs(match[i])) { match[i] = u; return true; } } } return false;}int g(){ int sum = 0; memset(match, -1, sizeof(match)); for(int u=1;u<=n;u++) { memset(v, 0, sizeof(v)); if(dfs(u)) sum++; } return sum;}int main(){ int T; cin>>T; while(T--) { cin>>n>>m; memset(ma, 0, sizeof(ma)); for(int i=0;i<m;i++) { int a, b; cin>>a>>b; ma[a][b] = 1; } printf("%d\n", n - g());//总的数量-最大的匹配数 } return 0;}
- Air Raid(匈牙利)
- HDU 1151 Air Raid(匈牙利算法 二分图的最小路径覆盖 )
- POJ-1422-Air Raid-求最小路径覆盖(匈牙利算法)
- POJ 1422 Air Raid(二分图匹配+最小路径覆盖+匈牙利算法)
- POJ 1422 Air Raid(匈牙利算法—最小路径覆盖)
- Air Raid(二分匹配)
- Air Raid
- Air Raid
- Air Raid
- Air Raid
- Air Raid
- Air Raid
- Air Raid
- Air Raid
- Air Raid
- HDU 1151 Air Raid 最小路径覆盖,二分图匹配匈牙利算法(邻接表存关系)处理有向图
- poj 1422 Air Raid(匈牙利 DAC图最…
- POJ 1422 Air Raid 及 关于匈牙利算法的理解的小比喻
- MPAndroidChart的PieChart,渐变
- python基础2
- 移动数组指定关键字到数组的第一个
- android UiAutomator使用多线程监控手机内存和cpu使用并存入数据库中
- 《effective c++》学习笔记(一)
- Air Raid(匈牙利)
- Python的注释
- Log4j2 TcpSocketServer 日志集中打印
- Android开发 第13课 使用Intent实现页面跳转
- boyqian的CSDN博客第一篇
- SpringBoot+Maven添加本地jar包并package可执行jar包的方法
- 书摘|什么是大数定律
- 程序员常用的技术网站
- 算法面试题collect