BZOJ 1877 拆点费用流

思路：

呃  水题不解释 行么,,

//By SiriusRen
#include <queue>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
#define mem(x,y) memset(x,y,sizeof(x))
const int N=,M=;
int n,m,xx,yy,zz,edge[N],cost[N],v[N],next[N],first[M];
int with[M],vis[M],minn[M],dis[M],tot,ans1,ans2;
void Add(int x,int y,int C,int E){edge[tot]=E,cost[tot]=C,v[tot]=y,next[tot]=first[x],first[x]=tot++;}
void add(int x,int y,int C,int E){Add(x,y,C,E),Add(y,x,-C,);}
bool tell(){
    mem(vis,),mem(minn,0x3f),mem(dis,0x3f);
    queue<int>q;q.push(),dis[]=;
    while(!q.empty()){
        int t=q.front();q.pop(),vis[t]=;
        for(int i=first[t];~i;i=next[i])
            if(dis[v[i]]>dis[t]+cost[i]&&edge[i]){
                dis[v[i]]=dis[t]+cost[i],minn[v[i]]=min(minn[t],edge[i]),with[v[i]]=i;
                if(!vis[v[i]])vis[v[i]]=,q.push(v[i]);
            }
    }return dis[n*]!=0x3f3f3f3f;
}
void zeng(){
    for(int i=*n;i^;i=v[with[i]^])edge[with[i]]-=minn[n*],edge[with[i]^]+=minn[n*];
    ans1+=minn[n*],ans2+=dis[n*]*minn[n*];
}
int main(){
    mem(first,-),scanf("%d%d",&n,&m);
    for(int i=;i<=m;i++){
        scanf("%d%d%d",&xx,&yy,&zz);
        add(xx+n,yy,zz,);
    }
    for(int i=;i<n;i++)add(i,i+n,,);
    add(,n+,,M),add(n,*n,,M);
    while(tell())zeng();
    printf("%d %d\n",ans1,ans2);
}