题意:
给出n(n<=10)个串,每个串的长度小于等于20,计算覆盖所有串的最短串长度
分析:
对所有串建立fail树,那么可以发现其实是在fail树上计算一个覆盖所有节点的最短路,因为最多10个串,所以我么考虑状压DP
表示到了当前状态为 i 的节点且一共走了 j 状态的串(第 k 个串走完的话标记 j 的第k位是1)
那么也很容易得到状态转移方程,在树上bfs计算即可。
//#include<bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<string>
#include<queue>
#include<map>
#include<set>
#include<vector>
#include<stack>
#include<list>
#include<ctime>
#include<ctype.h>
#include<stdlib.h>
#include<bitset>
#include<algorithm>
#include<assert.h>
#include<numeric> //accumulate
#define mm(a,b) memset(a,b,sizeof(a))
#define ACCELERATE (ios::sync_with_stdio(false),cin.tie(0))
#define pii pair<int,int>
#define pdd pair<double,double>
#define pll pair<long long,long long>
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define rush() int T;scanf("%d",&T);while(T--)
#define sc(a) scanf("%d",&a)
#define sc2(a,b) scanf("%d%d",&a,&b)
#define sc3(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define pf(a) printf("%d\n",a)
#define pf2(a,b) printf("%d %d\n",a,b)
#define pf3(a,b,c) printf("%d %d %d\n",a,b,c)
#define debug(x) cout<<#x<<": "<<x<<endl
#define all(x) (x).begin(),(x).end()
#define PI acos(-1.0)
#define E exp(1.0)
#define ll long long
#define ld long double
#define ull unsigned long long
//#define io
using namespace std;
const int inf=0x3f3f3f3f;
const ll INF=0x3f3f3f3f3f3f3f3f;
//#define gc getchar
char buf[1<<21],*p1=buf,*p2=buf;
inline int gc(){return p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++;}
inline int read(){
int ret=0,f=0;char c=gc();
while(!isdigit(c)){if(c=='-')f=1;c=gc();}
while(isdigit(c)){ret=ret*10+c-48;c=gc();}
if(f)return -ret;return ret;
}
const int maxn=1000;
int n;
int dp[1000][2000];
struct AC_Automaton{
int next[maxn][4];
int fail[maxn];
int cnt[maxn];
int root,tot;
int newnode(){
for(int i=0;i<4;i++){
next[tot][i]=-1;
}
fail[tot]=-1;
cnt[tot]=0;
return tot++;
}
void clear(){
tot=0;
root=newnode();
mm(cnt,0);
mm(fail,-1);
}
void insert(const string &s,int id){
int p=root;
for(int i=0,len=s.length();i<len;i++){
if(next[p][s[i]-'A']==-1){
next[p][s[i]-'A']=newnode();
}
p=next[p][s[i]-'A'];
}
cnt[p]|=(1<<id);
// cout<<p<<" "<<cnt[p]<<endl;
}
void build(){
queue<int> q;
q.push(root);
while(!q.empty()){
int p=q.front();q.pop();
for(int i=0;i<4;i++){
if(~next[p][i]){
if(p==root) fail[next[p][i]]=root;
else fail[next[p][i]]=next[fail[p]][i];
q.push(next[p][i]);
cnt[next[p][i]]|=cnt[fail[next[p][i]]];
}else{
if(p==root) next[p][i]=root;
else next[p][i]=next[fail[p]][i];
}
}
}
}
int solve(){
mm(dp,inf);
dp[0][0]=0;
queue<pii > que;
que.push(mp(0,0));
while(!que.empty()){
int p=que.front().fi;
int v=que.front().se;
que.pop();
for(int k=0;k<4;k++){
int pp=next[p][k];
if(pp==-1) pp=0;
int vv=(v|cnt[pp]);
if(dp[pp][vv]>dp[p][v]+1){
dp[pp][vv]=dp[p][v]+1;
que.push(mp(pp,vv));
// cout<<p<<" "<<v<<" "<<pp<<" "<<vv<<" "<<cnt[pp]<<" "<<dp[pp][vv]<<endl;
if(vv==((1<<n)-1)) return dp[pp][vv];
}
}
}
return 0;
}
}ac;
inline char change(char x){
switch(x){
case 'A': return 'A';
case 'G': return 'B';
case 'C': return 'C';
case 'T': return 'D';
}
}
int main(){
#ifdef io
freopen("in.txt","r",stdin);
freopen("out.txt","w",stdout);
#endif
ACCELERATE;
int T;
cin>>T;
while(T--){
cin>>n;
string s;
ac.clear();
rep(i,1,n){
cin>>s;
for(int j=0;j<s.size();j++){
s[j]=change(s[j]);
}
ac.insert(s,i-1);
}
ac.build();
printf("%d\n",ac.solve());
}
return 0;
}
/*
10
1
TCGG
5
TCGG
GCAG
CCGC
GATC
ATCG
2
TCGG
TCGG
*/