Link
题意:有m种DNA序列是致病的,问长为n且不包含致病序列的DNA有多少种
参考题解,思路:
我们可以先对这m种DNA建立trie树, 然后建立一个图,离散数学中的, 然后快速幂即可,建图是对于相邻两点来建的, 如果a->b
且b不为一个治病串的终点那么其就是可以到达的。
#include <cstdio>
#include <cstring>
#include <queue>
using namespace std;
const int mod = 100000;
struct Matrix
{
int mat[110][110], n;
Matrix(){};
Matrix(int _n)
{
n = _n;
for(int i = 0; i < n; i ++)
{
for(int j = 0; j < n; j ++)
{
mat[i][j] = 0;
}
}
}
Matrix operator *(const Matrix &b) const
{
Matrix ret = Matrix(n);
for(int i = 0; i < n; i++)
{
for(int j = 0; j < n; j ++)
{
for(int k = 0; k < n; k++)
{
int tmp = (long long) mat[i][k] * b.mat[k][j] % mod;
ret.mat[i][j] = (ret.mat[i][j] + tmp) % mod;
}
}
}
return ret;
}
};
struct Trie
{
int next[110][4], fail[110];
bool end[110];
int root, idx;
int newnode()
{
for(int i = 0; i < 4; i ++) next[idx][i] = -1;
end[idx] = false;
return idx ++;
}
void init()
{
idx = 0;
root = newnode();
}
int getid(char c)
{
if(c == 'A') return 0;
if(c == 'C') return 1;
if(c == 'G') return 2;
return 3;
}
void insert(char s[])
{
int len = strlen(s);
int now = root;
for(int i = 0; i < len; i++)
{
int &tmp = next[now][getid(s[i])];
if(tmp == -1)
{
tmp = newnode();
}
now = tmp;
}
end[now] = true;
}
void build()
{
queue<int> q;
//fail[root] = root;
for(int i = 0; i < 4; i++)
{
int &tmp = next[root][i];
if(tmp == -1) tmp = root;
else
{
fail[tmp] = root;
q.push(tmp);
}
}
while(!q.empty())
{
int now = q.front();
q.pop();
end[now] |= end[fail[now]]; // 关键点
//如果now这个点结尾的字符串的某个后缀是病毒串,那么这个点也不能到达
for(int i = 0; i < 4; i ++)
{
int &tmp = next[now][i];
if(tmp == -1)
{
tmp = next[fail[now]][i];
}
else
{
fail[tmp] = next[fail[now]][i];
q.push(tmp);
}
}
}
}
Matrix getMatrix()
{
Matrix ret = Matrix(idx);
for(int i = 0; i < idx; i ++)
{
for(int j = 0; j < 4; j++)
{
if(end[next[i][j]] == false)
ret.mat[i][next[i][j]] ++;
}
}
return ret;
}
};
Trie ac;
char buf[20];
Matrix pow_Mat(Matrix a, int n)
{
Matrix ret = Matrix(a.n);
for(int i = 0; i < ret.n; i ++) ret.mat[i][i] = 1;
Matrix tmp = a;
while(n)
{
if(n & 1) ret = ret * tmp;
tmp = tmp * tmp;
n >>= 1;
}
return ret;
}
int main()
{
int n, m;
while(scanf("%d%d", &m, &n) == 2)
{
ac.init();
for(int i = 0; i < m; i++)
{
scanf("%s", buf);
ac.insert(buf);
}
ac.build();
Matrix a = ac.getMatrix();
a = pow_Mat(a, n);
int ans = 0;
for(int i = 0; i < a.n; i ++)
ans = (ans + a.mat[0][i]) % mod;
printf("%d\n", ans);
}
return 0;
}