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
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3803 |
2 | jiangly | 3707 |
3 | Benq | 3627 |
4 | ecnerwala | 3584 |
5 | orzdevinwang | 3573 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | Radewoosh | 3542 |
9 | jqdai0815 | 3532 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | awoo | 163 |
2 | adamant | 161 |
3 | maomao90 | 160 |
4 | maroonrk | 152 |
5 | -is-this-fft- | 151 |
6 | nor | 149 |
7 | atcoder_official | 147 |
7 | SecondThread | 147 |
9 | TheScrasse | 146 |
10 | Petr | 144 |
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
Название |
---|
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)