OJ Board

mamun wrote:Here are some I/O for you

I've finally spotted the bug. It was the 'else if' part in my recursive function...
Thank you very much.

mamun wrote:So don't wait fro EOF.

It makes no difference. Still wrong answer.

Hi. I'm trying to solve problem 10651. I have a variable mask which denotes the state (1 if there is a pebble in a cavity, 0 otherwise), and I'm using a memoized recursive function to calculate the minimum number of pebbles left. I also wrote a routine to print the optimal process of removing the pe...

Hi.
What is the complexity of the DP algorithm for this problem? Only thing I can think of would be O(length(P)*N*length(Pi)), which seems too much for the given constrains. Is there something I haven't considered?

neno_uci wrote:Yes, we have all that is needed for the judge..., computers..., servers, but only the Judge Software is missing..., thanx again,

Take a look at http://theory.snu.ac.kr/ioi/.

Solved it finally.
Hint to the other solvers: the third stick doesn't have to be strictly longer that the other two sticks (for example {1, 1, 1} is the possible set with badness 0). This makes checking whether there are free sticks left extremely easy.
Thanks to Observer.

Take a look at this topic too: https://spoj.sphere.pl/forum/viewtopic.php?t=3032

yaro wrote:http://www.topcoder.com/tc?module=Stati ... d2=dynProg

I think this may be interesting for you.

Is there anything that covers more advanced DP problems?

shamim wrote:How to find out how much memory a program has used, in linux.

You could read /proc/<pid>/status just before your program terminates (using atexit for example). If anyone knows a better way (the one that judge uses), I would also like to know.

I was not speaking about the relative order of the two for-loops, but of the order in which you go through the chopsticks during dp. Think about which order does help for what you want to do (easy calculation how many bigger sticks are free). Note: editing this post, since I haven't still solved th...

Do the DP in the right order. Then, it is easy to calculate how many sticks are free to be the biggest stick in a set (note that you don't really care about which one you assign to which set). I don't understand. :oops: Am I supposed to do it like this? for ( i = 0; i < n; ++i ) for ( j = 0; j < k;...

* For a set of chopsticks, the longest piece C is not important. Of course, we need to ensure that this piece actually exists. Hi! Can you explain this in little more detail (how to ensure that the longest piece exists). I managed to figure out the O(k*n) algorithm (I'm only checking two neighbour ...

Hi. Can this problem be solved using a greedy algorithm? I've so far devised a dynamic programming O(n^3) algorithm, but the judge gives me wrong answer (when there is more than one optimal solution, and I have to minimize the work assigned to the first scriber, second and so on - the particular cas...

I finally managed to find out why I'm getting WA, but I still can't fix it (i get TLE or MLE). Consider this test data: 1 4 100 50 50 200 If one team has weight 100, then it can consist of only one man (the one with weight 100) or two men with weights 50. So, weight 100 can be achieved with 1 or 2 p...

All the points stated in this problem will be on the X axes, so all Y co-ordinates should be zero. I dont know what did u mean by X-Y coordinates? My algorithm was to get to the highest point possible from each current position. Hope this will help. Oops... :) What I ment actually by X was the left...