OJ Board

Thanks ;). I understood the problem and I solved it. Although a bit slow, around 5 secs. I used a recursive method with memoization. And to pass the time limit I used a dirty tricky :-? Although I am not proud of that, I have passed it and I have learnt something else about DP. A good problem for ...

OK. But maybe, could you explain me the problem?
Any hint that you may think that it is important, or whatever to understand the problem, or the method to solve it, ...

Why is your array size 100? It could be the reason

Did you take in account the first letter of each word?

Thanks, i got AC
stupid of me, i solved with 3 different approachs, but i didnt feel the change of rows and colums in this problem, which is not the most typical!

Hi all,

Im trying to solve this problem but im getting WA. So, i dont know if i dont understand something in the statement problem, im missing something, i have a(or more than one) bug, ...
So, in order to try clear my doubts, could anyone give the correct output for this test cases, and even ...

Yeah! i was trying it yesterday with that, but i was getting TLE although now I'm thinking I was using the floor() function of math.h. So, that could be a good reason to get TLE(stupid of me). I saw your memory allocated to solve the problem and I thought my "cycle method" could be OK, since it had ...

Hi,

I'm trying this problem but I can't figure out how to solve it. I have thought the obvious DP (N^3), but obviously I'll get TLE with this one. So, could anybody say how solve it? I think must be a good prunning, I have tried some of them with DFS but any of them were not OK. I have thought try ...

You can get AC with only one priority_queue(STL). Although I have got AC in 9.641 secs.
You must optimize your code to get AC with only one priority_queue(STL)
Ah, on the other hand, I like the idea of 10 priority queues. Maybe I'll try it later

This number will always be less than 2 to the 30th.
That sentece is a direct translation, and its meaning is 2^30. ALthough i think that translation is not correct.

Thank you, I got AC

Hi,

the input of this problem have only 3 lines? Is that right?
If not, what is the correct input format?
Im getting WA and I think my algorithm is correct, and I dont know if the reason could be my input parser.

I think if you implement your our heap, maybe, could be faster that an array, but this is data-dependent.

You can check out with waterloo's code.
Be sure about the correct output format.