Description#
You are the owner of a company that creates alloys using various types of metals. There are n different types of metals available, and you have access to k machines that can be used to create alloys. Each machine requires a specific amount of each metal type to create an alloy.
For the ith machine to create an alloy, it needs composition[i][j] units of metal of type j. Initially, you have stock[i] units of metal type i, and purchasing one unit of metal type i costs cost[i] coins.
Given integers n, k, budget, a 1-indexed 2D array composition, and 1-indexed arrays stock and cost, your goal is to maximize the number of alloys the company can create while staying within the budget of budget coins.
All alloys must be created with the same machine.
Return the maximum number of alloys that the company can create.
Example 1:
Input: n = 3, k = 2, budget = 15, composition = [[1,1,1],[1,1,10]], stock = [0,0,0], cost = [1,2,3]
Output: 2
Explanation: It is optimal to use the 1st machine to create alloys.
To create 2 alloys we need to buy the:
- 2 units of metal of the 1st type.
- 2 units of metal of the 2nd type.
- 2 units of metal of the 3rd type.
In total, we need 2 * 1 + 2 * 2 + 2 * 3 = 12 coins, which is smaller than or equal to budget = 15.
Notice that we have 0 units of metal of each type and we have to buy all the required units of metal.
It can be proven that we can create at most 2 alloys.
Example 2:
Input: n = 3, k = 2, budget = 15, composition = [[1,1,1],[1,1,10]], stock = [0,0,100], cost = [1,2,3]
Output: 5
Explanation: It is optimal to use the 2nd machine to create alloys.
To create 5 alloys we need to buy:
- 5 units of metal of the 1st type.
- 5 units of metal of the 2nd type.
- 0 units of metal of the 3rd type.
In total, we need 5 * 1 + 5 * 2 + 0 * 3 = 15 coins, which is smaller than or equal to budget = 15.
It can be proven that we can create at most 5 alloys.
Example 3:
Input: n = 2, k = 3, budget = 10, composition = [[2,1],[1,2],[1,1]], stock = [1,1], cost = [5,5]
Output: 2
Explanation: It is optimal to use the 3rd machine to create alloys.
To create 2 alloys we need to buy the:
- 1 unit of metal of the 1st type.
- 1 unit of metal of the 2nd type.
In total, we need 1 * 5 + 1 * 5 = 10 coins, which is smaller than or equal to budget = 10.
It can be proven that we can create at most 2 alloys.
Constraints:
1 <= n, k <= 1000 <= budget <= 108composition.length == kcomposition[i].length == n1 <= composition[i][j] <= 100stock.length == cost.length == n0 <= stock[i] <= 1081 <= cost[i] <= 100
Solutions#
Solution 1: Binary Search#
We note that all alloys need to be made by the same machine, so we can enumerate which machine to use to make the alloy.
For each machine, we can use binary search to find the maximum integer $x$ such that we can use this machine to make $x$ alloys. The maximum of all $x$ is the answer.
The time complexity is $O(n \times k \times \log M)$, where $M$ is the upper bound of the binary search, and in this problem, $M \leq 2 \times 10^8$. The space complexity is $O(1)$.
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
| class Solution:
def maxNumberOfAlloys(
self,
n: int,
k: int,
budget: int,
composition: List[List[int]],
stock: List[int],
cost: List[int],
) -> int:
ans = 0
for c in composition:
l, r = 0, budget + stock[0]
while l < r:
mid = (l + r + 1) >> 1
s = sum(max(0, mid * x - y) * z for x, y, z in zip(c, stock, cost))
if s <= budget:
l = mid
else:
r = mid - 1
ans = max(ans, l)
return ans
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
| class Solution {
int n;
int budget;
List<List<Integer>> composition;
List<Integer> stock;
List<Integer> cost;
boolean isValid(long target) {
for (List<Integer> currMachine : composition) {
long remain = budget;
for (int j = 0; j < n && remain >= 0; j++) {
long need = Math.max(0, currMachine.get(j) * target - stock.get(j));
remain -= need * cost.get(j);
}
if (remain >= 0) {
return true;
}
}
return false;
}
public int maxNumberOfAlloys(int n, int k, int budget, List<List<Integer>> composition,
List<Integer> stock, List<Integer> cost) {
this.n = n;
this.budget = budget;
this.composition = composition;
this.stock = stock;
this.cost = cost;
int l = -1;
int r = budget / cost.get(0) + stock.get(0);
while (l < r) {
int mid = (l + r + 1) >> 1;
if (isValid(mid)) {
l = mid;
} else {
r = mid - 1;
}
}
return l;
}
}
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
| class Solution {
public:
int maxNumberOfAlloys(int n, int k, int budget, vector<vector<int>>& composition, vector<int>& stock, vector<int>& cost) {
auto isValid = [&](long long target) {
for (int i = 0; i < k; i++) {
long long remain = budget;
auto currMachine = composition[i];
for (int j = 0; j < n && remain >= 0; j++) {
long long need = max(0LL, target * currMachine[j] - stock[j]);
remain -= need * cost[j];
}
if (remain >= 0) {
return true;
}
}
return false;
};
long long l = 0, r = budget + stock[0];
while (l < r) {
long long mid = (l + r + 1) >> 1;
if (isValid(mid)) {
l = mid;
} else {
r = mid - 1;
}
}
return l;
}
};
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
| func maxNumberOfAlloys(n int, k int, budget int, composition [][]int, stock []int, cost []int) int {
isValid := func(target int) bool {
for _, currMachine := range composition {
remain := budget
for i, x := range currMachine {
need := max(0, x*target-stock[i])
remain -= need * cost[i]
}
if remain >= 0 {
return true
}
}
return false
}
l, r := 0, budget+stock[0]
for l < r {
mid := (l + r + 1) >> 1
if isValid(mid) {
l = mid
} else {
r = mid - 1
}
}
return l
}
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
| function maxNumberOfAlloys(
n: number,
k: number,
budget: number,
composition: number[][],
stock: number[],
cost: number[],
): number {
let l = 0;
let r = budget + stock[0];
const isValid = (target: number): boolean => {
for (const currMachine of composition) {
let remain = budget;
for (let i = 0; i < n; ++i) {
let need = Math.max(0, target * currMachine[i] - stock[i]);
remain -= need * cost[i];
}
if (remain >= 0) {
return true;
}
}
return false;
};
while (l < r) {
const mid = (l + r + 1) >> 1;
if (isValid(mid)) {
l = mid;
} else {
r = mid - 1;
}
}
return l;
}
|
