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:

There are at most 6 kinds of items, 100 special offers.For each item, you need to buy at most 6 of them. You are not allowed to buy more items than you want, even if that would lower the overall price. 思路：DFS + prune package l638; import java.util.List; /* * 解方程好像比较麻烦，直接brute force+dfs * * 外加点prune * * 为什么要写base呢？直接dfs算了吧 */ public class Solution { int ret = 0, base = 0; int[] buy; public int shoppingOffers(List<Integer> price, List<List<Integer>> special, List<Integer> needs) { for(int i=0; i<price.size(); i++) ret+=price.get(i)*needs.get(i); base = ret; int[] most = new int[special.size()]; for(int i=0; i<most.length; i++) { List<Integer> t = special.get(i); int max = Integer.MAX_VALUE; for(int j=0; j<t.size()-1; j++) { if(t.get(j) != 0) max = Math.min(max, needs.get(j)/t.get(j)); } most[i] = max; } buy = new int[most.length]; dfs(price, special, needs, most, 0, new int[needs.size()]); return ret; } private void dfs(List<Integer> price, List<List<Integer>> special, List<Integer> needs, int[] most, int s, int[] have) { for(int i=0; i<have.length; i++) if(have[i] > needs.get(i)) return ; if(s == most.length) { int p = 0; for(int i=0; i<buy.length; i++) { List<Integer> tmp = special.get(i); p += tmp.get(tmp.size()-1)*buy[i]; for(int j=0; j<tmp.size()-1; j++) { p -= buy[i]*tmp.get(j)*price.get(j); } } ret = Math.min(ret, base+p); return; } for(int i=0; i<=most[s]; i++) { int before = buy[s]; buy[s] = i; int diff = i - before; for(int j=0; j<special.get(s).size()-1; j++) have[j] += diff * special.get(s).get(j); dfs(price, special, needs, most, s+1, have); for(int j=0; j<special.get(s).size()-1; j++) have[j] -= buy[s] * special.get(s).get(j); buy[s] = 0; } } } public class Solution { public int shoppingOffers(List < Integer > price, List < List < Integer >> special, List < Integer > needs) { return shopping(price, special, needs, 0); } public int shopping(List < Integer > price, List < List < Integer >> special, List < Integer > needs, int i) { if (i == special.size()) return dot(needs, price); ArrayList < Integer > clone = new ArrayList < > (needs); int j = 0; for (j = 0; j < special.get(i).size() - 1; j++) { int diff = clone.get(j) - special.get(i).get(j); if (diff < 0) break; clone.set(j, diff); } if (j == special.get(i).size() - 1) return Math.min(special.get(i).get(j) + shopping(price, special, clone, i), shopping(price, special, needs, i + 1)); else return shopping(price, special, needs, i + 1); } public int dot(List < Integer > a, List < Integer > b) { int sum = 0; for (int i = 0; i < a.size(); i++) { sum += a.get(i) * b.get(i); } return sum; } }
转载请注明原文地址: https://www.6miu.com/read-250162.html