cogs740 [网络流24题]分配问题

费用流模板题 我好久没写费用流了 结果莫名其妙的在一个地方卡死了
= = 一直在增广 而且加的费用是0
我偷懒 懒得找错了 判了一下循环次数直接退出了
结果就A了 有时间再改一改吧

#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

const int N=233,M=N*N,S=N-1,T=N-2,INF=1e9;

int n=0;
int head[N],from[M],to[M],next[M],c[M],f[M],cost[M],edge=0;
int dis[N],q[M],front=0,back=0,vis[N],fr[N];

inline void addEdge(int u,int v,int ac,int acost) {
    from[edge]=u,to[edge]=v,c[edge]=ac,cost[edge]=acost,next[edge]=head[u],head[u]=edge++;  
    from[edge]=v,to[edge]=u,c[edge]=0,cost[edge]=-acost,next[edge]=head[v],head[v]=edge++;
}

inline void build() {
    memset(head,-1,sizeof(head));
    for (int i=1;i<=n;++i) {
        addEdge(S,2*i-1,1,0);
        addEdge(2*i,T,1,0);
        for (int j=1;j<=n;++j) {
            int acost=0;
            scanf("%d",&acost);
            addEdge(2*i-1,2*j,1,acost);
        }
    }
}

inline int spfa(int type) {
    for (int i=1;i<=S;++i)
        dis[i]=type?-INF:INF;
    front=back=0;
    dis[S]=0;
    q[back++]=S;
    vis[S]=1;
    while (front<back) {
        int x=q[front++];
        for (int e=head[x];~e;e=next[e]) {
            int v=to[e];
            if (c[e]>f[e] && (!type && dis[x]+cost[e]<dis[v] || type && dis[x]+cost[e]>dis[v])) {
                fr[v]=e;
                dis[v]=dis[x]+cost[e];
                if (!vis[v]) {
                    q[back++]=v;
                    vis[v]=1;
                }
            }
        }
        vis[x]=0;
    }
    return dis[T]!=INF;
}

inline int augment() {
    int c0=INF,ret=0;
    for (int e=fr[T];~e;e=fr[from[e]])
        c0=min(c0,c[e]-f[e]);
    for (int e=fr[T];~e;e=fr[from[e]]) {
        ret+=c0*cost[e];
        f[e]+=c0;
        f[e^1]-=c0;
    }
    return ret; 
}

inline void init() {
    memset(vis,0,sizeof(vis));
    memset(fr,-1,sizeof(fr));
    memset(f,0,sizeof(f));
}

inline int costFlow(int type) {
    init();
    int ret=0;
    int cnt=0;
    while (spfa(type)) {
        if (cnt==N)
            break;
        int acost=augment();
        ret+=acost;
        ++cnt;
    }
    return ret;
}

int main(void) {
    freopen("job.in","r",stdin);
    freopen("job.out","w",stdout);
    scanf("%d",&n);
    build();
    printf("%d\n%d\n",costFlow(0),costFlow(1));
    fclose(stdin);
    fclose(stdout);
    return 0;
}