#include <iostream>
#include <string.h>
#include <stdio.h>
#include <algorithm>
#include <queue>
#define inf 0x3f3f3f3f
using namespace std;
const int N=6e4+5;
struct node
{
int v,cap,to;
}s[N];
int cnt,head[N],dis[N];
int T;///匯點
void add(int u,int v,int cap)
{
s[cnt].v=v;
s[cnt].cap=cap;
s[cnt].to=head[u];
head[u]=cnt++;
s[cnt].v=u;
s[cnt].cap=0;
s[cnt].to=head[v];
head[v]=cnt++;
}
bool bfs()
{
queue<int>q;
memset(dis,0,sizeof(dis));
dis[0]=1;
q.push(0);
while(!q.empty())
{
int u=q.front();
q.pop();
for(int e=head[u];~e;e=s[e].to)
{
int v=s[e].v,cap=s[e].cap;
if(!dis[v]&&cap>0)
{
dis[v]=dis[u]+1;
q.push(v);
}
}
}
return dis[T]!=0;
}
int dfs(int u,int flow)
{
int mm;
if(u==T)
return flow;
for(int e=head[u];~e;e=s[e].to)
{
int v=s[e].v,cap=s[e].cap;
if(cap>0&&dis[v]==dis[u]+1&&(mm=dfs(v,min(cap,flow))))
{
s[e].cap-=mm;
s[e^1].cap+=mm;
return mm;
}
}
dis[u]=-1;
return 0;
}
int dinic()
{
int ans=0,tf;
while(bfs())
{
while(tf=dfs(0,inf))//0表示源點
{
//printf("%d*\n",tf);
ans+=tf;
}
}
return ans;
}
void init()///初始化
{
cnt=0;
memset(head,-1,sizeof(head));
}
int main()
{
return 0;
}