关键思路:
http://hihocoder.com/discuss/question/3552
edge[][]
数组,一般的理解为任意两个点之间的边距离,但其实这个数组还有另一种理解方式:edge[j][k]
表示从j
出发,经过1条边到达k
的路径距离
对edge[i][j]使用倍增法,求从i到j经过2^k条边的路径距离
#include
#include
using namespace std;
#define L 31
#define SIZE 100
typedef long long ll;
int N, M;
ll dp[SIZE][SIZE][L], s[SIZE];
void merge(int x)
{
ll t;
for (int i = 0; i < N; ++i)
for (int j = 0; j < N; ++j)
for (int k = 0; k < N; ++k)
{
if (x == 1 && (k == i || k == j))continue;
t = dp[i][k][x - 1] + dp[k][j][x - 1];
if (dp[i][j][x] == -1 || dp[i][j][x] > t)
dp[i][j][x] = t;
}
}
void init()
{
memset(dp, -1, sizeof(dp));
memset(s, 0, sizeof(s));
cin >> N >> M;
for (int i = 0; i < N; ++i)
for (int j = 0; j < N; ++j)
cin >> dp[i][j][0];
for (int i = 1; i < L; ++i)
merge(i);
}
bool check(ll *a)
{
for (int i = 0; i < N; ++i)
if (a[i] <= M) return true;
return false;
}
void solve()
{
int ans = 0;
ll t[SIZE];
for (int k = 30; k >= 0; --k)
{
memset(t, -1, sizeof(t));
for (int i = 0; i < N; ++i)
for (int j = 0; j < N; ++j)
{
if (k == 0 && i == j) continue;
if (t[i] == -1 || t[i] > s[j] + dp[j][i][k])
t[i] = s[j] + dp[j][i][k];
}
if (check(t))
{
ans += (1 << k);
for (int i = 0; i < N; ++i)
s[i] = t[i];
}
}
cout << ans << endl;
}
int main()
{
init();
solve();
return 0;
}