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 | 4009 |
2 | jiangly | 3831 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | ksun48 | 3373 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
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)