EK;
void updata(int i,int flow)
{
while(pre[i]!=-1)
{
c[i][pre[i]]+=flow;
c[pre[i]][i]-=flow;
i=pre[i];
}
}
int bfs()
{
memset(p,0,sizeof(p));
memset(pre,-1,sizeof(pre));
queue<int> q;
q.push(1);
p[1]=1;
int min_f=1<<28,i,cur;
while(!q.empty())
{
cur=q.front();
q.pop();
if(cur==n)
break;
for(i=1;i<=n;i++)
{
if(c[cur][i]&&!p[i])
{
p[i]=1;
pre[i]=cur;
min_f=min(min_f,c[cur][i]);
q.push(i);
}
}
}
if(pre[n]==-1)
return 0;
return min_f;
}
int EK()
{
int tmp,ans=0;
do
{
tmp=bfs();
updata(n,tmp);
ans+=tmp;
}
while(tmp!=0);
return ans;
}
ISAP;
#include<stdio.h>
#include<string.h>
#include<iostream>
using namespace std;
#define INF 0x3f3f3f3f
const int N=1100;//点数V
const int M=100000;//边数E
int h[N],gap[N],head[N];//h[i]即点i到起点s的最短距离;gap为残量网络每层的数量,当某一层的数量为0时不能再增广;
int cnt,n,m,s,t;//s是起点 t是终点
struct node
{
int v,c,next;
}e[M];
void init()
{
<span style="white-space:pre"> </span>memset(head,-1,sizeof(head));
<span style="white-space:pre"> </span>cnt=0;
}
void add(int u,int v,int w)
{
e[cnt].v=v,e[cnt].c=w;
e[cnt].next=head[u];head[u]=cnt++;
e[cnt].v=u,e[cnt].c=0;//添加反向边
e[cnt].next=head[v];head[v]=cnt++;
}
int dfs(int u,int flow)
{
if(u==t) return flow;
int c=flow,a,i,v,minh=t;
for(i=head[u];i!=-1;i=e[i].next)
{
if(e[i].c)
{
v=e[i].v;
if(h[v]==h[u]-1)
{
a=min(c,e[i].c);
a=dfs(v,a);
e[i].c-=a;
e[i^1].c+=a;
c-=a;
if(h[s]>t) return flow-c;
if(!c) break;
}
minh=min(minh,h[v]);
}
}
if(c==flow)
{
if(--gap[h[u]]==0) h[s]=t+1;
h[u]=minh+1;
++gap[h[u]];
}
return flow-c;
}
int isap()
{
memset(gap,0,sizeof(gap));
memset(h,0,sizeof(h));
int ans=0;gap[0]=t+1;
while(h[s]<=t)
ans+=dfs(s,INF);
return ans;
}
int main()
{
<span style="white-space:pre"> </span>int T,cas=0,u,v,w;
<span style="white-space:pre"> </span>scanf("%d",&T);
<span style="white-space:pre"> </span>while(T--)
<span style="white-space:pre"> </span>{
<span style="white-space:pre"> </span>scanf("%d%d",&n,&m);
<span style="white-space:pre"> </span>init();s=1,t=n;
<span style="white-space:pre"> </span>while(m--)
<span style="white-space:pre"> </span>{
<span style="white-space:pre"> </span>scanf("%d%d%d",&u,&v,&w);
<span style="white-space:pre"> </span>add(u,v,w);
<span style="white-space:pre"> </span>}
<span style="white-space:pre"> </span>printf("Case %d: %d\n",++cas,isap());
<span style="white-space:pre"> </span>}
<span style="white-space:pre"> </span>return 0;
}
Dinic;
#include<stdio.h>
#include<string.h>
#include<iostream>
using namespace std;
const int N=111,M=111,INF=0x3f3f3f3f;
struct node
{
<span style="white-space:pre"> </span>int v,c,next;
}e[M];
int head[N],d[N],q[N];
int n,m,l,r,s,t,cnt;
void add(int u,int v,int c)
{
<span style="white-space:pre"> </span>e[cnt].v=v,e[cnt].c=c;
<span style="white-space:pre"> </span>e[cnt].next=head[u],head[u]=cnt++;
<span style="white-space:pre"> </span>e[cnt].v=u,e[cnt].c=0;
<span style="white-space:pre"> </span>e[cnt].next=head[v],head[v]=cnt++;
}
void init()
{
<span style="white-space:pre"> </span>memset(head,-1,sizeof(head));
<span style="white-space:pre"> </span>cnt=0;
}
int bfs()
{
<span style="white-space:pre"> </span>l=r=0;
<span style="white-space:pre"> </span>memset(d,-1,sizeof(d));
<span style="white-space:pre"> </span>q[++r]=s;d[s]=0;int u,v,i;
<span style="white-space:pre"> </span>while(l<r)
<span style="white-space:pre"> </span>{
<span style="white-space:pre"> </span>u=q[++l];
<span style="white-space:pre"> </span>for(i=head[u];i!=-1;i=e[i].next)
<span style="white-space:pre"> </span>{
<span style="white-space:pre"> </span>v=e[i].v;
<span style="white-space:pre"> </span>if(e[i].c&&d[v]==-1)
<span style="white-space:pre"> </span>{
<span style="white-space:pre"> </span>d[v]=d[u]+1;
<span style="white-space:pre"> </span>q[++r]=v;
<span style="white-space:pre"> </span>}
<span style="white-space:pre"> </span>}
<span style="white-space:pre"> </span>}
<span style="white-space:pre"> </span>if(d[t]==-1)<span style="white-space:pre"> </span>return 0;
<span style="white-space:pre"> </span>return 1;
}
int dfs(int u,int flow)
{
<span style="white-space:pre"> </span>if(u==t)<span style="white-space:pre"> </span>return flow;
<span style="white-space:pre"> </span>int v,a,i,ans=0;
<span style="white-space:pre"> </span>for(i=head[u];i!=-1;i=e[i].next)
<span style="white-space:pre"> </span>{
<span style="white-space:pre"> </span>v=e[i].v;
<span style="white-space:pre"> </span>if(d[v]==d[u]+1&&e[i].c&&(a=dfs(v,min(flow,e[i].c))))
<span style="white-space:pre"> </span>{
<span style="white-space:pre"> </span>e[i].c-=a;
<span style="white-space:pre"> </span>e[i^1].c+=a;
<span style="white-space:pre"> </span>ans+=a;
<span style="white-space:pre"> </span>flow-=a;
<span style="white-space:pre"> </span>if(!flow)<span style="white-space:pre"> </span>break;
<span style="white-space:pre"> </span>}
<span style="white-space:pre"> </span>}
<span style="white-space:pre"> </span>if(ans)<span style="white-space:pre"> </span>return ans;
<span style="white-space:pre"> </span>d[u]=-1;
<span style="white-space:pre"> </span>return 0;
}
int dinic()
{
<span style="white-space:pre"> </span>int ans=0;
<span style="white-space:pre"> </span>while(bfs())
<span style="white-space:pre"> </span>ans+=dfs(s,INF);
<span style="white-space:pre"> </span>return ans;
}