Leetcode 638: Shopping Offers

https://leetcode.com/problems/shopping-offers/description/

In LeetCode Store, there are some kinds of items to sell. Each item has a price.

However, there are some special offers, and a special offer consists of one or more different kinds of items with a sale price.

You are given the each item's price, a set of special offers, and the number we need to buy for each item. The job is to output the lowest price you have to pay for exactly certain items as given, where you could make optimal use of the special offers.

Each special offer is represented in the form of an array, the last number represents the price you need to pay for this special offer, other numbers represents how many specific items you could get if you buy this offer.

You could use any of special offers as many times as you want.

Example 1:

Input: [2,5], [[3,0,5],[1,2,10]], [3,2]
Output: 14
Explanation: 
There are two kinds of items, A and B. Their prices are $2 and $5 respectively. 
In special offer 1, you can pay $5 for 3A and 0B
In special offer 2, you can pay $10 for 1A and 2B. 
You need to buy 3A and 2B, so you may pay $10 for 1A and 2B (special offer #2), and $4 for 2A.

Example 2:

Input: [2,3,4], [[1,1,0,4],[2,2,1,9]], [1,2,1]
Output: 11
Explanation: 
The price of A is $2, and $3 for B, $4 for C. 
You may pay $4 for 1A and 1B, and $9 for 2A ,2B and 1C. 
You need to buy 1A ,2B and 1C, so you may pay $4 for 1A and 1B (special offer #1), and $3 for 1B, $4 for 1C. 
You cannot add more items, though only $9 for 2A ,2B and 1C.

Note:

1. There are at most 6 kinds of items, 100 special offers.
2. For each item, you need to buy at most 6 of them.
3. You are not allowed to buy more items than you want, even if that would lower the overall price.

Notes:

This question can be solved as a knapsack problem: there are 6 bags... So the overall complexity is O(6 ^ 6 * 100).

This requires we need to define a 6 dimensional vector...

Let us try brute force backtracking first.

If we can find a usable deal, we can adjust the task after the deal, and continue (like a dfs) until reaching the end.

After calculating all the possible solutions, we choose the smallest one.

The time complexity is O(6! * 100).

And it turns out it can pass the online OJ. (since it is faster than DP!!!)

See the code below:

class Solution {
public:
    int shoppingOffers(vector<int>& price, vector<vector<int>>& special, vector<int>& needs) {
        int res = 0;
        for(int i=0; i<needs.size(); ++i) res += price[i]*needs[i];
        if(res == 0) return res;
        int t = -1;
        for(auto &a : special) {
            bool isV = true;
            for(int i=0; i<needs.size(); ++i) {
                if(a[i] > needs[i]) {
                    isV = false;
                    break;
                }
            }
            if(isV) {
                int one = a.back();
                for(int i=0; i<needs.size(); ++i) needs[i] -= a[i];
                one += shoppingOffers(price, special, needs);
                for(int i=0; i<needs.size(); ++i) needs[i] += a[i];
                if(t == -1) t = one;
                else t = min(t, one);
            }
        }
        return t > -1 ? min(res, t) : res;
    }
};