poj 1422 Air Raid(最小路径覆盖)

题目地址：点击打开链接

思路：每一个点差点分成两个，一个进一个出，那么显然二分图匹配，每一个点只能一

进一出，那么匹配出来的边的数量就是当前这个图上有多少条边可以缩成一个点，最小

路径覆盖 = 总点数n - 最大匹配.

此题为每个点单次经过，注意多次经过还需求一个传递闭包

代码：

#include<iostream>#include<cstdio>#include<cstring>#include<vector>using namespace std;const int maxn = 1e5+5;int vis[maxn], match[maxn], n, m;vector<int> g[maxn];bool dfs(int x){    for(int i = 0; i < g[x].size(); i++)    {        int to = g[x][i];        if(!vis[to])        {            vis[to] = 1;            if(!match[to] || dfs(match[to]))            {                match[to] = x;                return 1;            }        }    }    return 0;}int Hungary(){    memset(match, 0, sizeof(match));    int res = 0;    for(int i = 1; i <= n; i++)    {        memset(vis, 0, sizeof(vis));        res += dfs(i);    }    return res;}int main(void){    int t;    cin >> t;    while(t--)    {        for(int i = 0; i < maxn; i++)            g[i].clear();        scanf("%d%d", &n, &m);        while(m--)        {            int u, v;            scanf("%d%d", &u, &v);            g[u].push_back(v);        }        printf("%d\n", n-Hungary());    }    return 0;}

Air Raid

Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 8141 Accepted: 4877

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

2433 41 32 3331 31 22 3

Sample Output

21

Source

Dhaka 2002