SUBST1 - New Distinct Substrings
Given a string, we need to find the total number of its distinct substrings.
Input
T- number of test cases. T<=20; Each test case consists of one string, whose length is <= 50000
Output
For each test case output one number saying the number of distinct substrings.
Example
Input: 2 CCCCC ABABA Output: 5 9
hide comments
|
Adel Ali:
2013-03-09 04:07:18
(N(LogN)^2) suffix array gives me TLE :S :S |
|
Wing Gu:
2013-02-13 07:33:26
I use SAM.However,when I use array,I got TLE,when I use map,I got AC |
|
Sanjary Rahman:
2012-11-23 18:20:02
Doubly Algo of suffix array took 0.01s for me :) |
|
Daniel:
2012-08-21 09:51:36
Suffix Array can do it!It's the same as the problem 694.Suffix Array can solve it within only 0.4s. |
|
bean:
2012-06-15 04:02:04
Why can I get AC in this problem but not in problem 694? Last edit: 2012-06-15 04:02:54 |
|
Gaurav Menghani:
2011-08-03 13:41:26
I had to replace strlen by pointer arithmetic, and sort by qsort to get AC. Sigh :-( |
|
Jitendra:
2011-07-28 08:19:53
qsort is faster than stl sort. stl sort gives tle while qsort soln accepted :) |
|
Thomas Dybdahl Ahle:
2011-07-09 22:55:14
I would say "" is a substring of any string, but I notice it isn't counted in the examples. Or maybe its the string itself that isn't counted as a substring? |
|
Leopoldo Taravilse:
2010-06-02 12:51:09
Do the strings contain the ' ' char? |
|
lccycc:
2010-02-25 15:45:52
length is <= 50000
|
| Added by: | Hoang Hong Quan |
| Date: | 2006-01-18 |
| Time limit: | 1s |
| Source limit: | 50000B |
| Memory limit: | 1536MB |
| Cluster: | Cube (Intel G860) |
| Languages: | All except: NODEJS PERL6 VB.NET |
| Resource: | Base on a problem in ByteCode06 |
RSS