题意:给一个有向带权图,问s到t有多少条不重边的最短路。
思路:将所有在最短路上的边都加入网络中,边的容量为1,跑出的最大流量就是答案了。
换句话说,先跑出s和t分别到各点的最短距离,对于所有的边,如果ds[u] + edge[u][v] + dt[v] == ds[t],那么就把边(u,v)加入网络中。
需要注意的是,如果用dijkstra跑t的单源最短路的话,边的方向是相反的;还有记得s==t时要输出"inf"。
另外如果把公式变换一下改成ds[u] + edge[u][v] + (ds[t] - ds[v]) == ds[t]也是可以的,这样就少跑一遍dijkstra,也不用搞方向的问题。
P.s. 这题最坑的是数据(又是数据)!!点自己到自己的距离不一定是0,要强行改成0,这里wa了好久。。。
#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <math.h>
#include <stdlib.h>
#include <time.h>
using namespace std;
const int MAXN = 300;//点数的最大值
const int MAXM = 30000;//边数的最大值
const int INF = 0x3f3f3f3f;
struct Edge{
int to,next,cap,flow;
}edge[MAXM];//注意是MAXM
int tol;
int head[MAXN];
int gap[MAXN],dep[MAXN],pre[MAXN],cur[MAXN];
void init(){
tol = 0;
memset(head,-1,sizeof(head));
}
//加边,单向图三个参数,双向图四个参数
void addedge(int u,int v,int w,int rw=0){
edge[tol].to = v;edge[tol].cap = w;edge[tol].next = head[u];
edge[tol].flow = 0;head[u] = tol++;
edge[tol].to = u;edge[tol].cap = rw;edge[tol].next = head[v];
edge[tol].flow = 0;head[v]=tol++;
}
int sap(int start,int end,int N){
memset(gap,0,sizeof(gap));
memset(dep,0,sizeof(dep));
memcpy(cur,head,sizeof(head));
int u = start;
pre[u] = -1;
gap[0] = N;
int ans = 0;
while(dep[start] < N){
if(u == end){
int Min = INF;
for(int i = pre[u];i != -1; i = pre[edge[i^1].to])
if(Min > edge[i].cap - edge[i].flow)
Min = edge[i].cap - edge[i].flow;
for(int i = pre[u];i != -1; i = pre[edge[i^1].to]){
edge[i].flow += Min;
edge[i^1].flow -= Min;
}
u = start;
ans += Min;
continue;
}
bool flag = false;
int v;
for(int i = cur[u]; i != -1;i = edge[i].next){
v = edge[i].to;
if(edge[i].cap - edge[i].flow && dep[v]+1 == dep[u]){
flag = true;
cur[u] = pre[v] = i;
break;
}
}
if(flag){
u = v;
continue;
}
int Min = N;
for(int i = head[u]; i != -1;i = edge[i].next)
if(edge[i].cap - edge[i].flow && dep[edge[i].to] < Min){
Min = dep[edge[i].to];
cur[u] = i;
}
gap[dep[u]]--;
if(!gap[dep[u]])return ans;
dep[u] = Min+1;
gap[dep[u]]++;
if(u != start) u = edge[pre[u]^1].to;
}
return ans;
}
const int M = 105;
int dist[M][M], d[M][M];
main() {
int n;
while(~scanf("%d", &n)) {
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++){
int a;
scanf("%d", &a);
d[i][j] = a;
if(i == j) dist[i][j] = 0;
else if(a >= 0) dist[i][j] = a;
else dist[i][j] = INF;
}
for(int k = 1; k <= n; k++)
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
int src, sink;
scanf("%d %d", &src, &sink);
if(src == sink){
puts("inf");
continue;
}
src++, sink++;
if(dist[src][sink] == INF){
puts("0");
continue;
}
init();
int DIST = dist[src][sink];
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
if(i != j && d[i][j] != -1 && dist[src][i] < INF && dist[j][sink] < INF &&
dist[src][i] + dist[j][sink] + d[i][j] == DIST)
addedge(i, j, 1);
printf("%d\n", sap(src, sink, n));
}
}