这个题当时只想到是求最小割,但确实没想到用上下界可行流可以做。关于上下界可行流可以看上一篇,也顺便复习了下。其实按照那样建图以后就基本算是裸题了
代码:
#include<cstdio>
#include<cstring>
#include<iostream>
#include<queue>
using namespace std;
const int inf=1<<29;
const int maxn=300;
const int maxm=5e4;
int e,st,des,pnt[maxm],nxt[maxm],flow[maxm],head[maxn],level[maxn];
int n,m,fin[maxn],fout[maxn];
queue<int> q;
void AddEdge(int u,int v,int f)
{
pnt[e]=v;nxt[e]=head[u];flow[e]=f;head[u]=e++;
pnt[e]=u;nxt[e]=head[v];flow[e]=0;head[v]=e++;
}
bool BFS()
{
memset(level,0,sizeof(level));
q.push(st);
level[st]=1;
while(!q.empty())
{
int u=q.front();
q.pop();
for(int i=head[u];i!=-1;i=nxt[i])
if(flow[i]&&!level[pnt[i]])
{
level[pnt[i]]=level[u]+1;
q.push(pnt[i]);
}
}
return level[des];
}
int DFS(int u,int maxf)
{
if(u==des||!maxf)
return maxf;
int f=0;
for(int i=head[u];i!=-1;i=nxt[i])
if(flow[i]&&level[pnt[i]]==level[u]+1)
{
int t=DFS(pnt[i],min(flow[i],maxf-f));
if(t>0)
{
flow[i]-=t;
flow[i^1]+=t;
f+=t;
if(f==maxf)
break;
}
else
level[pnt[i]]=0;
}
return f;
}
int maxflow()
{
int ans=0;
while(BFS())
ans+=DFS(st,inf);
return ans;
}
void solve(int sum)
{
int ans=maxflow();
if(ans==sum)
printf("happy\n");
else
printf("unhappy\n");
}
int main()
{
int T,cas=1;
scanf("%d",&T);
while(T--)
{
e=0;
memset(head,-1,sizeof(head));
memset(fin,0,sizeof(fin));
memset(fout,0,sizeof(fout));
scanf("%d%d",&n,&m);
st=0;des=n+1;
for(int i=0;i<m;i++)
{
int u,v,f1,f2;
scanf("%d%d%d%d",&u,&v,&f1,&f2);
AddEdge(u,v,f2);
fin[v]+=f1;
fout[u]+=f1;
}
int sum=0;
for(int i=1;i<=n;i++)
{
if(fin[i]>fout[i])
{
AddEdge(st,i,fin[i]-fout[i]);
sum+=fin[i]-fout[i];
}
if(fout[i]>fin[i])
AddEdge(i,des,fout[i]-fin[i]);
}
printf("Case #%d: ",cas++);
solve(sum);
}
return 0;
}