10912 - Simple Minded Hashing

[jan_holmes]

length is the current length, right ? and what is level ? Thx

[asif_rahman0]

length is the current length, right ?

ya

....and what is level ? Thx

level means length here, also.

[jan_holmes]

argggh... yes... got several WA and TLE because of my stupid DP implementation thx asif_rahman0

[JC1]

I've got AC a couple of times, but I'm not happy with my time. First I tried recursion with memoization for 3.6 seconds. Then I filled an array directly, using DP, and it took 4 seconds to get AC. Even worse. Maybe I'm doing unecessary calculations. Could somebody give me some help on this? I may post some code here if necessary.

Thanks,
Joao

[Imti]

Even My O(n^3) solution was giving TLE and was really irritated with this...at last I found memset() is too slow for this problem..manual assigning gives me accepted...

Try these
Input:

Code: Select all

13 170
8 100
26 351
16 200
5 2
23 323
14 156
12 12
0 0

Output:

Code: Select all

Case 1: 201413
Case 2: 61890
Case 3: 1
Case 4: 157236
Case 5: 0
Case 6: 104
Case 7: 194788
Case 8: 0

[Yousuf]

My Accepted Code gives this Output

Code: Select all

Case 1: 201413
Case 2: 30945
Case 3: 1
Case 4: 78618
Case 5: 0
Case 6: 52
Case 7: 48697
Case 8: 0

[Mukit Chowdhury]

My Accepted Code gives this Output

Code: Select all

Case 1: 201413
Case 2: 30945
Case 3: 1
Case 4: 78618
Case 5: 0
Case 6: 52
Case 7: 48697
Case 8: 0

My accepted code also gives output like your code... @Yousuf

[jddantes]

Removed after AC

[brianfry713]

On my machine your code is throwing a RE on line 32:
arr[j][k] += arr[j - 1][x];
When i = 1, j = 2, k = 4, x = 3

[jddantes]

Got it. Thanks.