HDU---1151-Air Raid(二分图)(HDU-1150)(POJ-3041)

原创 2015年11月17日 19:11:19

D - Air Raid
Time Limit:1000MS     Memory Limit:10000KB     64bit IO Format:%I64d & %I64u

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


二分图:

最小点覆盖数=最大匹配数


增广路:

  若P是图G中一条连通两个未匹配顶点的路径,并且属于M的边和不属于M的边(即已匹配和待匹配的边)在P上交替出现,则称P为相对于M的一条增广路径。

 

 由增广路的定义可以推出下述三个结论:

   1、P的路径个数必定为奇数,第一条边和最后一条边都不属于M。

   2、将M和P进行取反操作可以得到一个更大的匹配M’

   (反操作:把P中的 匹配边 与 非匹配边 互换)

   3、M为G的最大匹配当且仅当不存在M的增广路径P

本题:

最小路径覆盖=图的顶点数-最大匹配数

#include <cstring>
#include <cstdio>
#include <algorithm>
#include <iostream>
using namespace std;
bool map[505][505];
bool vis[505];
int link[505];
int m,n,gil,boy;
bool DFS(int x)
{
    for(int y=1; y<=n; ++y)
    {
        if(!vis[y] && map[x][y])
        {
            vis[y]=1;
            if(!link[y] || DFS(link[y]))
            {
                link[y]=x;
                return 1;
            }
        }
    }
    return 0;
}
int main()
{
    int i,j,k;
    int x,y;
    int T;
    cin>>T;
    while(T--)
    {
        scanf("%d%d",&n,&m);
        memset(map,0,sizeof(map));
        memset(link,0,sizeof(link));
        int sum=0,poi;
        for(i=0; i<m; ++i)
        {
            scanf("%d%d",&x,&y);
            map[x][y]=1;
        }
        for(x=1; x<=n; ++x)
        {
            memset(vis,0,sizeof(vis));
            if(DFS(x))
                ++sum;
        }
        printf("%d\n",n-sum);
    }
    return 0;
}





版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

HDU1151_Air Raid(二分图/最小路径覆盖=n-最大匹配)

解题报告 题目传送门 题意: 一个小镇,所有的街道都是单向的,这些街道都是从一个十字路口通往另一个十字路口,已知从任何十字路口出发,沿着这些街道行走,都不能回到同一个十字路口,也就是说不存在回路。 计...

HDU 1151 Air Raid 最小路径覆盖,二分图匹配匈牙利算法(邻接表存关系)处理有向图

题目地址:http://acm.hdu.edu.cn/showproblem.php?pid=1151 Air Raid Time Limit: 2000/1000 MS (Java/Others)...

hdu 1151 Air Raid(二分图匹配--最小路径覆盖)

Air Raid Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total...

HDU 1151 Air Raid 二分图最小边覆盖

题意:在一个城镇,有m个路口,和n条路,这些路都是单向的,而且路不会形成环,现在要弄一些伞兵去巡查这个城镇,伞兵只能沿着路的方向走,问最少需要多少伞兵才能把所有的路口搜一遍。(这个题意摘自题目的Dis...
  • NMfloat
  • NMfloat
  • 2016年02月19日 17:33
  • 292

二分图水题整理 Poj 2060 + 1466 + 2771 + hdu 1150 + 1151

Poj 2060 Taxi Cab Scheme 题意:在一个矩形城市里面,有间出租车公司收到翌日的预订行程M个,每个给出起点、终点坐标,两个地点之间的车程就是那两个点之间的曼哈顿距离,...

HDU_Steps6.3 二分图 HDU1054 HDU1068 HDU1150 HDU1151 HDU1498 HDU1528 HDU1507 HDU2768

6.3.1  HDU1054 Strategic Game 给出一颗树,如果一个点被覆盖,则与他相连的边都被覆盖,求最少需要多少个点来覆盖这颗树,二分图和树形DP都可以解决,DP会更快一些 DP算...
  • swm8023
  • swm8023
  • 2011年10月21日 03:21
  • 1216

HDOJ 题目1151 Air Raid(二分图,最小路径覆盖)

Air Raid Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total...

hdu 1151 Air Raid (二分匹配,最小路径覆盖)

Problem Description Consider a town where all the streets are one-way and each street leads from on...

杭电 hdu 1151 Air Raid (二分匹配 + 最小路径覆盖)

杭电   hdu  1151   Air Raid  (二分匹配 + 最小路径覆盖) Air Raid Time Limit: 2000/1000 MS (Java/O...

hdu1151Air Raid (二分匹配,最小路径覆盖)

Problem Description Consider a town where all the streets are one-way and each street leads from on...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:HDU---1151-Air Raid(二分图)(HDU-1150)(POJ-3041)
举报原因:
原因补充:

(最多只允许输入30个字)