#include <cstdio>
#include <cstring>
#pragma comment(linker, "/STACK:1024000000,1024000000") //栈溢出时,强行开栈
const int MAXN=80000;
const int inf = 0x7fffffff;
const int s = 0;
struct edge{
int v,next,w;
}edge[1000000];
int head[2*MAXN],cnt;//for sap
void addedge(int u, int v, int w)
{
edge[cnt].v = v;
edge[cnt].w = w;
edge[cnt].next = head[u];
head[u] = cnt++;
edge[cnt].v = u;
edge[cnt].w = 0;
edge[cnt].next = head[v];
head[v] = cnt++;
}
int sap(int t)
{
int pre[2*MAXN],cur[2*MAXN],dis[2*MAXN],gap[2*MAXN]; //gap标记断层 这里可能会暴 如果点的范围非常大的话 就放在外面 每次清空一下。
int flow = 0 , aug = inf ,u;
bool flag;
for (int i = 0 ; i <= t ; ++i)
{
cur[i] = head[i];
gap[i] = dis[i] = 0;
}
gap[s] = t+1;
u = pre[s] = s;
while (dis[s] <= t)
{
flag = 0 ;
for (int &j = cur[u] ; ~j ; j = edge[j].next)
{
int v = edge[j].v;
if (edge[j].w > 0 && dis[u] == dis[v]+1)
{
flag = 1;
if( edge[j].w < aug )aug = edge[j].w;
pre[v] = u;
u = v;
if (u == t)
{
flow += aug;
while (u != s)
{
u = pre[u];
edge[cur[u]].w -= aug;
edge[cur[u]^1].w += aug;
}
aug = inf;
}
break;
}
}
if ( flag )continue ;
int mindis = t+1;
for (int j = head[u]; ~j ; j = edge[j].next)
{
int v = edge[j].v;
if (edge[j].w > 0 && dis[v] < mindis)
{
mindis = dis[v];
cur[u] = j;
}
}
if(--gap[dis[u]] == 0)break;
gap[ dis[u] = mindis+1 ]++;
u = pre[u];
}
return flow;
}
void init ()
{
memset (head , -1 , sizeof(head));
cnt=0;
}