对于给定字符串的每一个前缀，判断是否可以将其拆分为 $1, 2, 3, 4, 5, \dots, 31$ 个非空回文串。
输入包含一行 $n$ 个小写拉丁字母 ($1 \le n \le 3 \cdot 10^5$)。
输出 $n$ 个非负整数，每行一个。第 $i$ 行应包含一个十进制数。如果你考虑该十进制数的二进制表示，其第 $(j-1)$ 位（从右往左数，从 0 开始）应为 1（如果长度为 $i$ 的前缀可以拆分为 $j$ 个回文串），否则为 0。
abaa
1 2 5 14
$1_{10} = 1_2$; $2_{10} = 10_2$; $5_{10} = 101_2$; $14_{10} = 1110_2$; $abaa = aba|a = a|b|aa = a|b|a|a$。
The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.
This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.
If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.
Guidelines: