This is my first blog on SPOJ.
In this problem, I am getting Time Limit Exceeded.
My code is here
Can anyone suggest a better solution? Any help will be well appreciated.
Thanks in advance.
# | User | Rating |
---|---|---|
1 | tourist | 3947 |
2 | jiangly | 3734 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | ecnerwala | 3581 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | ksun48 | 3479 |
# | User | Contrib. |
---|---|---|
1 | awoo | 162 |
2 | maomao90 | 160 |
3 | nor | 156 |
4 | cry | 155 |
4 | adamant | 155 |
4 | atcoder_official | 155 |
4 | -is-this-fft- | 155 |
8 | maroonrk | 153 |
9 | SecondThread | 147 |
10 | Petr | 146 |
This is my first blog on SPOJ.
In this problem, I am getting Time Limit Exceeded.
My code is here
Can anyone suggest a better solution? Any help will be well appreciated.
Thanks in advance.
Name |
---|
ofcourse doing dp knapsack on each query will give Time limit exceeded with this contrains.
you should think a better solution
You can initialize segment tree with knapsack DP for each segment —
O(N * log(N) * B)
. Then you can answer single query inO(log(N) * B^2)
. Each vertex of segment tree contains a vectorp
of lengthB + 1
. p[i] is a maximal profit you can get for i dollars using only cards from corresponding subsegment. To combine two segmentsa
andb
runfor i in 0..B for j int 0..B-i c[i + j] = max(c[i + j], a[i] + b[j]);
TotalO(N * log(N) * B + D * log(N) * B^2)