题目链接:https://loj.ac/problem/117
算法详解:http://blog.csdn.net/winter2121/article/details/79430071
题意很直白,不过我用sap算法总是超时,用dinic算法就过了
【dinic算法】(优化)
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF=0x3f3f3f3f3f3f3f3f;
const int N=50200;
struct node{
ll t,cap,flow,next; //cap容量,flow流量
}e[N*12];
int head[N],vis[N],cnt;
void add(int u,int v,ll cap) //u->v容量为cap
{
e[cnt]=node{v,cap,0,head[u]};
head[u]=cnt++;
e[cnt]=node{u,0,0,head[v]}; //容量为0的反向边
head[v]=cnt++;
}
int d[N]; //bfs深度
bool bfs(int s,int t) //O(n+m)
{
memset(d,0,sizeof(d));
queue<int>q;
q.push(s);
d[s]=1;
while(!q.empty())
{
int u=q.front();q.pop();
for(int i=head[u];~i;i=e[i].next)
{
int v=e[i].t;
if(d[v]==0&&e[i].cap-e[i].flow>0)
{
d[v]=d[u]+1;
q.push(v);
}
}
}
return d[t]>0; //存在增广路
}
ll dfs(int s,int t,ll minedge)
{
if(s==t)return minedge;
ll flow=0; //从当前s点流出的流量
for(int &i=vis[s];~i;i=e[i].next)
{
int v=e[i].t;
if(d[v]==d[s]+1&&e[i].cap-e[i].flow>0) //层次关系&&有剩余流量
{
ll temp=dfs(v,t,min(minedge-flow,e[i].cap-e[i].flow));
e[i].flow+=temp; //流量增加
e[i^1].flow-=temp; //反向边流量减少
flow+=temp; //flow已分配的流量
if(flow==minedge)return flow; //已达到祖先的最大流,无法再大,剪枝
}
}
if(flow==0)d[s]=0; //此点已无流,标记掉
return flow;
}
ll dinic(int s,int t) //一定要建立反向边cap=0
{
ll maxflow=0;
while(bfs(s,t)) //有增广路
{
memcpy(vis,head,sizeof(head));
maxflow+=dfs(s,t,INF);
}
return maxflow;
}
ll bout[N],low[N*10];
int main()
{
int n,m,s,t,u,v;
ll b,c;
while(cin>>n>>m>>s>>t)
{
memset(head,-1,sizeof(head));
cnt=0;
memset(bout,0,sizeof(bout));
for(int i=0;i<m;i++)
{
scanf("%d%d%lld%lld",&u,&v,&b,&c);
add(u,v,c-b);
bout[u]+=b;
bout[v]-=b;
low[i]=b;
}
int ss=n+1,tt=n+2;
ll sum=0;
for(int i=1;i<=n;i++){
if(bout[i]>0)sum+=bout[i],add(i,tt,bout[i]);
if(bout[i]<0)add(ss,i,-bout[i]);
}
ll res=dinic(ss,tt);
add(t,s,INF);
res+=dinic(ss,tt);
if(sum==res)
{
printf("%lld\n",e[cnt-2].flow);
}
else printf("please go home to sleep\n");
}
}