题目
思路
把道路抽象成邻接矩阵跑快速幂。
code:
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
using namespace std;
long long n,myd=2017,m;
const int lim=101;
struct Matrix{
long long m[lim+1][lim+1];
};
Matrix cf(Matrix &x,Matrix &y,long long myd)
{
Matrix z;
memset(z.m,0,sizeof(z.m));
for (int i=0;i<=lim;i++) for (int j=0;j<=lim;j++) if (x.m[i][j])
{
for (int k=0;k<=lim;k++) z.m[i][k]=(z.m[i][k]+(x.m[i][j]*y.m[j][k])%myd)%myd;
}
return z;
}
Matrix jzksm(Matrix x,long long y,long long myd)
{
Matrix ans;
memset(ans.m,0,sizeof(ans.m));
for (int i=0;i<=lim;i++) ans.m[i][i]=1;
while (y)
{
if (y&1) ans=cf(ans,x,myd);
x=cf(x,x,myd);
y>>=1;
}
return ans;
}
Matrix a;
int main()
{
cin>>n>>m;
for (int i=0;i<=n;i++) a.m[i][0]=a.m[i][i]=1;
for (int i=1;i<=m;i++)
{
int x,y;
cin>>x>>y;
a.m[x][y]=a.m[y][x]=1;
}
long long t;
cin>>t;
a=jzksm(a,t,myd);
long long ans=0;
for (int i=0;i<=n;i++) ans=(ans+a.m[1][i])%myd;
cout<<ans;
return 0;
}