样例:
9 2 3 7
po#olje#i
sol
znu
posoljeni
4 1 2 2
#rak
zm
zrak
之前的做法,由于 2 6 500 26^{500} 26500太大 所以 p [ ] p[] p[]会爆
数据比较小 有90分
#include<cstdio>
#include<vector>
#include<cstring>
#include<iostream>
#include<string>
#include<queue>
#include<algorithm>
using namespace std;
#define MAXN 505
#define LL long long
char s[MAXN],mb[MAXN][30];
int n,m,k,x,num;
LL p[MAXN];
int main()
{
//freopen("tavan.in","r",stdin);
//freopen("tavan.out","w",stdout);
scanf("%d %d %d %d",&n,&m,&k,&x);
scanf("%s",s+1);
int cnt=0,sum=1;
for(int i=1;i<=m