杭电1151 Air Raid
来源:互联网 发布:淘宝买东西后店铺消失 编辑:程序博客网 时间:2024/05/19 05:05
先把每个路口都放上兵,然后求出最大的匹配数,即可以连在一起的路口,然后用所有的路口数减去最大匹配数就可以了!!
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<iostream>
using namespace std;
bool map[122][122],visit[122];
int match[122];
int m;
bool dfs(int k)
{
int i;
for(i=1;i<=m;i++)
{
if(map[k][i] && !visit[i])
{
visit[i]=true;
if(match[i]==-1 || dfs(match[i]))
{
match[i]=k;
return true;
}
}
}
return false;
}
int main()
{
int n,k,a,b;
int s,i;
scanf("%d",&n);
while(n--)
{
s=0;
memset(map,false,sizeof(map));
memset(match,-1,sizeof(match));
scanf("%d",&m); //几个路口
scanf("%d",&k); //几条路
while(k--)
{
scanf("%d%d",&a,&b);
map[a][b]=true;
}
for(i=1;i<=m;i++)
{
memset(visit,false,sizeof(visit));
if(dfs(i))
s++;
}
s=m-s;
printf("%d\n",s);
}
return 0;
}
- 杭电1151 Air Raid
- 【二分图+简单题】杭电 hdu 1151 Air Raid
- 杭电 hdu 1151 Air Raid (二分匹配 + 最小路径覆盖)
- hdoj 1151 Air Raid
- HDOJ 1151 Air Raid
- hdoj 1151 Air Raid
- hdu 1151 Air Raid
- hdu 1151 Air Raid
- HDU 1151 Air Raid
- HDU 1151Air Raid
- Hdu 1151 - Air Raid
- HDOJ 1151 Air Raid
- hdu 1151 Air Raid
- hdoj 1151 Air Raid
- HD 1151Air Raid
- 【POJ 1151】Air Raid
- hdu 1151 Air Raid
- hdu 1151 Air Raid
- 创新还是等死?新版微信引发运营商内部激辩
- 导图 SQL Server之事务
- 指针运算——算术运算、关系运算
- SqlServer字段类型详解
- Android开发—数据库应用—访问数据表(SQLite OpenHelper) —添加检索操作(Retrieve)
- 杭电1151 Air Raid
- 文件上传对应的一个Servlet类
- 互联网大佬生存法则:如何防守周鸿祎?
- 为什么付费用户才是“最好”的用户
- C#和JAVA中的构造器的详解
- Windows2008 IIS7+PHP 5.3.5配置PHP图解
- 线程间通讯《代码》pthread_cond_wait/signal
- 引用类型的赋值、浅拷贝和深拷贝的区别
- 各种游戏特效(持续更新)