Given n objects the ith of each cost ai.
Given q queries in the form of s,a, b.
Count the number of subsets that contains a and b but sum of cost does not exceed s.
K is the sum of all Ai
N,Q,K<=4000
# | User | Rating |
---|---|---|
1 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 162 |
4 | TheScrasse | 160 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | orz | 146 |
9 | pajenegod | 145 |
9 | SecondThread | 145 |
Knapsack queries
Given n objects the ith of each cost ai.
Given q queries in the form of s,a, b.
Count the number of subsets that contains a and b but sum of cost does not exceed s.
K is the sum of all Ai
N,Q,K<=4000
Name |
---|