Discussion @ 1037. Memory Management @ Timus Online Judge

What is the tricky part of this problem? Any hint please...WA on #4

Posted by Danica Porobic 22 Jun 2004 21:51

I've tried to solve this problem, using simple aproach, only one array in which i remember time until that part of the memory is allocated. On request I check if it's used, if is shift time to new value if not nothing change... On new allocation I search for the first free memory spot... Very simple, straight from the text, but I get WA on #4. Could someone post some tricky test or explain why my algorithm is wrong?

Problem is very easy - just use heaps (-)

Posted by Dmitry 'Diman_YES' Kovalioff 23 Jun 2004 08:06

Re: Problem is very easy - just use heaps (-)

Posted by Kraev Aleksey 24 Sep 2004 18:25

Thank you very much! I wouldn't say that it was very easy, but
I got AC and learn new way of programming.

Re: What is the tricky part of this problem? Any hint please...WA on #4

Posted by Korduban [Kiev] 1 Mar 2005 22:39

Try this test:
64999 +
65000 . 1
---------
1
+

Re: What is the tricky part of this problem? Any hint please...WA on #4

Posted by zhengfangyi 7 Mar 2010 20:08

Discussion of Problem 1037. Memory Management