BZOJ 1834 网络扩容(最大流+费用流)

对于第一问，直接求最大流。

对于第二问，建源点s和汇点t，s连1容量为INF,费用为0的边，n连t容量为最大流+k，费用为0的边。这样就把最大流限制为最多增加k了。

限制需要求扩充的最小费用，原图的边多连一条容量为INF,费用为增容费用K的边。跑一遍费用流即是答案。

# include <cstdio>
# include <cstring>
# include <cstdlib>
# include <iostream>
# include <vector>
# include <queue>
# include <stack>
# include <map>
# include <set>
# include <cmath>
# include <algorithm>
using namespace std;
# define lowbit(x) ((x)&(-x))
# define pi 3.1415926535
# define eps 1e-
# define MOD
# define INF
# define mem(a,b) memset(a,b,sizeof(a))
# define FOR(i,a,n) for(int i=a; i<=n; ++i)
# define FO(i,a,n) for(int i=a; i<n; ++i)
# define bug puts("H");
# define lch p<<,l,mid
# define rch p<<|,mid+,r
# define mp make_pair
# define pb push_back
typedef pair<int,int> PII;
typedef vector<int> VI;
# pragma comment(linker, "/STACK:1024000000,1024000000")
typedef long long LL;
int Scan() {
    int res=, flag=;
    char ch;
    if((ch=getchar())=='-') flag=;
    else if(ch>=''&&ch<='') res=ch-'';
    while((ch=getchar())>=''&&ch<='')  res=res*+(ch-'');
    return flag?-res:res;
}
void Out(int a) {
    if(a<) {putchar('-'); a=-a;}
    if(a>=) Out(a/);
    putchar(a%+'');
}
const int N=;
//Code begin...

struct Edge{int p, next, w;}edge[N*];
struct Edge1{int to, next, cap, flow, cost;}edge1[N*];
struct Node{int u, v, C, K;}node[];
int head[N], cnt=, s, t;
int vis[N], head1[N], tol, pre[N], dis[N];
bool mark[N];
queue<int>Q;

void add_edge(int u, int v, int w){
    edge[cnt].p=v; edge[cnt].next=head[u]; edge[cnt].w=w; head[u]=cnt++;
    edge[cnt].p=u; edge[cnt].next=head[v]; edge[cnt].w=; head[v]=cnt++;
}
void addedge(int u, int v, int cap, int cost){
    edge1[tol].to=v; edge1[tol].cap=cap; edge1[tol].cost=cost;
    edge1[tol].flow=; edge1[tol].next=head1[u]; head1[u]=tol++;
    edge1[tol].to=u; edge1[tol].cap=; edge1[tol].cost=-cost;
    edge1[tol].flow=; edge1[tol].next=head1[v];  head1[v]=tol++;
}
bool spfa(int s, int t){
    FOR(i,s,t) dis[i]=INF, mark[i]=false, pre[i]=-;
    dis[s]=; mark[s]=true; Q.push(s);
    while (!Q.empty()) {
        int u=Q.front(); Q.pop();
        mark[u]=false;
        for (int i=head1[u]; i!=-; i=edge1[i].next) {
            int v=edge1[i].to;
            if (edge1[i].cap>edge1[i].flow&&dis[v]>dis[u]+edge1[i].cost) {
                dis[v]=dis[u]+edge1[i].cost; pre[v]=i;
                if (!mark[v]) mark[v]=true, Q.push(v);
            }
        }
    }
    if (pre[t]==-) return false;
    else return true;
}
int minCostMaxflow(int s, int t, int &cost){
    int flow=;
    cost=;
    while (spfa(s,t)) {
        int Min=INF;
        for (int i=pre[t]; i!=-; i=pre[edge1[i^].to]) {
            Min=min(Min,edge1[i].cap-edge1[i].flow);
        }
        for (int i=pre[t]; i!=-; i=pre[edge1[i^].to]) {
            edge1[i].flow+=Min; edge1[i^].flow-=Min;
            cost+=edge1[i].cost*Min;
        }
        flow+=Min;
    }
    return flow;
}
int bfs(){
    int i, v;
    mem(vis,-);
    vis[s]=; Q.push(s);
    while (!Q.empty()) {
        v=Q.front(); Q.pop();
        for (i=head[v]; i; i=edge[i].next) {
            if (edge[i].w> && vis[edge[i].p]==-) {
                vis[edge[i].p]=vis[v] + ;
                Q.push(edge[i].p);
            }
        }
    }
    return vis[t]!=-;
}
int dfs(int x, int low){
    int i, a, temp=low;
    if (x==t) return low;
    for (i=head[x]; i; i=edge[i].next) {
        if (edge[i].w> && vis[edge[i].p]==vis[x]+){
            a=dfs(edge[i].p,min(edge[i].w,temp));
            temp-=a; edge[i].w-=a; edge[i^].w += a;
            if (temp==) break;
        }
    }
    if (temp==low) vis[x]=-;
    return low-temp;
}
int main ()
{
    int n, m, k, ans;
    mem(head1,-);
    scanf("%d%d%d",&n,&m,&k);
    s=; t=n+;
    add_edge(s,,INF); add_edge(n,t,INF);
    FOR(i,,m) {
        scanf("%d%d%d%d",&node[i].u,&node[i].v,&node[i].C,&node[i].K);
        add_edge(node[i].u,node[i].v,node[i].C);
    }
    int tmp, sum=;
    while (bfs()) while (tmp=dfs(s,INF)) sum+=tmp;
    addedge(s,,INF,); addedge(n,t,sum+k,);
    FOR(i,,m) {
        addedge(node[i].u,node[i].v,node[i].C,);
        addedge(node[i].u,node[i].v,INF,node[i].K);
    }
    minCostMaxflow(s,t,ans);
    printf("%d %d\n",sum,ans);
    return ;
}