ZOJ 2760 -- How Many Shortest Path

代码实现：

#include<cstdio>
#include<cstring>
#include<queue>
#include<iostream>
#include<vector>
#define Min(a,b) ((a)<(b)?(a):(b))
#define Max(a,b) ((a)>(b)?(a):(b))
#define INF 0x3f3f3f3f
#define IN64 0x3f3f3f3f3f3f3f3fll
using namespace std;
const int N=110, M=20010;
int n, s, t, top;
int head[N], gap[N], cur[N], dis[N], vis[N], pre[N], w[110][110], d[110];

struct Edge{
    int to, next, flow;
    Edge(int _to = 0, int _next = 0, int _flow = 0):to(_to), next(_next), flow(_flow){}
}edge[M];

void Addedge(int from, int to, int flow){
    edge[top] = Edge(to, head[from], flow);
    head[from] = top++;
    edge[top] = Edge(from, head[to], 0);
    head[to] = top++;
}

void Spfa(){
    queue<int> q;
    memset(vis, 0, sizeof(vis));
    memset(d, 0x3f, sizeof(d));
    q.push(s); d[s] = 0;
    while(!q.empty()){
        int u = q.front(); q.pop(); vis[u] = 0;
        for(int i = 0; i < n; ++i){
            if(i != u && w[u][i] != -1 && d[i] > d[u] + w[u][i]){
                d[i] = d[u] + w[u][i];
                if(!vis[i]){
                    vis[i] = 1; q.push(i);
                }
            }
        }
    }
}

int Bfs(){
    queue<int> q;
    memset(dis, -1, sizeof(dis));
    dis[s] = 0; q.push(s);
    while(!q.empty()){
        int u = q.front();
        if(u == t) return 1;
        q.pop();
        for(int i = head[u]; i+1; i = edge[i].next){
            if(dis[edge[i].to] == -1 && edge[i].flow){
                dis[edge[i].to] = dis[u]+1;
                q.push(edge[i].to);
            }
        }
    }
    return 0;
}
int Dinic(int u,int sum){
    if(u == t) return sum;
    int max_flow = 0;
    for(int i = head[u]; i+1; i = edge[i].next){
        if(dis[edge[i].to] == dis[u] + 1 && edge[i].flow){
            int a = Dinic(edge[i].to, Min(sum-max_flow, edge[i].flow));
            edge[i].flow -= a;
            edge[i^1].flow += a;
            max_flow += a;
            if(max_flow == sum) return max_flow;
        }
    }
    if(max_flow == 0) dis[u] = -1;
    return max_flow;
}

int main(){
    while(~scanf("%d", &n)){
        memset(head, -1, sizeof(head));
        top = 0;
        for(int i = 0; i < n; ++i){
            for(int j = 0; j < n; ++j){
                scanf("%d", &w[i][j]);
                //if(w[i][j] == -1) w[i][j] = INF;
                if(i == j) w[i][j] = 0;
            }
        }
        scanf("%d%d", &s, &t);
        if(s == t){
            printf("inf\n"); continue;
        }
        Spfa();
        if(d[t] == INF){
            printf("0\n"); continue;
        }
        for(int i = 0; i < n; ++i){
            for(int j = 0; j < n; ++j){
                if(i != j && d[j] == d[i] + w[i][j]) Addedge(i, j, 1);
            }
        }
        int res = 0;
        while(Bfs()){
            res += Dinic(s,INF);
        }
        printf("%d\n", res);
    }
}