【Tsinsen】A1255. 拉拉队排练 【Palindromic Tree】

传送门：【Tsinsen】A1255. 拉拉队排练

题目分析：这题呢，首先按照字符读入顺序插入构造回文树，然后处理出每种长度的本质不同的回文串的个数，然后降序排序，之后就是模拟随便搞搞了。

代码如下：

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std ;

typedef long long LL ;

#define rep( i , a , b ) for ( int i = ( a ) ; i <  ( b ) ; ++ i )
#define For( i , a , b ) for ( int i = ( a ) ; i <= ( b ) ; ++ i )
#define rev( i , a , b ) for ( int i = ( a ) ; i >= ( b ) ; -- i )
#define clr( a , x ) memset ( a , x , sizeof a )

const int MAXN = 1000005 ;
const int MAXE = 1000005 ;
const int mod = 19930726 ;
const int N = 26 ;

struct Node {
	int l , n ;
	Node () {}
	Node ( int l , int n ) : l ( l ) , n ( n ) {}
	bool operator < ( const Node& a ) const {
		return l > a.l ;
	}
} ;

struct Palindromic_Tree {
	Node a[MAXN] ;
	int m ;

	int next[MAXN][N] ;
	int fail[MAXN] ;
	int cnt[MAXN] ;
	int len[MAXN] ;
	int S[MAXN] , n ;
	int last ;
	int p ;

	int newnode ( int l ) {
		rep ( i , 0 , N ) next[p][i] = 0 ;
		cnt[p] = 0 ;
		len[p] = l ;
		return p ++ ;
	}

	void init () {
		p = 0 ;
		newnode (  0 ) ;
		newnode ( -1 ) ;
		last = 0 ;
		n = 0 ;
		S[n] = -1 ;
		fail[0] = 1 ;
		m = 0 ;
	}

	int get_fail ( int x ) {
		while ( S[n - len[x] - 1] != S[n] ) x = fail[x] ;
		return x ;
	}

	void add ( int c ) {
		c -= 'a' ;
		S[++ n] = c ;
		int cur = get_fail ( last ) ;
		if ( !next[cur][c] ) {
			int now = newnode ( len[cur] + 2 ) ;
			fail[now] = next[get_fail ( fail[cur] )][c] ;
			next[cur][c] = now ;
		}
		last = next[cur][c] ;
		cnt[last] ++ ;
	}

	void count () {
		for ( int i = p - 1 ; i >= 0 ; -- i ) {
			cnt[fail[i]] += cnt[i] ;
			if ( i > 1 && len[i] % 2 ) a[m ++] = Node ( len[i] , cnt[i] ) ;
		}
	}

	LL pow ( int a , int b ) {
		LL res = 1 , tmp = a ;
		while ( b ) {
			if ( b & 1 ) res = res * tmp % mod ;
			tmp = tmp * tmp % mod ;
			b >>= 1 ;
		}
		return res ;
	}

	void solve ( LL k ) {
		int ans = 1 ;
		count () ;
		sort ( a , a + m ) ;
		//rep ( i , 0 , m ) printf ( "%d %d\n" , a[i].l , a[i].n ) ;
		rep ( i , 0 , m ) {
			if ( a[i].n >= k ) {
				ans = ans * pow ( a[i].l , k ) % mod ;
				k = 0 ;
				break ;
			} else {
				ans = ans * pow ( a[i].l , a[i].n ) % mod ;
				k -= a[i].n ;
			}
		}
		if ( k ) printf ( "-1\n" ) ;
		else printf ( "%d\n" , ans ) ;
	}
} ;

Palindromic_Tree T ;
char s[MAXN] ;
LL n , k ;

void solve () {
	T.init () ;
	rep ( i , 0 , n ) T.add ( s[i] ) ;
	T.solve ( k ) ;
}

int main () {
	while ( ~scanf ( "%lld%lld%s" , &n , &k , s ) ) solve () ;
	return 0 ;
}