#include #include #include #include #include using namespace std; inline int read() { int res = 0; bool bo = 0; char c; while (((c = getchar()) < '0' || c > '9') && c != '-'); if (c == '-') bo = 1; else res = c - 48; while ((c = getchar()) >= '0' && c <= '9') res = (res << 3) + (res << 1) + (c - 48); return bo ? ~res + 1 : res; } const int N = 1505, M = 5005, INF = 0x3f3f3f3f, PYZ = 1e9 + 7; int n, m, ecnt, nxt[M], adj[N], st[M], go[M], val[M], dis[M], len, que[M << 1], cnt[N], cnt1[N], cnt2[N], H, T, tot, q[N], ans[M]; bool vis[N], ins[M]; void add_edge(int u, int v, int w) { nxt[++ecnt] = adj[u]; adj[u] = ecnt; st[ecnt] = u; go[ecnt] = v; val[ecnt] = w; } void spfa(int S) { int i; memset(dis, INF, sizeof(dis)); memset(ins, 0, sizeof(ins)); dis[que[len = 1] = S] = 0; for (i = 1; i <= len; i++) { int u = que[i]; vis[u] = 0; for (int e = adj[u], v; e; e = nxt[e]) if (dis[u] + val[e] < dis[v = go[e]]) { dis[v] = dis[u] + val[e]; if (!vis[v]) vis[que[++len] = v] = 1; } } for (i = 1; i <= m; i++) if (dis[st[i]] + val[i] == dis[go[i]]) ins[i] = 1; } void topo(int S) { memset(cnt, 0, sizeof(cnt)); memset(cnt1, 0, sizeof(cnt1)); memset(cnt2, 0, sizeof(cnt2)); int i; H = tot = 0; cnt1[que[T = 1] = S] = 1; for (i = 1; i <= m; i++) if (ins[i]) cnt[go[i]]++; while (H < T) { int u = que[++H]; q[++tot] = u; for (int e = adj[u], v; e; e = nxt[e]) { if (!ins[e]) continue; v = go[e]; if (!(--cnt[v])) que[++T] = v; (cnt1[v] += cnt1[u]) %= PYZ; } } for (i = tot; i; i--) { int u = q[i]; cnt2[u]++; for (int e = adj[u], v; e; e = nxt[e]) { if (!ins[e]) continue; (cnt2[u] += cnt2[v = go[e]]) %= PYZ; } } } void solve(int S) { int i; spfa(S); topo(S); for (i = 1; i <= m; i++) if (ins[i]) (ans[i] += 1ll * cnt1[st[i]] * cnt2[go[i]] % PYZ) %= PYZ; } int main() { int i, x, y, z; n = read(); m = read(); for (i = 1; i <= m; i++) x = read(), y = read(), z = read(), add_edge(x, y, z); for (i = 1; i <= n; i++) solve(i); for (i = 1; i <= m; i++) printf("%d\n", ans[i]); return 0; }

题库

题库

321.道路

题解大全 共 0 篇

测试用例

题解大全共 0 篇