题意分析:让你求两点间走k步可达方案数。
题解:这题算是矩阵思想实际应用的典型了吧, 原始矩阵是一步可达, k阶幂刚好就是k步可达, 因为矩阵乘法本身sum(a[i][k] * b[k][j])(i->j多走一步的可达方案数), 还原这个模型。
code:
/*
adrui's submission
Language : C++
Result : Accepted
Love : ll
Favorite : Dragon Balls
Standing in the Hall of Fame
*/
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;
#define debug 0
#define LL long long
#define mod 1000
#define M(a, b) memset(a, b, sizeof(a))
const int maxn = 20 + 5;
int n, m;
struct Matrix {
int mat[maxn][maxn];
void init() {
M(mat, 0);
for (int i = 0; i < n; i++)
mat[i][i] = 1;
}
};
Matrix operator * (Matrix a, Matrix b) { //矩阵乘法
Matrix c;
M(c.mat, 0);
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
{
for (int k = 0; k < n; k++)
c.mat[i][j] += (a.mat[i][k] * b.mat[k][j]) % mod;
c.mat[i][j] %= mod;
}
return c;
}
Matrix operator ^ (Matrix tmp, int b) { //快速幂
Matrix res;
res.init();
while (b) {
if (b & 1) res = res * tmp;
tmp = tmp * tmp;
b >>= 1;
}
return res;
}
int main() {
#if debug
freopen("in.txt", "r", stdin);
#endif //debug
int a, b, T, k;
while (~scanf("%d%d", &n, &m), n + m) {
Matrix tmp;
M(tmp.mat, 0);
for (int i = 1; i <= m; i++) {
scanf("%d%d", &a, &b);
tmp.mat[a][b] = 1; //有向的,初始矩阵可达标为1
}
scanf("%d", &T);
while (T--) {
scanf("%d%d%d", &a, &b, &k);
//printf("%d\n", k);
Matrix res = tmp ^ k; //快速幂
printf("%d\n", res.mat[a][b]);
}
}
return 0;
}