首先吐槽为什么普遍反映CLJ的PPT好懂啊……是我语文水平太差所以没看懂……?(大雾)
其实后缀自动机的话多画画就好了吧(大雾
蒟蒻只能直接贴代码
#include "stdio.h"
#include "algorithm"
#include "iostream"
#include "string.h"
#include "stdlib.h"
#include "math.h"
#include "vector"
#include "map"
#include "set"
using namespace std;
const int N=500005<<1,A=26;
struct SAM{
char s[N]; int l,now,last,t,k,val[N],v[N];
int next[N][A],fail[N],len[N],sum[N],q[N];
SAM(){ now=last=1; t=k=l=0;
/*
memset(next,0,sizeof(next));
memset(fail,0,sizeof(fail));
memset(len,0,sizeof(len));
memset(val,0,sizeof(val));
memset(sum,0,sizeof(sum));
memset(q,0,sizeof(q));
memset(v,0,sizeof(v));
memset(s,0,sizeof(s));
*/
}
void extend(int c){ int p=last,np=++now;
len[np]=len[p]+1; val[last=np]=1;
for(;!next[p][c]&&p;p=fail[p]) next[p][c]=np;
if(p){
int q=next[p][c],nq;
if(len[q]==len[p]+1) fail[np]=q;
else {
len[nq=++now]=len[p]+1;
memcpy(next[nq],next[q],sizeof(next[q]));
fail[nq]=fail[q]; fail[np]=fail[q]=nq;
for(;next[p][c]==q;p=fail[p])next[p][c]=nq;
}
} else fail[np]=1;
}
void build(){
scanf("%s\n%d %d",s,&t,&k);l=strlen(s);
for(int i=0;i<l;i++)extend(s[i]-'a');
for(int i=1;i<=now;i++)v[len[i]]++;
for(int i=1;i<=l;i++)v[i]+=v[i-1];
for(int i=now;i;i--)q[v[len[i]]--]=i;
for(int i=now;i;i--){
if(t==1)val[fail[q[i]]]+=val[q[i]];
else val[q[i]]=1;
} val[0]=val[1]=0;
for(int i=now;i;i--){
sum[q[i]]=val[q[i]];
for(int j=0;j<A;j++){
sum[q[i]]+=sum[next[q[i]][j]];
}
}
}
void DFS(int x,int rk){
if(rk<=val[x])return;rk-=val[x];
for(int i=0;i<A;i++){
if(rk<=sum[next[x][i]])
{putchar('a'+i);DFS(next[x][i],rk);return;}
else rk-=sum[next[x][i]];
}
}
void answ(){
if(k>sum[1])puts("-1");
else DFS(1,k);
}
} sam;
int main()
{
sam.build(); sam.answ();
return 0;
}