题目链接
题意:问的就是走最短距离下,能有最多能有几种从起点到达终点的方案数,点可以重复使用,但是边只能使用一次。
思路:这道题最开始的思路就是不断的跑最大流最小费用,每次流的是单位流,所以,最后得到的只要跟第一次跑得到的最小费用相等就可以了。但是会T诶……
所以,我们要换种思路去想,看到这里有个条件就是每个点可以重复,但是每条边只能最多走过一次,所以我就想到了,在这里建一个最大流试试,看一下最后能流过多少的流,于是就从这个思路开始去建边,但是怎么建边呢?是个问题。但是,遇到这个问题之后,我就有了些许自己的想法,我们可以去记录从起点出发,还有从终点出发,分别到达每个点的前后的距离,然后我们以此为根据,去建立网络流的边。
但是,我们一定要做到正向边为正值,反向边为负值,为什么是这样呢,因为我们去跑网络流的最大流的时候,难免可能会往回跑,但是若是都为正值,是跑不回来的,所以,我们正向的为正值,反向的为负值,以此建立边即可。
#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <limits>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#define lowbit(x) ( x&(-x) )
#define pi 3.141592653589793
#define e 2.718281828459045
#define esp 1e-6
#define INF 0x3f3f3f3f
#define HalF (l + r)>>1
#define lsn rt<<1
#define rsn rt<<1|1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr
#define myself rt, l, r
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
const int maxN = 1e3 + 7, maxE = 2e5 + 7;
int N, M, S, T, head[maxN], cur[maxN], cnt, dis[2][maxN];
struct Eddge
{
int nex, u, v, flow, cost;
Eddge(int a=-1, int b=0, int c=0, int d=0, int f=0):nex(a), u(b), v(c), flow(d), cost(f) {}
}edge[maxE];
inline void addEddge(int u, int v, int flow, int cost)
{
edge[cnt] = Eddge(head[u], u, v, flow, cost);
head[u] = cnt++;
}
inline void _add(int u, int v, int flow, int cost) { addEddge(u, v, flow, cost); addEddge(v, u, 0, -cost); }
bool inque[maxN];
queue<int> Q;
inline void spfa(int st, int op)
{
while(!Q.empty()) Q.pop();
Q.push(st); inque[st] = true; dis[op][st] = 0;
while(!Q.empty())
{
int u = Q.front(); Q.pop(); inque[u] = false;
for(int i=head[u], v, c; ~i; i=edge[i].nex)
{
v = edge[i].v; c = edge[i].cost;
if(!op && dis[op][v] > dis[op][u] + c && c > 0)
{
dis[op][v] = dis[op][u] + c;
if(!inque[v])
{
inque[v] = true;
Q.push(v);
}
}
else if(op && dis[op][v] > dis[op][u] - c && c < 0)
{
dis[op][v] = dis[op][u] - c;
if(!inque[v])
{
inque[v] = true;
Q.push(v);
}
}
}
}
}
int deep[maxN], minn_link;
bool bfs()
{
memset(deep, 0, sizeof(deep));
while(!Q.empty()) Q.pop();
Q.push(S); deep[S] = 1;
while(!Q.empty())
{
int u = Q.front(); Q.pop();
for(int i=head[u], v, f, c; ~i; i=edge[i].nex)
{
v = edge[i].v; f = edge[i].flow; c = edge[i].cost;
if(!deep[v] && f && dis[0][u] + dis[1][v] + c == minn_link)
{
deep[v] = deep[u] + 1;
Q.push(v);
}
}
}
return deep[T];
}
int dfs(int u, int dist)
{
if(u == T) return dist;
for(int &i=cur[u], v, f, c, di; ~i; i=edge[i].nex)
{
v = edge[i].v; f = edge[i].flow; c = edge[i].cost;
if(f && deep[v] == deep[u] + 1 && dis[0][u] + dis[1][v] + c == minn_link)
{
di = dfs(v, min(dist, f));
if(di)
{
edge[i].flow -= di;
edge[i^1].flow += di;
return di;
}
}
}
return 0;
}
int Dinic()
{
int ans = 0, tmp;
while(bfs())
{
for(int i=1; i<=N; i++) cur[i] = head[i];
while((tmp = dfs(S, INF))) ans += tmp;
}
return ans;
}
inline void init()
{
cnt = 0;
memset(head, -1, sizeof(head));
memset(dis, INF, sizeof(dis));
}
int main()
{
int Cas; scanf("%d", &Cas);
while(Cas--)
{
scanf("%d%d", &N, &M);
init();
for(int i=1, u, v, w; i<=M; i++)
{
scanf("%d%d%d", &u, &v, &w);
if(u == v) continue;
_add(u, v, 1, w);
}
scanf("%d%d", &S, &T);
spfa(S, 0);
spfa(T, 1);
minn_link = dis[0][T];
printf("%d\n", Dinic());
}
return 0;
}