hdu3861

强连通加最小路劲覆盖。

#include<cstdio>
#include<stack>
#include<algorithm>
#include<cstring>
#include<vector>
using namespace std;
int n,m;
struct node{
	int to;
	int next;
	node(){
	}
	node(int a,int b):to(a),next(b){
	}
}edge[100000*2+10];
vector<int>G[5005*2];
int head[5005];
int low[5005],dfn[5005],vis[5005],clo[5005],match[5005];
int tot,ti,cnt;
stack<int>s;
void add(int u,int v)
{
	edge[tot] = node(v,head[u]);
	head[u] = tot++;
}
void tarjan(int u)
{
	dfn[u] = ++ti;
	low[u] = ti;
	vis[u] = 1;
	s.push(u);
	for(int i=head[u];i!=-1;i=edge[i].next)
	{
		int v = edge[i].to;
		if(!vis[v]) {
			tarjan(v);
			low[u] = min(low[u],low[v]);
		}
		else if(vis[v]==1)
		low[u] = min(low[u],dfn[v]);
	}
	if(dfn[u]==low[u])
	{
		cnt++;
		int y;
		do{
			y = s.top();
			clo[y] = cnt;
			vis[y] = 2;
			s.pop();
		}while(y!=u);
	}
}
bool dfs(int u)
{
	vis[u] = 1;
	int len = G[u].size();
	for(int i=0;i<len;i++)
	{
		int v = G[u][i];
		int w = match[v];
		if(w<0||!vis[w]&&dfs(w)){
		//	match[u] = v;
			match[v] = u;
			return true;
		}
	}
	return false;
}
int main()
{
	int cases,u,v;
	scanf("%d",&cases);
	while(cases--)
	{
		tot = 0;
		ti = 0;
		cnt = 0;
		memset(head,-1,sizeof(head));
		scanf("%d%d",&n,&m);
		for(int i=0;i<m;i++)
		{
			scanf("%d%d",&u,&v);
			add(u,v);
		}
		memset(low,0,sizeof(low));
		memset(dfn,0,sizeof(dfn));
		memset(vis,0,sizeof(vis));
		for(int i=1;i<=n;i++) G[i].clear();
		for(int i=1;i<=n;i++) if(!vis[i])  tarjan(i);
		for(int i=1;i<=n;i++)
		{
			for(int j=head[i];j!=-1;j=edge[j].next)
			{
				int to = edge[j].to;
				if(clo[to]!=clo[i]){
					G[clo[i]].push_back(clo[to]);
				}
			}
		}
		int res = 0;
		memset(match,-1,sizeof(match));
		for(int i=1;i<=cnt;i++){
			if(match[i]<0){
				memset(vis,0,sizeof(vis));
				if(dfs(i)){
					res++;
				}
			}
		}
		printf("%d\n",cnt-res);
	}
	return 0;
}