Search found 214 matches

by CDiMa
Thu Oct 23, 2003 3:31 pm
Forum: Volume 105 (10500-10599)
Topic: 10559 - Blocks
Replies: 37
Views: 12255

Re: 10559 Blocks problem TLE

... while I can see several ways to store the computed tuples of values, I can't figure what's the best data structure to use. Hmm.. the best idea, will be a list with two fields : (color,number of last deleted) It will reduce the memory that will be needed... Hmmm, I still don't get it completely....
by CDiMa
Tue Oct 21, 2003 5:54 pm
Forum: Volume 105 (10500-10599)
Topic: 10559 - Blocks
Replies: 37
Views: 12255

10559 Blocks problem TLE

Hi! Yes I will help you, as much as I can ;-) Great! :D So I can give you a few hints : 1. Think about dynamic programming... where you have to fill the array[1..n,1..n,1..n,1..n] .. Descirption : if value of [a,b,c,d] = n then What is the value? The score obtained erasing the range of blocks? If y...
by CDiMa
Mon Oct 20, 2003 12:06 pm
Forum: Volume 105 (10500-10599)
Topic: 10559 - Blocks
Replies: 37
Views: 12255

10559 Blocks problem TLE

Hi! Everything depends on your algorithm .... Hi! my algorithm is simple, and surely slow :wink: Basically I read the data and construct a double linked list of segments so that's easy to add and delete segments. I have two helper functions that calculate the worst and potentially best score. Then ...
by CDiMa
Fri Oct 17, 2003 5:56 pm
Forum: Volume 105 (10500-10599)
Topic: 10559 - Blocks
Replies: 37
Views: 12255

10559 - Blocks

Are there any hints on how to reduce run time for this beast?
I improved significantly runtimes of my solution, but even some simple test cases I built take more than 10 seconds :( on my machine...

Ciao!!!

Claudio

Go to advanced search