SARRAY - Suffix Array

Given a string of length at most 100,000 consist of alphabets and numbers. Output the suffix array of the string.

A suffix array is an array of integers giving the starting positions (0-based) of suffixes of a string in lexicographical order. Consider a string "abracadabra0AbRa4Cad14abra". The size of the suffix array is equal to the length of the string. Below is the list of 26 suffixes of the string along with its starting position sorted in lexicographical order:

POS SUFFIX
 11 0AbRa4Cad14abra
 20 14abra
 16 4Cad14abra
 21 4abra
 12 AbRa4Cad14abra
 17 Cad14abra
 14 Ra4Cad14abra
 25 a
 10 a0AbRa4Cad14abra
 15 a4Cad14abra
 22 abra
  7 abra0AbRa4Cad14abra
  0 abracadabra0AbRa4Cad14abra
  3 acadabra0AbRa4Cad14abra
 18 ad14abra
  5 adabra0AbRa4Cad14abra
 13 bRa4Cad14abra
 23 bra
  8 bra0AbRa4Cad14abra
  1 bracadabra0AbRa4Cad14abra
  4 cadabra0AbRa4Cad14abra
 19 d14abra
  6 dabra0AbRa4Cad14abra
 24 ra
  9 ra0AbRa4Cad14abra
  2 racadabra0AbRa4Cad14abra

Note: this is a partial score problem.
O(n2 log(n)) is expected to score about 20-30. (Naive sorting all suffixes)
O(n log2(n)) is expected to score about 40. (OK for most programming contest problems)
O(n log n) is expected to score about 60-70. (Use counting sort for small alphabet size)
O(n) without tweaks is expected to score about 80-90.
O(n) with tweaks is expected to score 100. (This is meant for fun only :)

Input

A single line containing the string.

Output

The suffix array of the string.

Example

Input:
abracadabra0AbRa4Cad14abra

Output:
11
20
16
21
12
17
14
25
10
15
22
7
0
3
18
5
13
23
8
1
4
19
6
24
9
2

Added by:Felix Halim
Date:2010-03-26
Time limit:0.200s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: PERL6

hide comments
2013-04-06 23:30:01 Vasya
O(n log n) gets 60, O(n log^2 n) gets 60. What's wrong?
2013-02-24 09:22:07 Mahavir Chopra
gives 30 for nlogn
2012-12-24 05:54:28 gourav
RE means ?
2012-06-15 05:56:24 Seter
I rewrote the function "printf" and got 100 instead of 90...a little fun hah?
2011-11-17 15:01:51 Thomas Dybdahl Ahle
Neither my n^2logn or nlog^2n solutions get more than 0 points... I wonder if the test cases are just really hard, or if I'm not reading the input right..
2011-11-12 16:12:18 Balasubramanian
My submission id is 6013479
Well, I think, I had implemented an O(n log^2 n) algorithm of suffix array. My program took 0.05 seconds. But, I received only 20 points. Has the points order been changed?


Last edit: 2011-11-12 16:12:57
2011-10-25 11:50:03 Shafaet
my O(n log2(n)) got 60 which is higher than felix expected
2011-05-22 17:15:10 Sigma Kappa
My O(nlogn) algo gets 80 points. How do I know whether they are _not_ caused by RTEs or whatever? Because I can see that things that ran for more than my timing got 100 points, so I suspect my program still has some bugs...

Last edit: 2011-05-17 16:31:25
2011-05-22 17:15:10 Felix Halim
When I first set the problem, I didn't know that the time-limit can be set to be less than 1 second. Now, I have set the time-limit to be stricter and rejudged this problem.
2011-05-22 17:15:10 Sigma Kappa
"Hmm should I make the input larger to distinguish O(n log n) solution?"
Yes, Felix, that would be great. Also, your UVa-tool is very helpful, keep it up!
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.