网络流之Dinic算法（AC了HDU的3549）

写了一个Dinic

为神马

memset(vis, false, sizeof(vis));

就过了！！！

memset(vis, 0, sizeof(vis));

就TLE！！！真是血的教训！以后记得写true和false了，再也不写0和1了

贴代码。

#include<iostream>
#include<queue>
#include<cstdlib>
#include<vector>
#include<cstring>
#include<cstdio>
using namespace std;
const int INF = 0x7f7f7f7f;
const int MAXN = 1e4;
const int MAXM = 1e6;

struct edge_{
    int from, to, cap, flow, next;
}edge[MAXM];

struct Dinic{
    int n, m, s, t, cnt;
    int head[MAXN];
    bool vis[MAXN];
    int d[MAXN], cur[MAXN], que[MAXN];
    void init(){
        memset(head, 0, sizeof(head));
        memset(edge, 0, sizeof(edge));
        cnt = 2;
    }

    void add(int from, int to, int cap){
        edge[cnt].from = from, edge[cnt].to = to;
        edge[cnt].cap = cap, edge[cnt].next = head[from];
        edge[cnt].flow = 0;
        head[from] = cnt++;
        edge[cnt].from = to, edge[cnt].to = from;
        edge[cnt].cap = 0, edge[cnt].next = head[to];
        edge[cnt].flow = 0;
        head[to] = cnt++;
    }

    bool bfs(){
        memset(vis, false, sizeof(vis));
        memset(d, 0, sizeof(d));
        d[s] = 0, vis[s] = 1, que[0] = s;
        int tail = 0, front = 1;
        while(tail < front){
            int x = que[tail++];
            for(int now = head[x]; now; now = edge[now].next){
                edge_ &e = edge[now];
                if(!vis[e.to] && e.cap > e.flow){
                    vis[e.to] = 1;
                    d[e.to] = d[x] + 1;
                    que[front++] = e.to;
                }
            }
        }
        return vis[t];
    }

    int dfs(int x, int a){
        if(x == t || a == 0)
            return a;
        int flow = 0, f;
        for(int &now = cur[x]; now; now = edge[now].next){
            edge_ &e = edge[now];
            if(d[x] + 1 == d[e.to] && (f = dfs(e.to, min(a, e.cap - e.flow))) > 0){
                e.flow +=f;
                edge[now ^ 1].flow -= f;
                flow += f;
                a -= f;
                if(a == 0)
                    break;
            }
        }
        return flow;
    }

    int maxFlow(int s, int t, int n, int m){
        this -> s = s, this -> t = t;
        this -> n = n, this -> m = m;
        int flow = 0;
        while(bfs()){
            for(int i = 1; i <= n; i++)
                cur[i] = head[i];
            flow += dfs(s, INF);
        }
        return flow;
    }
}dinic;

int main(){
    int n, m, s, t, c, ca = 1, num;
    scanf("%d", &num);
    while(num--){
        dinic.init();
        scanf("%d%d", &n, &m);
        for(int i = 0; i < m; i++){
            scanf("%d%d%d", &s, &t, &c);
            dinic.add(s, t, c);
        }
        printf("Case %d: %d\n", ca++, dinic.maxFlow(1, n, n, m));
    }
    return 0;
}