Origin FlowNet

蒟蒻也不知道为什么自己的最小费用流模板这么长。==
init()+newnode()，加点应该很灵活了，变量名也起得很良心。
以后如果速度不理想再写份新的。:P

#include<set>
#include<ctime>
#include<queue>
#include<cstdio>
#include<bitset>
#include<cctype>
#include<bitset>
#include<cstdlib>
#include<cassert>
#include<cstring>
#include<iostream>
#include<algorithm>
#define inf (1<<30)
#define INF (1ll<<62)
#define fi first
#define se second
#define rep(x,s,t) for(register int x=s,t_=t;x<t_;++x)
#define per(x,s,t) for(register int x=t-1,s_=s;x>=s_;--x)
#define prt(x) cout<<#x<<":"<<x<<" "
#define prtn(x) cout<<#x<<":"<<x<<endl
#define pb(x) push_back(x)
#define hash asfmaljkg
#define rank asfjhgskjf
#define y1 asggnja
#define y2 slfvm
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
template<class T>void sc(T &x){
    int f=1;char c;x=0;
    while(c=getchar(),c<48)if(c=='-')f=-1;
    do x=x*10+(c^48);
    while(c=getchar(),c>47);
    x*=f;
}
template<class T>void nt(T x){
    if(!x)return;
    nt(x/10);
    putchar(x%10+'0');
}
template<class T>void pt(T x){
    if(x<0)putchar('-'),x=-x;
    if(!x)putchar('0');
    else nt(x);
}
template<class T>void ptn(T x){
    pt(x);putchar('\n');
}
template<class T>void pts(T x){
    pt(x);putchar(' ');
}
template<class T>inline void Max(T &x,T y){if(x<y)x=y;}
template<class T>inline void Min(T &x,T y){if(x>y)x=y;}

struct FlowNet{
    static const int maxv=4111;//include in' and out' 
    static const int maxe=211111;//include reverse'
    int nn;//size of vertices
    int S,T;//source,dest
    int head[maxv],lcnt;
    struct Lane{
        Lane(int a=0,int b=0,int c=0,int d=0):
            to(a),nxt(b),flow(c),cost(d){}
        int to,nxt,flow,cost;
    }lane[maxe];

    void init(int st,int en,int tot){
        S=st;T=en;nn=tot;
        memset(head,-1,nn+1<<2);
        lcnt=0;
    }

    int newnode(){
        head[++nn]=-1;
        return nn;
    }

    inline void ins(int u,int v,int f,int c){
        lane[lcnt]=Lane(v,head[u],f,c);head[u]=lcnt++;
        lane[lcnt]=Lane(u,head[v],0,-c);head[v]=lcnt++;
    }

    int que[maxv*maxe];//STL?
    bool inq[maxv];//int?
    int dist[maxv],flow[maxv],from[maxv];
    bool spfa(){
        int l,r;l=r=0;
        que[r++]=S;
        rep(i,0,nn+1)dist[i]=inf;
        dist[S]=0;from[S]=-1;flow[S]=inf;
        while(l<r){
            int pre=que[l++];
            inq[pre]=false;
            for(register int i=head[pre];~i;i=lane[i].nxt){
                if(!lane[i].flow)continue;
                int to=lane[i].to;
                if(dist[to]>dist[pre]+lane[i].cost){
                    dist[to]=dist[pre]+lane[i].cost;
                    flow[to]=min(flow[pre],lane[i].flow);
                    from[to]=i;
                    if(!inq[to]){
                        inq[to]=true;
                        que[r++]=to;
                    }
                }
            }
        }//negetive circle?
        return dist[T]!=inf;
    }
    int flowpoly(){//ll?
        int ans=0,x,y;
        while(spfa()){
            x=dist[T],y=flow[T];
            ans+=x*y;
            for(register int i=from[T];i!=-1;i=from[lane[i^1].to]){
                lane[i].flow-=y;
                lane[i^1].flow+=y;
            }
        }
        return ans;
    }
};
int main(){
//  freopen("pro.in","r",stdin);
//  freopen("chk.out","w",stdout);

    return 0;
}