1 #define min(a, b) (a) < (b) ? (a) : (b)
 2
 3 class Solution
 4 {
 5 public:
 6     int dudubear(vector<int> life, vector<int> defense, vector<int> star, vector<int> attack, int n, int m)
 7     {
 8         int rightMinValue = 100000, leftMinValue = 100000, sum = 0;
 9         vector<int> selectValue;
10         vector<int> newselectValue;
11
12         for (int i = 0; i < n; ++i)
13         {
14             for (int j = 0; j < m; ++j)
15             {
16                 if (attack[j] >= life[i] + defense[i])
17                 {
18                     rightMinValue = min(star[j], rightMinValue);
19                     continue;
20                 }
21                 if ((attack[j] > defense[i]) && (attack[j] < defense[i] + life[i]))
22                 {
23                     selectValue.push_back(j);
24                     continue;
25                 }
26                 if (j == m - 1)
27                 {
28                     return -1;
29                 }
30             }
31             //因为技能可重复使用，但单个技能重复使用累加起来的伤害（攻击-防御）超过怪兽的生命值时无意义
32             //所以每个技能的使用次数不能超过(life[i] / (attack[selectValue[j]] - defense[i]))+1
33             //建立新数组，储存单个技能使用最大次数的数组
34             int count = 0;
35             for (int j = 0; j < selectValue.size(); ++j)
36             {
37                 int items = (life[i] / (attack[selectValue[j]] - defense[i])) + 1;
38                 for (int k = 0; k < items; ++k)
39                 {
40                     newselectValue.push_back(selectValue[j]);
41                     ++count;
42                 }
43             }
44
45
46             int flag = 4;
47             int bitcount = 2;
48             for (int j = 3; j < (int)pow(2, count); ++j)
49             {
50                 if (j == flag)
51                 {
52                     flag = flag << 1;
53                     ++bitcount;
54                     continue;
55                 }
56                 //计算当前情况所耗费晶石数量
57                 int sumDamage = 0, sumStar = 0;
58                 for (int k = 1; k < bitcount + 1; ++k)
59                 {
60                     if ((j >> (k - 1) & 1) == 1)
61                     {
62                         sumDamage += attack[newselectValue[count - k]] - defense[i];
63                         sumStar += star[newselectValue[count - k]];
64                     }
65                 }
66                 if (sumDamage < life[i])
67                     continue;
68                 if (sumStar > rightMinValue)
69                     continue;
70                 leftMinValue = min(sumStar, leftMinValue);
71             }
72             leftMinValue == 100000 ? sum += rightMinValue : sum += leftMinValue;
73             leftMinValue = 100000;
74             rightMinValue = 100000;
75             selectValue.clear();
76             newselectValue.clear();
77         }
78
79         return sum;
80     }
81 };