hdu4280(dinic+无向图）

这个数据真是卡的难受

一开始用kuangbin大大的板子

然后无向图正向反向都搞一个边和一个反边然后T掉了

看了看别人板子之后才发现原来无向图建边原来直接把反向边流量设置为和正边一样的流量就可以了

 

 

/*
#include <map>
#include <set>
#include <cmath>
#include <queue>
#include <vector>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long LL;
const int maxn = 1e5 + 10;
const int INF = 0x3f3f3f3f;
int cas = 1, T;
int d[maxn], cur[maxn], start, tend;
struct node
{
	int to, cap, next;
	//node(){}
	//node(int a,int b,int c):to(a),cap(b),rev(c){}
}edge[maxn << 1];
//vector<node>mp[maxn];
int head[maxn];
bool vis[maxn];
int cnt;
void addedge(int start, int to, int cap)
{
	edge[cnt].to = to;
	edge[cnt].cap = cap;
	edge[cnt].next = head[start];
	head[start] = cnt++;
}
bool BFS()
{
	//memset(vis,false,sizeof(vis));
	memset(d, -1, sizeof(d));
	int Q[maxn * 2];
	int Thead, Ttail;
	Thead = Ttail = 0;
	Q[Ttail++] = start;;
	d[start] = 0;
	//vis[start]=1;
	while (Thead<Ttail)
	{
		int x = Q[Thead];
		if (x == tend)return true;
		for (int i = head[x]; i != -1; i = edge[i].next