I am getting TLE and I can't handle it.I know the is solved by 0-1 Knapsack.I also try this. I think i have some mistake in my code but I do not found it. Please anyone help me..... Problem :UVA-562 — Dividing coins my code :Cpp_Code
# | User | Rating |
---|---|---|
1 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | orzdevinwang | 3570 |
4 | Geothermal | 3569 |
4 | cnnfls_csy | 3569 |
6 | tourist | 3565 |
7 | maroonrk | 3531 |
8 | Radewoosh | 3521 |
9 | Um_nik | 3482 |
10 | jiangly | 3468 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 163 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 151 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
I am getting TLE and I can't handle it.I know the is solved by 0-1 Knapsack.I also try this. I think i have some mistake in my code but I do not found it. Please anyone help me..... Problem :UVA-562 — Dividing coins my code :Cpp_Code
Name |
---|
Consider the following test:
100
1 cent 99 times and 500 cents
Your solution will run up to O(2^n) in this case.
Add memo: for each state (i, sum) memoize the answer obtained so that you can get it in O(1) afterwards.
how can i do that???i don't found any idea.
int knap(...)
if dp[i][sum] is already calculated
return dp[i][sum];
if (i == n)
...
...
...
return dp[i][sum] = max(q1, q2)
Note that there are some states that will never be reached. So my advice is to do the following thing:
int knap(...)
if visited[i][sum] return dp[i][sum]
if (i == n)...
visited[i][sum] = true
...
return dp[i][sum] = max(q1, q2)