分析
比较裸的DP了,注意一下最后答案输出即可
代码
#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 60,M = 1e3 + 10;
const ll mod= 1000000007;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a){char c=getchar();T x=0,f=1;while(!isdigit(c)){if(c=='-')f=-1;c=getchar();}
while(isdigit(c)){x=(x<<1)+(x<<3)+c-'0';c=getchar();}a=f*x;}
int gcd(int a,int b){return (b>0)?gcd(b,a%b):a;}
int tr[M][26],idx;
int cnt[M];
char str[N];
int w[M];
int f[N][M];
int ne[M],q[M];
string ans[N][M];
int n,m;
void init(){
memset(tr,0,sizeof tr);
memset(f,-0x3f,sizeof f);
memset(cnt,0,sizeof cnt);
memset(ne,0,sizeof ne);
idx = 0;
}
void insert(int x){
int p = 0;
for(int i = 0;i < strlen(str);i++){
int t = str[i] - 'a';
if(!tr[p][t]) tr[p][t] = ++idx;
p = tr[p][t];
}
cnt[p] = x;
}
void build(){
int hh = 0,tt = -1;
for(int i = 0;i < 26;i++)
if(tr[0][i]) q[++tt] = tr[0][i];
while(hh <= tt){
int t = q[hh++];
for(int i = 0;i < 26;i++){
int c = tr[t][i];
if(!c) tr[t][i] = tr[ne[t]][i];
else{
ne[c] = tr[ne[t]][i];
q[++tt] = c;
cnt[c] |= cnt[ne[c]];
}
}
}
}
int main(){
int T;
read(T);
while(T--){
init();
read(n),read(m);
for(int i = 1;i <= m;i++){
scanf("%s",str);
insert(i);
}
build();
for (int i = 1;i <= n;i++)
for (int j = 0;j <= idx;j++) ans[i][j].clear();
for(int i = 1;i <= m;i++) read(w[i]);
f[0][0] = 0;
for(int i = 1;i <= n;i++)
for(int j = 0;j <= idx;j++){
if(f[i - 1][j] == -INF) continue;
for(int p = 0;p < 26;p++){
int tj = tr[j][p];
int t = f[i - 1][j] + w[cnt[tj]];
if(t > f[i][tj]){
ans[i][tj] = ans[i - 1][j] + (char)('a' + p);
f[i][tj] = t;
}
else if(t == f[i][tj]){
string back = ans[i - 1][j] + (char)('a' + p);
if(back < ans[i][tj]) ans[i][tj] = back;
}
}
}
int maxv = 0,id = 0;
for(int i = 1;i <= n;i++)
for(int j = 0;j <= idx;j++)
if(maxv < f[i][j]){
maxv = f[i][j];
id = i;
}
string res = "";
for(int j = 0;j <= idx;j++)
if(f[id][j] == maxv)
if(res == "" || ans[id][j] < res) res = ans[id][j];
cout << res << endl;
}
}
/**
* ┏┓ ┏┓+ +
* ┏┛┻━━━┛┻┓ + +
* ┃ ┃
* ┃ ━ ┃ ++ + + +
* ████━████+
* ◥██◤ ◥██◤ +
* ┃ ┻ ┃
* ┃ ┃ + +
* ┗━┓ ┏━┛
* ┃ ┃ + + + +Code is far away from
* ┃ ┃ + bug with the animal protecting
* ┃ ┗━━━┓ 神兽保佑,代码无bug
* ┃ ┣┓
* ┃ ┏┛
* ┗┓┓┏━┳┓┏┛ + + + +
* ┃┫┫ ┃┫┫
* ┗┻┛ ┗┻┛+ + + +
*/