POJ 1422 Air Raid

Air Raid

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 6223		Accepted: 3724

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

Source

Dhaka 2002

 

【题目大意】：

      有n个点和m条有向边，现在要在点上放一些伞兵，然后伞兵沿着图走，直到不能走为止每条边只能是一个伞兵走过，问最少放多少个伞兵

【分析】：

      最小路径覆盖类型。代码给出的是用DINIC跑的二分图

【代码】：

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<algorithm>
#include<iostream>
#include<vector>
#include<stack>
#include<queue>
using namespace std;
#define IMAX 21474836
#define MAXN 130
#define MAXQ 100001
int DATA,N,M,map[2*MAXN][2*MAXN],dist[2*MAXN],ans=0;
int Q[MAXQ];
bool group()
{
      int right=1;
      for(int i=0;i<=2*N+1;i++)
            dist[i]=IMAX;
      dist[0]=0;
      Q[1]=0;
      for(int i=1;i<=right;i++)
      {
            int now=Q[i];
            for(int j=0;j<=2*N+1;j++)
            {
                  if(map[now][j] && dist[now]+1<dist[j])
                  {
                        dist[j]=dist[now]+1;
                        Q[++right]=j;
                        if(j==2*N+1)   return true;
                  }
            }
      }
      return false;
}
int DINIC(int now,int flow)
{
      int cnt=0;
      if(flow==0)   return 0;
      if(now==2*N+1)  
            return flow;
      for(int i=0;i<=2*N+1;i++)
      {
            int now1;
            if(dist[now]+1==dist[i] && map[now][i] && (now1=DINIC(i,min(map[now][i],flow))))
            {
                  map[now][i]-=now1;
                  map[i][now]+=now1;
                  return now1;
            }
      }
      return 0;
}
int main()
{
      //freopen("input.in","r",stdin);
	  //freopen("output.out","w",stdout); 
	  scanf("%d",&DATA);
	  for(int data=1;data<=DATA;data++)
	  {
            ans=0;
            memset(map,0,sizeof(map));
            scanf("%d",&N);
            scanf("%d",&M);
            for(int i=1;i<=M;i++)
            {
                  int A,B;
                  scanf("%d%d",&A,&B);
                  map[A][B+N]=1;
            }
            for(int i=1;i<=2*N;i++)
            {
                  if(i<=N)   map[0][i]=1;
                  if(i>N)    map[i][2*N+1]=1;
            }
            while(group())
            {
                  int now;
                  while(now=DINIC(0,IMAX))
                        ans+=now;
            }
            printf("%d\n",N-ans);
      } 
	  //system("pause");
      return 0;
}

 

转载注明出处： http://blog.csdn.net/u011400953