UVa OJ Board

The crucial observation is the fact that at each state (i, j, k, l) - (heights of each pile) candies in a basket are assigned interchangeably.

7 777 should be 0

Password is empty, but there are no problems anyway.

Why this contest is private? I think this is a bug, because Fall 2 is open, can you unlock it please?

You don't have answer for 7 777 in your output.

It's enough to check k to i/2+1, because dp[k, j-1] >= dp[k, j] and dp[k1, j-1] > dp[k2, j] if k1 > k2. By checking k > i/2+1, you will always get from max dp[k-1, j-1].
I still believe there is a way to ask only 2 or 3 questions and get O(n*s) solution. Does anyone have such idea?

You can use dfs to find strongly connected components and check if there is only 1 such component.

This is my solution: Let a - first string, b - second string, c - third string. I have dp[k] [j] - number of ways to make c[1..k] using letters from a[1..i] and b[1..j] dp[0] [j] = always 1 (there is only one way to make empty string - remove all letters from a and b) dp[k] [j] = dp[k][i-1][j] + dp[...

Maybe this part of task could be helpful for those of you, who get WA
"The city is bounded by four roads: 1st Street (west edge), 100th Street (east edge), 1st Avenue (south edge), 100th Avenue (north edge). Clearly these four roads must represent district boundaries;".

In my opinion you should show special information in visible place during the contest about submitting java:
viewtopic.php?f=31&t=7429
Also you could give compilation errors as you do after submitting problem from problemset.

Can somebody explain me how to get: a) time complexity O(n*4^s) b) time complexity O(n*3^s) I have O(n*s*2^(2s)) for each masc 'M' I must compute the set 'S' for actual applicant than I can substract from this masc min(dp[M], dp[M-S]). I cannot compute 'S' at the begining of processing actual applic...

Is it possible to solve this problem faster than O(n^2*m^2) ?

Try to guess the space of subproblems. Some hints:
- I have dp[j], where i - number of restaurant, j - amount of depots I want to install
- Time complexity is O(n^2*k), does anyone have a better solution?