zoj3362 Beer Problem费用流

最新推荐文章于 2020-02-10 17:18:42 发布

alpc_wt

最新推荐文章于 2020-02-10 17:18:42 发布

阅读量448

点赞数

分类专栏：网络流图论

本文链接：https://blog.csdn.net/alpc_wt/article/details/44262003

版权

图论同时被 2 个专栏收录

8 篇文章 0 订阅

订阅专栏

网络流

2 篇文章 0 订阅

订阅专栏

费用流

双向边 (u,v,f,c) 拆分成4条边 (u,v,f,c) (v,u,0,-c) (v,u,f,c) (u,v,0,-c)

建立城市->汇点(u,T,inf,-price)

#include <iostream>
#include <string.h>
#include <stdio.h>
#include <algorithm>
#include <queue>
#define V 800+10
#define E 8000+10
#define inf 99999999
using namespace std;
int vis[V];
int dist[V];
int pre[V];

struct Edge{
    int u,v,c,cost,next;
}edge[E];
int head[V],cnt;

void init(){
    cnt=0;
    memset(head,-1,sizeof(head));
}
void addedge(int u,int v,int c,int cost)
{
    edge[cnt].u=u;edge[cnt].v=v;edge[cnt].cost=cost;
    edge[cnt].c=c;edge[cnt].next=head[u];head[u]=cnt++;

    edge[cnt].u=v;edge[cnt].v=u;edge[cnt].cost=-cost;
    edge[cnt].c=0;edge[cnt].next=head[v];head[v]=cnt++;
}

bool spfa(int begin,int end){
    int u,v;
    queue<int> q;
    for(int i=0;i<=end+2;i++){
        pre[i]=-1;
        vis[i]=0;
        dist[i]=inf;
    }
    vis[begin]=1;
    dist[begin]=0;
    q.push(begin);
    while(!q.empty()){
        u=q.front();
        q.pop();
        vis[u]=0;
        for(int i=head[u];i!=-1;i=edge[i].next){
            if(edge[i].c>0){
                v=edge[i].v;
                if(dist[v]>dist[u]+edge[i].cost){
                    dist[v]=dist[u]+edge[i].cost;
                    pre[v]=i;
                    if(!vis[v]){
                        vis[v]=true;
                        q.push(v);
                    }
                }
            }
        }
    }
    return dist[end]!=inf;
}

int MCMF(int begin,int end){
    int ans=0,flow;
    int flow_sum=0;
    while(spfa(begin,end)){
        flow=inf;
        for(int i=pre[end];i!=-1;i=pre[edge[i].u])
            if(edge[i].c<flow)
                flow=edge[i].c;
        for(int i=pre[end];i!=-1;i=pre[edge[i].u]){
            edge[i].c-=flow;
            edge[i^1].c+=flow;
        }
        if(dist[end]>0) break;
        //cout<<dist[end]<<endl;
        ans+=dist[end]*flow;
        flow_sum += flow;
    }
    return ans;
}
int main()
{
    int u,v,f,c;int pp;
    int n,m;
    while(scanf("%d%d",&n,&m)!=EOF){
        init();
        int S = 1,T = n+1;
        for(int i=2;i<=n;i++){
            scanf("%d",&pp); addedge(i,T,inf,-pp);
        }
        for(int i=1;i<=m;i++){
            scanf("%d%d%d%d",&u,&v,&f,&c);
            addedge(u,v,f,c);
            addedge(v,u,f,c);
        }
        //printf("00\n");
        int ans = -MCMF(S,T);
        printf("%d\n",ans);
    }

    return 0;
}