TopCoder

User's AC Ratio

100.0% (2/2)

Submission's AC Ratio

100.0% (2/2)

Tags

Description

Given a length $N$ string $S$. Calculate array $a_ 0, a_ 1, ..., a_ {N - 1}$ as follows:

  • $a_ i$ is the LCP(longest common prefix) of $S$ and $S.substr(i)$.

Input Format

$S$

Output Format

$a_ 0$ $a_ 1$ $a_ 2$ ... $a_ {N-1}$

Sample Input 1

abcbcba

Sample Output 1

7 0 0 0 0 0 1

Sample Input 2

mississippi

Sample Output 2

11 0 0 0 0 0 0 0 0 0 0

Sample Input 3

ababacaca

Sample Output 3

9 0 3 0 1 0 1 0 1

Sample Input 4

aaaaa

Sample Output 4

5 4 3 2 1

Hints

  • $1 \leq N \leq 5 \times 10^ {5}$
  • Each character of $S$ is lowercase English letters.

Subtasks

No. Testdata Range Score

Testdata and Limits

No. Time Limit (ms) Memory Limit (VSS, KiB) Output Limit (KiB) Subtasks
0 5000 2097152 2097152
1 5000 2097152 2097152
2 5000 2097152 2097152
3 5000 2097152 2097152
4 5000 2097152 2097152
5 5000 2097152 2097152
6 5000 2097152 2097152
7 5000 2097152 2097152
8 5000 2097152 2097152
9 5000 2097152 2097152
10 5000 2097152 2097152
11 5000 2097152 2097152
12 5000 2097152 2097152
13 5000 2097152 2097152
14 5000 2097152 2097152
15 5000 2097152 2097152
16 5000 2097152 2097152
17 5000 2097152 2097152
18 5000 2097152 2097152
19 5000 2097152 2097152
20 5000 2097152 2097152
21 5000 2097152 2097152
22 5000 2097152 2097152
23 5000 2097152 2097152
24 5000 2097152 2097152
25 5000 2097152 2097152
26 5000 2097152 2097152
27 5000 2097152 2097152
28 5000 2097152 2097152