bzoj:1834: [ZJOI2010]network 网络扩容

#include<queue>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

struct na{
    int x,y,z,f,ne;
};
int n,m,l[1002],r[1002],num=0,p,ch,ans=0,
g[1002],d[1002],c[1002],k,co[21001],x[21001],y[21001],z[21001],dis[1002],ro[1002],qi[1002],an=0,mi[1002];
na b[21001];
bool bo[1002];
const int INF=1e9;
queue<int> q;
inline int min(int x,int y){return x>y?y:x;}
inline void spfa(){
    q.push(n+1);
    bo[n+1]=1;
    for (register int i=0;i<=n+1;i++) dis[i]=INF;
    mi[n+1]=INF;dis[n+1]=0;
    while(!q.empty()){
        int k=q.front();q.pop();bo[k]=0;
        if (k==n) continue;
        for (int i=l[k];i;i=b[i].ne){
            if (b[i].z>0&&dis[b[i].y]>b[i].f+dis[k]){
                dis[b[i].y]=b[i].f+dis[k];
                mi[b[i].y]=min(mi[k],b[i].z);
                ro[b[i].y]=i;
                qi[b[i].y]=k;
                if (!bo[b[i].y]){
                    bo[b[i].y]=1;
                    q.push(b[i].y);
                }
            }
        }
    }
}
inline int read(){
    p=0;ch=getchar();
    while (ch<‘0‘||ch>‘9‘) ch=getchar();
    while (ch>=‘0‘&&ch<=‘9‘) p=p*10+ch-48, ch=getchar();
    return p;
}
inline int add(int x,int y,int z,int f){
    num++;
    if (l[x]==0) l[x]=num;else b[r[x]].ne=num;
    b[num].x=x;b[num].y=y;b[num].z=z;b[num].f=f;r[x]=num;
}
inline void in(int x,int y,int z,int f){
    add(x,y,z,f);add(y,x,0,-f);
}
inline int sap(int x,int f){
    if (x==n) return f;
    int h=0,q;
    for (register int i=d[x];i;i=b[i].ne)
    if (b[i].z&&g[x]==g[b[i].y]+1){
        q=sap(b[i].y,min(b[i].z,f-h));
        h+=q;
        b[i].z-=q;b[((i-1)^1)+1].z+=q;d[x]=i;
        if (h==f) return h;
    }
    if (g[1]==n) return h;
    c[g[x]]--;
    if (!c[g[x]]) g[1]=n;
    g[x]++;c[g[x]]++;d[x]=l[x];
    return h;
}
int main(){
    register int i;
    n=read();m=read();k=read();
    for (i=1;i<=m;i++){
        x[i]=read();y[i]=read();z[i]=read();co[i]=read();
        in(x[i],y[i],z[i],0);
    }
    for (;g[1]<n;ans+=sap(1,INF));
    for (i=1;i<=m;i++) in(x[i],y[i],INF,co[i]);
    in(n+1,1,k,0);
    for(;;){
        spfa();
        if (dis[n]==INF) break;
        an+=mi[n]*dis[n];
        for (i=n;i;i=qi[i]) b[ro[i]].z-=mi[n],b[((ro[i]-1)^1)+1].z+=mi[n];
    }
    printf("%d %d",ans,an);
}