struct edge
{
int from,to,cap,flow;
edge(int u,int v,int c,int f):from(u),to(v),cap(c),flow(f){}
};
vector<edge> e;
vector<int> G[N];
int d[N],cur[N];
bool vis[N];
int read()
{
char ch;
int x=1;
while (ch=gc,ch<'0'||ch>'9') if (ch=='-') x=-1;
int s=ch-'0';
while (ch=gc,ch>='0'&&ch<='9') s=s*10+ch-'0';
return s*x;
}
void add(int from,int to,int cap)
{
e.push_back(edge(from,to,cap,0));
e.push_back(edge(to,from,0,0));
int m=e.size();
G[from].push_back(m-2);
G[to].push_back(m-1);
}
#define E e[G[x][i]]
bool bfs(int s,int t)
{
memset(vis,0,sizeof(vis));
queue<int> Q;
Q.push(s);
d[s]=0;
vis[s]=1;
while (!Q.empty())
{
int x=Q.front();
Q.pop();
for (int i=0;i<G[x].size();i++)
if (!vis[E.to]&&E.cap>E.flow)
{
vis[E.to]=1;
d[E.to]=d[x]+1;
Q.push(E.to);
}
}
return vis[t];
}
int dfs(int x,int a,int s,int t)
{
if (x==t||a==0) return a;
int flow=0,f;
for (int &i=cur[x];i<G[x].size();i++)
if (d[x]+1==d[E.to]&&(f=dfs(E.to,min(a,E.cap-E.flow),s,t))>0)
{
E.flow+=f;
e[G[x][i]^1].flow-=f;
flow+=f;
a-=f;
if (!a) break;
}
return flow;
}
int Maxflow(int s,int t)
{
int flow=0;
while (bfs(s,t))
{
memset(cur,0,sizeof(cur));
flow+=dfs(s,inf,s,t);
}
return flow;
}
#undef E
网络流dinic模板
最新推荐文章于 2024-10-09 10:07:13 发布