【ural】1960. Palindromes and Super Abilities【Palindromic Tree】

#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 = 100005 ;
const int N = 26 ;

struct Palindromic_Tree {
	int next[MAXN]
 ;
	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
 = -1 ;
		fail[0] = 1 ;
	}

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

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

	void count () {
		for ( int i = p - 1 ; i >= 0 ; -- i ) cnt[fail[i]] += cnt[i] ;
	}
} ;

Palindromic_Tree T ;
char s[MAXN] ;
int n ;

void solve () {
	int ans = 0 ;
	T.init () ;
	n = strlen ( s ) ;
	rep ( i , 0 , n ) printf ( "%d%c" , ans += T.add ( s[i] ) , i < n - 1 ? ' ' : '\n' ) ;
}

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