Codeforces 557E dp+字典树+字典序第k大

最新推荐文章于 2021-10-27 10:59:54 发布

绝风

最新推荐文章于 2021-10-27 10:59:54 发布

阅读量1k

点赞数

本文链接：https://blog.csdn.net/u011775691/article/details/48202685

版权

/*
给出一个字符串和半回文串的定义，求出字典序第k大的是半回文串的子串
先dp求l到r之间是不是半回文串
然后插入到字典树中，然后dfs字典树即可
*Rainto96
*Beijing University of Posts and Telecommunications School of Software Engineering
*http://blog.csdn.net/u011775691
*/
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <queue>
#include <cstring>
#include <string>
#include <cmath>
#include <set>
#include <map>
#include <vector>
#include <climits>
using namespace std;
#define pb push_back
#define ALL(x) x.begin(),x.end()
#define VINT vector<int>
#define PII pair<int,int>
#define MP(x,y) make_pair((x),(y))
#define ll long long
#define ull unsigned ll
#define MEM0(x)  memset(x,0,sizeof(x))
#define MEM(x,val) memset((x),val,sizeof(x))
#define scan(x) scanf("%d",&(x))
#define scan2(x,y) scanf("%d%d",&(x),&(y))
#define scan3(x,y,z) scanf("%d%d%d",&(x),&(y),&(z))
#define scan4(x,y,z,k) scanf("%d%d%d%d",&(x),&(y),&(z),&(k))
#define Max(a,b) a=max(a,b)
#define Min(a,b) a=min(a,b)
using namespace std;
const int NODENUM=15051111;
int res[NODENUM];
struct Trie
{
    int next[NODENUM][2], fa[NODENUM] , ch[NODENUM];
    int root,L;
    int newnode(){
        for(int i = 0; i < 2; i++) next[L][i] = -1;
        L++;
        return L-1;
    }
    void init(){
        L = 0;
        root = newnode();
        fa[root] = -1;
        ch[root]=0;
    }

    void debug(int now){
        for(int i=0;i<2;i++){
                if(next[now][i]!=-1){
                        int id = next[now][i];
                        printf("--------\nid:%d\n",id);
                        printf("fa:%d\n",fa[id]);
                        printf("res:%d\n",res[id]);
                        printf("ch:%c\n-------------\n",ch[id]+'a');
                        debug(id);
                }
        }
    }

} trie; //it cant be opened in stack

char str[111111];
int k;
bool dp[6666][6666];
bool vis[6666][6666];
bool dfs(int l,int r){
        if(l>=r) return true;
        if(vis[l][r] != false) return dp[l][r];
        vis[l][r]=true;
        if(str[l]==str[r]){
                return dp[l][r] = dfs(l+2,r-2);
        }else{
                return dp[l][r]=0;
        }
}

#define P(x) ((x)-'a')

int ans = 0;
int sum =0 ;
bool triefs(int now){
        //cerr<<now<<" "<<sum<<endl;
        if(sum>=k){
                ans = now;
                return true;
        }
        for(int i=0;i<2;i++){
                if(trie.next[now][i]!=-1) {
                        sum+=res[ trie.next[now][i] ];
                        if(triefs(trie.next[now][i])) return true;
                }
        }
        return false;
}

char s[6666];
void print(int p){
        int tail=0;
        while(p!=trie.root){
                //puts("fuck");
                //str.push_back(trie.ch[p]+'a');
                s[tail++] = trie.ch[p]+'a';
                p = trie.fa[p];
        }
        s[tail]='\0';
        for(int i=tail-1;i>=0;i--){
                putchar(s[i]);
        }
        putchar('\n');
}

int main(){
	#ifndef ONLINE_JUDGE
		freopen("C:/OJ/in.txt","r",stdin);
	#endif
	//puts("CAONIMA");
	memset(dp,-1,sizeof(dp));
	trie.init();
        scanf("%s%d",str,&k);
        int len = strlen(str);
        dfs(0,len-1);
        for(int i=0;i<len;i++){
                for(int j=0;j<len;j++){
                        dp[i][j] = dfs(i,j);
                }
        }
        for(int i=0;i<len;i++){
                int p = trie.root;
                for(int j=i;j<len;j++){
                        if(trie.next[p][P(str[j])]!=-1){
                                p = trie.next[p][P(str[j])];
                                res[p] += dp[i][j];
                        }else{
                                int& nxt = trie.next[p][P(str[j])] ;
                                nxt = trie.newnode();
                                trie.fa[ nxt ] = p;
                                trie.ch[ nxt ] = P(str[j]);
                                p = nxt;
                                res[p] += dp[i][j];
                        }
                }
        }
        //trie.debug(trie.root);
        int p = trie.root;
        sum=0;
        triefs(p);
        print(ans);
        return 0;
}