War HDU 3599（最短路+网络流）

传送门：QAQ

 

题意：给你n个点，然后给你一些点之间的路，然后让你求从1到n有多少条路径不重复的最短路

 

思路：首先他要求我们求的是最短路，所以我们可以先跑一遍最短路。这样我们就可以知道哪些是最短路上的边。

现在我们要去计算不重复的最短路的条数，我们可以利用最大流，设置每条边的容量为1，设置源点到起点的容量为正无穷，然后跑最短路就可以了，条数就是跑出的最大流。

 

附上代码：

#include <iostream>  
#include <stdio.h>  
#include <string.h>  
#include <stack>  
#include <queue>  
#include <map>  
#include <set>  
#include <vector>  
#include <math.h>  
#include <bitset>  
#include <algorithm>  
#include <climits>  
using namespace std;
const int inf=0x3f3f3f3f;

typedef long long LL;
const int maxn = 1600;

struct edge {
	int x;
	int y;
	int z;
};
edge ax[2300000];
int tot = 0;
struct inst {
	int y;
	int w;
	inst() {}
	inst(int y, int w) :y(y), w(w) {}
	bool operator < (const inst &A)const {
		return w > A.w;
	}
};
vector<inst>gx[1600];
int d[1600];
int n;
int vis[1600];
void dijkstra(int x) {
	for (int i = 0; i <= n; i++) {
		d[i] = inf;
		vis[i] = 0;
	}
	d[x] = 0;
	vis[x] = 1;
	priority_queue<inst>q;
	q.push(inst(x, 0));
	inst nd;

	while (!q.empty()) {
		nd = q.top();
		q.pop();
		vis[nd.y] = 1;
		for (int i = 0; i < gx[nd.y].size(); i++) {
			long long j = gx[nd.y][i].y;
			long long k = gx[nd.y][i].w;
			if (k + nd.w < d[j] && !vis[j]) {
				d[j] = nd.w + k;
				q.push(inst(j, d[j]));
			}
		}
	}

}
struct Edge {
	Edge() {}
	Edge(int from, int to, int cap, int flow) :from(from), to(to), cap(cap), flow(flow) {}
	int from, to, cap, flow;
};
struct Dinic {
	int n, m, s, t;
	vector<Edge>edges;
	vector<int>G[maxn];
	bool vis[maxn];
	int d[maxn];
	int cur[maxn];
	void init(int n) {
		this->n = n;
		for (int i = 0; i <= n; i++) G[i].clear();
		edges.clear();
	}
	void AddEdge(int from, int to, int cap) {
		edges.push_back(Edge(from, to, cap, 0));
		edges.push_back(Edge(to, from, 0, 0));
		m = edges.size();
		G[from].push_back(m - 2);
		G[to].push_back(m - 1);
	}
	bool BFS() {
		memset(vis, 0, sizeof(vis));
		queue<int>Q;
		Q.push(s);
		d[s] = 0;
		vis[s] = true;
		while (!Q.empty()) {
			int x = Q.front();
			Q.pop();
			for (int i = 0; i < G[x].size(); i++) {
				Edge& e = edges[G[x][i]];
				if (!vis[e.to] && e.cap > e.flow) {
					vis[e.to] = true;
					d[e.to] = d[x] + 1;
					Q.push(e.to);
				}
			}
		}
		return vis[t];
	}
	int DFS(int x, int a) {
		if (x == t || a == 0) return a;
		int flow = 0, f;
		for (int& i = cur[x]; i < G[x].size(); i++) {
			Edge& e = edges[G[x][i]];
			if (d[x] + 1 == d[e.to] && (f = DFS(e.to, min(a, e.cap - e.flow))) > 0) {
				e.flow += f;
				edges[G[x][i] ^ 1].flow -= f;
				flow += f;
				a -= f;
				if (a == 0) break;
			}
		}
		return flow;
	}
	int Maxflow(int s, int t) {
		this->s = s, this->t = t;
		int flow = 0;
		while (BFS()) {
			memset(cur, 0, sizeof(cur));
			flow += DFS(s, inf);
		}
		return flow;
	}
}DC;

void build() {
	DC.init(n+1);
	int s = 0;
	DC.AddEdge(0, 1, inf);
	for (int i = 0; i <tot; i++) {
		if (d[ax[i].x] - d[ax[i].y] == ax[i].z) {
			DC.AddEdge(ax[i].y, ax[i].x, 1);
		}
		else if (d[ax[i].y] - d[ax[i].x] == ax[i].z) {
			DC.AddEdge(ax[i].x, ax[i].y, 1);
		}
	}
	int t = n + 1;
	DC.AddEdge(n, t, inf);
	printf("%d\n", DC.Maxflow(s, t));
}
int main(void) {
	int t;
	scanf("%d", &t);
	while (t--) {
		tot = 0;
		scanf("%d", &n);
		int a, b, c;
		for (int i = 0; i <= n; i++) {
			gx[i].clear();
		}
		while (scanf("%d%d%d", &a, &b, &c) != EOF) {
			if (a == 0 && b == 0 && c == 0) break;
			ax[tot].x = a;
			ax[tot].y = b;
			ax[tot].z = c;
			tot++;
			gx[a].push_back(inst(b, c));
			gx[b].push_back(inst(a, c));
		}
		dijkstra(1);
		if (d[n] == inf || n == 1) {
			printf("0\n");
			continue;
		}
		build();
	}
}