Обсуждение @ 1732. Министерство правды @ Timus Online Judge

catalin_oancea TLE 9 [5] // Задача 1732. Министерство правды 9 апр 2011 20:53

I use KMP algorithm but i've got TLE at #9
my code is:
[code deleted]

what can I improve? How did you solve-it?

Edited by author 09.04.2011 20:54

bsu.mmf.team Re: TLE 9 [1] // Задача 1732. Министерство правды 11 апр 2011 03:21

You don't need KMP in this task. I can't even image how this algo helps to solve it. The solution is much more simple. Just find the least position for every word. I got AC even with std::string and the function str.find()

catalin_oancea Re: TLE 9 // Задача 1732. Министерство правды 12 апр 2011 21:46

Can you give me an example? How to use str.find() in c++? My email adress is catalin_oancea2008@yahoo.com

Edited by author 12.04.2011 21:46

Zhandos WA 9 [2] // Задача 1732. Министерство правды 13 апр 2011 12:17

I have Wa 9. Can anybody help me ?

catalin_oancea Re: WA 9 [1] // Задача 1732. Министерство правды 13 апр 2011 19:50

try this:

in:
===========================

hhahaphapphappyhappyhh
hap happ hh

out:
===========================

___hap____happ______hh

inatial_D Re: WA 9 // Задача 1732. Министерство правды 6 фев 2013 20:57

this test helps me to find a bug. thanks.

Обсуждение задачи 1732. Министерство правды