hdu 1151 Air Raid(二分图最小路径覆盖)
http://acm.hdu.edu.cn/showproblem.php?pid=1151
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 7469 | Accepted: 4451 |
Description
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
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
Sample Input
2
4
3
3 4
1 3
2 3
3
3
1 3
1 2
2 3
Sample Output
2
1 最小路径覆盖 = 总点数 - 最大匹配数
最小路径覆盖:
用最少的路径覆盖所有点(把有向图转化为二分图+无向边):
(前提是没有环的有向图)转化为二分图后既为无向边,从左边点到右边点表示了方向。
最终找到的匹配边对,代表了右边的点可以由其他未被选中的右边序号的点所到达,
因此,用总点数-匹配的对数 = 需要作为出发的点数。
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<stdlib.h>
#include<algorithm>
#define N 310
#define INF 0x3f3f3f3f using namespace std; int G[N][N], vis[N], used[N];
int n; bool Find(int u)
{
int i;
for(i = ; i <= n ; i++)
{
if(!vis[i] && G[u][i])
{
vis[i] = ;
if(!used[i] || Find(used[i]))
{
used[i] = u;
return true;
}
}
}
return false;
} int main()
{
int m, i, a, b, t, ans;
scanf("%d", &t);
while(t--)
{
ans = ;
memset(G, , sizeof(G));
scanf("%d%d", &n, &m);
while(m--)
{
scanf("%d%d", &a, &b);
G[a][b] = ;
}
memset(used, , sizeof(used));
for(i = ; i <= n ; i++)
{
memset(vis, , sizeof(vis));
if(Find(i))
ans++;
}
printf("%d\n", n - ans);
}
return ;
}
最新文章
- 高仿QQ顶部控件之IOS SegmentView
- sed笔记
- OpenSSH远程拒绝服务漏洞
- MyEclipse设置默认的文档注释
- this指针与function变量--this究竟指向哪里?
- mysql外键使用和级联
- WCF技术剖析之二十七: 如何将一个服务发布成WSDL[基于WS-MEX的实现](提供模拟程序)
- 前端资讯周报 2.27 - 3.5: 如何设计一个优秀的HTML接口,深入理解line-height
- (译文)掌握JavaScript基础--理解this关键字的新思路
- Eclipse debug Source not found
- json 解析错误的问题
- web理论知识--网页访问过程(附有Django的web项目访问流程)
- textarea 中的换行符
- Python 字符串拼接 sql ,造成 sql 注入例子
- ZJOI 2019 划水记
- cf 1132 F
- python3_字符串
- python3的unittest中使用test suite(测试套件)执行指定测试用例
- 第一章-硬件组成及linux发展历史(1)
- 爬虫利器_you-get
热门文章
- C++中关于指针初始化和使用NULL的理解
- poj 2886 Who Gets the Most Candies?(线段树和反素数)
- Android_PendingIntent的使用
- 用socket方式传输Image和Sound文件
- POJ 3259 Wormholes 虫洞(负权最短路,负环)
- 给你一个承诺 - 玩转 AngularJS 的 Promise(转)
- Dataguard三种保护模式
- 【转】.. Android应用内存泄露分析、改善经验总结
- Android ListView从网络获取图片及文字显示
- 【LeetCode 215】Kth Largest Element in an Array