ENG  RUSTimus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board

Discussion of Problem 1367. Top Secret

Nice problem
Posted by Gigzzz(gigz@inbox.ru) 4 May 2005 04:56
Realy fun problem:)
Memory/Time limit ballance

interesting, somebody can solve it without using STL(i mean not using something like deque)?
Re: Nice problem
Posted by asd 5 May 2005 13:10

<%
 print('sdf');
%>

Edited by author 05.05.2005 13:15
Re: Nice problem
Posted by Kit 10 May 2005 01:37
What you mean by STL? Are not you solve it by filling in a square table? Memory limit (in my opinion) is sufficiently loose.
Re: Nice problem
Posted by Burunduk1 10 May 2005 04:21
I think many people always solve problems without STL.
Re: Nice problem
Posted by Gigzzz(gigz@inbox.ru) 10 May 2005 13:38
STL - standart template library
I fill square table, but i have problem with memory to store queue.
Re: Nice problem
Posted by Kit 13 May 2005 14:09
If you want, you may write me on klukva2@mail.ru and I will tell you about my solution. It also will be interesting to see your one.
i got Wrong Answer #21
Posted by Tolstobrov_Anatoliy[Ivanovo SPU] 6 Aug 2005 00:28

Help me please!!
Re: Nice problem
Posted by Vedernikoff Sergey 13 Aug 2005 00:55
I've solved it in Pascal (and, therefore, without STL). I don't see here any TLE/MLE balance - I simply used restricted queue. Only problem in this task - hard input format (two WA#1).