Changing the spaces into dots, does not make the sample more """"illustrative"""". It does make it way less obvious what the format is, though

Words can contain digits

please give me some tests.All test that I found in other topic my programm pass.

time 0.078
memory 3 350 kb.

I use triplex tree.
It is very interesting problem.

http://pastebin.com/Cr6m0rw7
I think I tried everything that can limit memory but still got MLE :/

Can someone tell me what's test case 8? With set, all testcases pass but with Trie, I am getting WA at testcase 8.

initially, there is "sun" in the DATABASE.

is file handling is necessary in this problem or not?..

I've read all posts but still do not understand what's wrong.
my solution:
-ignores names mentioned twice
-output 2 spaces, but not points
-outputs only 20 first names
-consists of 'sun' in the beginning

can anyone please give any tests or hints?

I have "Time limit exceeded" in test #12. But time of work is 0.234. Max time in test conditionы is 2.0. I think it is mistake in data reading. Maybe program waits reading data from test.

do
{
   var operation = Console.Read();
   var request = Console.ReadLine();

   ...
}
while (Console.In.Peek() != -1);


Edited by author 12.04.2014 18:28

Edited by author 12.04.2014 18:28

How to solve this problem in 0.5 sec? I have used simple brute force algo - qsort strings every time I needed it, and have used strings hashes for comparison. I got AC in 3,2 sec

Give me please 3 (third) test. I've tested with other tests from this forum - all works fine, but I have WA#3 problem...

Time limit is changed from 4 to 2 seconds.
First test is changed to the sample.
Submissions are rejudged.

Несмотря на то, что задача просто решеется с помощью std::set, я написал сжатый бор. Первый раз писать немного сложно, но весело. А теперь ещё и просто.

а если в вершинах бора хранить не map<string, node*> а попроще map<pair<int, int>, node*>, то я думаю результат был бы более впечатлительным

P.S. решайте сжатым бором

Accepted  0.312     2 904 КБ

Edited by author 11.01.2012 15:06

Hi, I am getting runtime error on test 1 using C#. No reason is given in brackets. Any idea why this may be happening?

Is it possible to solve this problem using suffix tree? or it will get MLE?

I think that my program is corect, but WA#1, WHY???
I print 2 spase before every star
Before work, base have one star-'sun'
Sample and my easy test is work correct
I use sort and binary search
I don't know, why my program have WA#1, please help!!!!

Edited by author 25.05.2007 18:40

Hi, i'm having problems with the input of this task.

How does my program know when the input is over?

It would be very helpful if you could give me a code sample (only the input, not the actual task :) ). Something like:

#what libraries the input needs

while(way to know the input is over)
{
way_to_read (scanf, cin ...something else?)
}

Thanks, I believe if i get this part, the rest will work first time :)

Tried to use STL (map, vector), but get TL11. Please, give me idea, how to use in this problem triple tree? Can't find any algorithms. Thank you!

Edited by author 27.10.2007 23:49