【BZOJ1898】[Zjoi2005]Swamp 沼泽鳄鱼【DP】【矩阵乘法】

http://www.lydsy.com/JudgeOnline/problem.php?id=1898

论文题，详见《矩阵乘法在信息学中的应用》俞华程。

样例果然弱...提供一组数据：

Input0：

5 10 0 1 2
1 3
4 3
0 4
1 4
2 4
0 2
1 2
0 1
3 0
2 3
2
3 1 3 0
4 4 3 2 1

Output0：

2

搞不懂给邻接矩阵清零时为什么只清了单向边。

另外发现这题其实是ZJOI2005的。

/* Footprints In The Blood Soaked Snow */
#include <cstdio>
#include <algorithm>

using namespace std;

const int maxn = 51, maxm = 5, maxlcm = 15, p = 10000;

int n, pos[maxn][maxm];

struct _mat {
	int num[maxn][maxn];
} E, G[maxlcm];

inline int iread() {
	int f = 1, x = 0; char ch = getchar();
	for(; ch < '0' || ch > '9'; ch = getchar()) f = ch == '-' ? -1 : 1;
	for(; ch >= '0' && ch <= '9'; ch = getchar()) x = x * 10 + ch - '0';
	return f * x;
}

inline _mat mul(_mat &A, _mat &B) {
	_mat C;
	for(int i = 0; i < n; i++) for(int j = 0; j < n; j++) {
		C.num[i][j] = 0;
		for(int k = 0; k < n; k++) C.num[i][j] = (C.num[i][j] + A.num[i][k] * B.num[k][j] % p) % p;
	}
	return C;
}

inline _mat qpow(_mat &A, int n) {
	_mat ans = E;
	for(_mat t = A; n; n >>= 1, t = mul(t, t)) if(n & 1) ans = mul(ans, t);
	return ans;
}

int main() {
	n = iread(); int m = iread(), st = iread(), ed = iread(), k = iread();
	for(int i = 1; i <= m; i++) {
		int a = iread(), b = iread();
		G[0].num[a][b] = G[0].num[b][a] = 1;
	}
	int nfish = iread();
	for(int i = 1; i <= nfish; i++) {
		pos[i][0] = iread();
		for(int j = 1; j <= pos[i][0]; j++) pos[i][j] = iread();
	}

	for(int i = 0; i < n; i++) E.num[i][i] = 1; G[13] = E;

	for(int i = 1; i <= 12; i++) {
		G[i] = G[0];
		for(int j = 1; j <= nfish; j++) {
			int loc = pos[j][(i - 1) % pos[j][0] + 1];
			for(int k = 0; k < n; k++) G[i].num[loc][k] = 0;
		}
		G[13] = mul(G[13], G[i]);
	}

	int a = k / 12, b = k - 12 * a;
	_mat ans = qpow(G[13], a);
	for(int i = 1; i <= b; i++) ans = mul(ans, G[i]);

	printf("%d\n", ans.num[st][ed]);
	return 0;
}