BZOJ1898[ZJOI2005]沼泽鳄鱼

讲不清楚。。。。。。。

//By AcerMo
#include<cmath>
#include<cstdio>
#include<vector>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std; 
const int mod=10000;
inline int read()
{
    int x=0;char ch=getchar();
    while (ch<'0'||ch>'9') ch=getchar();
    while (ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
    return x;
}
int n,m,fish,start,end,T,t[25],f[25][5];
int ans[55];
vector<int>v[10050];
int a[15][55][55],b[55][55];
void geta()
{
	for (int i=0;i<n;i++)
		for(int k=0;k<v[i].size();k++)
			for(int j=1;j<=12;j++)
			    a[j][i][v[i][k]]=1;
	for (int i=1;i<=fish;i++)
		for (int k=1;k<=12;k++)
		{
			int tmp=f[i][k%t[i]];
			for(int j=0;j<n;j++)
			    a[k][j][tmp]=0;
		}
	return ;
}
void mul1(int a[55][55],int b[55][55],int c[55][55])
{
	int tmp[55][55];
	for (int i=0;i<n;i++)
	    for (int j=0;j<n;j++)
	    {
	    	tmp[i][j]=0;
	    	for (int k=0;k<n;k++)
	    	   tmp[i][j]=(tmp[i][j]+a[i][k]*b[k][j])%mod;
	    }
	memcpy(c,tmp,sizeof(tmp));
	return ;
}
void mul2(int a[55],int b[55][55],int c[55])
{
	int tmp[55];
	    for (int j=0;j<n;j++)
	    {
	    	tmp[j]=0;
	    	for (int k=0;k<n;k++)
	    	   tmp[j]=(tmp[j]+a[k]*b[k][j])%mod;
	    }
	memcpy(c,tmp,sizeof(tmp));
	return ;
}
int main()
{
	n=read();m=read();start=read();end=read();T=read();
	for (int i=1;i<=m;i++)
	{
	    int u=read(),g=read();
	    v[u].push_back(g);
	    v[g].push_back(u);
	}
	fish=read();
	for (int i=1;i<=fish;i++)
	{
		t[i]=read();
		for (int j=0;j<t[i];j++)
		    f[i][j]=read();
	}
	geta();
	for (int i=0;i<n;i++)
	    b[i][i]=a[13][i][i]=1;
	for (int i=1;i<=12;i++)
	    mul1(a[13],a[i],a[13]);
	int y=T/12;
	for (;y;mul1(a[13],a[13],a[13]),y>>=1)
		if(y&1) mul1(b,a[13],b);
	for (int i=1;i<=T%12;i++)
	    mul1(b,a[i],b);
	ans[start]=1;
	mul2(ans,b,ans);
	printf("%d",ans[end]);
	return 0;
}