OJ Board

The problem description's encode/decode message for this problem is wrong -- use the sample input/output. It uses some 2s as Z's or something.

..

No reply for two weeks. Wow. What is this bug forum for if an admin can't even reply?

No way to fix this at all?

I try to do the forgot password on the new system, but it doesn't send it to my email address.

Thanks.

I use: abcd 3 abcdcba aaaa 3 abcdcba abc 2 abdcba aab b baab abababaabababa 0 abababaabababa pqrsabcdpqrs 9 pqrsabcdpqrqpdcbasrqp a 0 aa aa 0 aa 0 2 aa and I get: TTTTTTT The solution is accepted TTTFFTT The solution is not accepted TFTTTFT The solution is not accepted TTTTTFT The solution is not ac...

You're welcomed!

Unforunately, I still haven't AC'ed this. I probably need somethign more in depth!

I use this for formatting:

"%-20s%5d%5d%10d\n"

but I get PE - now that it matters, how do I get AC instead? Thanks!

So, no trick cases?

Actually, you can do the precalc in O(nlogn) time by converting into an +/-1 RMQ problem in linear time, and then do the queries in O(1). Of course, you can also precalc in O(n) and queries in O(1), and that part isn't so bad using the big/small universe paradigm. The general RMQ->LCA is probably th...

In the N = 2 case, say

1 2
0 1
0 2

are we suppose to print "2" or "1"? Thanks!

There's no case where Dice = 0, because I would timeout from it.

I don't use int's.. and I've tried the n=0,1,2 cases.. are there any other particularly tricky cases?

Seems like most of the memo's got around 1 second. Just memo on the state..

the first thing i did was next_permutation(), but TLE the second is using dp[mask][rem] with memo map<int,int>, but TLE the third is i changed the map<int,int> to int memo[1024*10000], but MLE the fourth is partial memoization (is that what we call it?) so i only memoized up to 1000000, otherwise i...