分析:
自己做的时候看错题了,以为是所有的点对最短路都要和原图一样,然后GG。经队友提醒,我补完了这题= =
思路大致是先跑一个最短路。如果对于一条边
(i,j)
, 如果
d[i]+c[i][j]=d[j]
,那么这条边就合法。记录一下所有边的合法入度。因为一棵树中,每个点的入度只有一,所以所有的入度乘一下就好了。
代码:
#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <cmath>
using namespace std;
const int INF = 0x3f3f3f3f;
const int mod = 1e9 + 7;
const int maxn = 55;
int g[maxn][maxn];
int d[maxn];
bool inq[maxn];
int ind[maxn];
int N;
void spfa() {
memset(inq, false, sizeof(inq));
queue<int> q;
memset(d, INF, sizeof(d));
d[1] = 0;
q.push(1); inq[1] = true;
while (!q.empty()) {
int u = q.front(); q.pop(); inq[u] = false;
for (int v = 1; v <= N; v ++) {
if (!g[u][v]) continue;
if (d[v] >= d[u] + g[u][v]) {
d[v] = d[u] + g[u][v];
if (!inq[v]) {
inq[v] = true;
q.push(v);
}
}
}
}
}
int main(int argc, char const *argv[]) {
while (~scanf("%d", &N)) {
memset(g, 0, sizeof(g));
memset(ind, 0, sizeof(d));
for (int i = 1; i <= N; i ++) {
char s[maxn];
scanf("%s", s + 1);
for (int j = 1; j <= N; j ++)
g[i][j] = s[j] - '0';
}
spfa();
for (int i = 1; i <= N; i ++) {
for (int j = 1; j <= N; j ++) {
if (i == j) continue;
if (g[i][j] == 0) continue;
if (d[i] + g[i][j] == d[j])
ind[j] ++;
}
}
long long ans = 1;
for (int i = 1; i <= N; i ++)
if (ind[i])
ans = (ans * 1ll * ind[i]) % mod;
cout<<ans<<endl;
}
return 0;
}