Hdu 3549 Flow Problem - 最大流

题目描述：裸的最大流

题目分析：在刷UVa-11248-Frequency Hopping，一直wa，就拿这道题目来检测一下自己写的Dinic算法的正确性（其实就是对着书敲了一遍）。题目是AC了，但是耗时严重啊，贴一下代码，囧。

下面是代码：

#include <cstdio>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
using namespace std;

const int inf = 999999999;
const int maxn_v = 20;
const int maxn_e = 2000;
struct edge
{
	int from,to,cap,flow;
	edge() {}
	edge(int f,int o,int cp,int fl): from(f),to(o),cap(cp),flow(fl){}
};

vector<edge> E;
vector<int> G[maxn_v];
int d[maxn_v],cur[maxn_e];
bool vis[maxn_v];
int T,n,m;
int s,t;

void add_e(int from,int to,int cap)
{
	E.push_back(edge(from,to,cap,0));
	E.push_back(edge(to,from,0,0));
	int e = E.size();
	G[from].push_back(e-2);
	G[to].push_back(e-1);
}

bool bfs()
{
	memset(vis,0,sizeof(vis));
	queue<int> Q;
	Q.push(s);
	vis[s] = 1;
	d[s] = 0;
	while(!Q.empty())
	{
		int u = Q.front(); Q.pop();
		for(int i = 0; i < G[u].size(); i++)
		{
			edge& e = E[G[u][i]];
			int v = e.to;
			if(!vis[v] && e.cap > e.flow)
			{
				vis[v] = 1;
				d[v] = d[u] + 1;
				Q.push(v);
			}
		}
	}
	return vis[t];
}
int dfs(int u,int a)
{
	if(u == t || a == 0) return a;
	int flow = 0,f;
	for(int& i = cur[u]; i < G[u].size(); i++)
	{
		edge& e = E[G[u][i]];
		int v = e.to;
		if(d[v] == d[u] + 1 && (f = dfs(v,min(a,e.cap-e.flow))) > 0)
		{
			e.flow += f;
			E[G[u][i]^1].flow -= f;
			flow += f;
			a -= f;
			if(a == 0) break;
		}
	}
	return flow;
}
int max_flow()
{
	int maxflow = 0;
	while(bfs())
	{
		memset(cur,0,sizeof(cur));
		maxflow += dfs(s,inf);
	}
	return maxflow;
}
void print()
{
	for(int i = 0; i < E.size(); i++)
		printf("%d -> %d  %d\n",E[i].from,E[i].to,E[i].cap);
}
int main()
{
	scanf("%d",&T);
	int cas = 0;
	while(T--)
	{
		scanf("%d%d",&n,&m);
		s = 1;
		t = n;
		for(int i = 0; i <= n+1; i++) G[i].clear();
		E.clear();
		for(int i = 0; i < m; i++)
		{
			int u,v,cap;
			scanf("%d%d%d",&u,&v,&cap);
			add_e(u,v,cap);
		}
		//print();
		printf("Case %d: ",++cas);
		int ans = max_flow();
		printf("%d\n",ans);
	}
	return 0;
}