OJ Board

Thanks, yeah I simplified it a little and used dynamic programming and got AC on it. For some reason I thought that you had 10 seconds for each single input like over at topcoder.com, instead of 10 seconds for the entire file input. My bad!

I don't understand why this problem gives me time limit exceeded, since on my not-so-fast computer it solves the highest limit 10000 in only half a second. It must be something stupid, yet I don't see what. I'm not sure how others solved it, but I noticed that I can figure out the answer without mim...

Thanks, yeah I figured that out a couple of days ago and finally got a AC on it.

Okay, then can you give me an idea of what the correct approach is or an example of that breaks my above method?

I am truly stumped on this one

Any hints as to a simple way that this one can be done? Obviously trying every possibility isn't the answer...

I assume a greedy algorithm will solve this one, but the one I used got a WA. Basically I just kept choosing whichever task would cost the most money if it were left until the end. Is this the way to do it? And if so, then what is wrong with my program? Here it is: [cpp] /* @JUDGE_ID: 32250TW 10026 ...

I'm trying to solve prob 10150 - Doublets - and it keeps timing out no matter how much I optimize it. I've done what it seems like others have done and who have gotten time less than 3 secs, but mine always comes back saying limit exceeded. I'm pretty new to C++ and I'm wondering if maybe somewhere ...

Is there something wrong with the judge? This is the second problem in a week that has been spit back Invalid Memory Reference which I can only assume is an out of bounds problem, but I've scoured my code and I can't seem to find anywhere where this is even possible, and EVERYTHING I try when i run ...

Ok, I was just talking about equivalency classes when it came to letter placement, not length. I can see how to improve my recursive function to a best time using this, but it will still time out on a case with lots of words of same length that have the same letter layout. And I don't want to spend ...

I haven't done equivalency classes, but I honestly don't see how they would help out much with my method. If you have 1000 words all of the same length and that have no repeated letters, and then a sentence of 10-15 words, you still have to check each dictionary word with each sentence word.

I am stumped on how to do this problem within the 10 second limit. The method I have is a recursive function that checks each word against all the words in the dictionary that are the same length and backs up everytime it hits a snag. It works beautifully but unfortunately it times WAY out at only 1...

I got it figured out. Someone pointed out that I was writing "Ten" instead of "10", so now it works.

Hi, I am trying to do Stack 'em Up and it seems real easy but I keep getting wrong answer from the judge even though when I do my tests I always seem to get the correct answer. If I had to guess, it is becuase my program isn't recognizing the end of file at the end of the input. Now I am very new to...

Woot! It finally worked! The fact that you said the algorithm worked in your language got me to scrap using ints all together and only worked with doubles, using a setprecision function at the end and some nasty conversions to check to makes sure half pennies weren't used. But it worked! Thank god, ...

Oops, yeah, I caught that mistake a couple of days ago and forgot to mention it. However, I still get a wrong answer. Also, it doesn't state whether or not you are supposed to print the zero in front of the decimal point if the answer is less than a dollar. I've tried it both ways and also got wrong...