BZOJ3894【最小割】

/* I will wait for you */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<ctime>
#include<algorithm>
#include<iostream>
#include<fstream>
#include<vector>
#include<queue>
#include<deque>
#include<set>
#include<map>
#include<string>
#define make(a,b) make_pair(a,b)
#define fi first
#define se second

using namespace std;

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int,int> PII;

const int maxn=1010;
const int maxm=1010;
const int maxs=26;
const int INF=1<<29;
const int P=1000000007;
const double error=1e-9;

struct edge{ int v,a,next; }e[maxn];

int s,t,p,ans,cnt,head[maxn],dis[maxn],cur[maxn],q[maxn];
int dx[5]={0,0,0,1,-1},dy[5]={0,1,-1,0,0};

void insert(int u,int v,int a)
{
	e[cnt]=(edge){v,a,head[u]},head[u]=cnt++;
	e[cnt]=(edge){u,0,head[v]},head[v]&