Minimum Time Required
Problem Statement :
You are planning production for an order. You have a number of machines that each have a fixed number of days to produce an item. Given that all the machines operate simultaneously, determine the minimum number of days to produce the required order. For example, you have to produce goal = 10 items. You have three machines that take machines = [2, 3, 2 ] days to produce an item. The following is a schedule of items produced: Day Production Count 2 2 2 3 1 3 4 2 5 6 3 8 8 2 10 It takes 8 days to produce 10 items using these machines. Function Description Complete the minimumTime function in the editor below. It should return an integer representing the minimum number of days required to complete the order. minimumTime has the following parameter(s): machines: an array of integers representing days to produce one item per machine goal: an integer, the number of items required to complete the order Input Format The first line consist of two integers n and goal, the size of machines and the target production. The next line contains n space-separated integers, machines[ i ]. Constraints 1 <= n <= 10^5 1 <= goal <= 10^9 1 <= machines[ i ] <= 10^9 Output Format Return the minimum time required to produce goal items considering all machines work simultaneously.
Solution :
Solution in C :
In C :
#include <stdio.h>
int main() {
int n;
long long goal, ans;
scanf("%d%lld", &n, &goal);
long long machines[n];
for (int i = 0; i < n; i++) {
scanf("%lld", &machines[i]);
}
long long low = 1;
long long high = 1e18;
while (low <= high) {
long long mid = (low + high) / 2;
long long done = 0;
for (int i = 0; i < n; i++) {
done += mid / machines[i];
if (done >= goal)
break;
}
if (done >= goal) {
high = mid - 1;
ans = mid;
} else
low = mid + 1;
}
printf("%lld\n", ans);
return 0;
}
Solution in C++ :
In C ++ :
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
long long goal,ans;
scanf("%d%lld",&n,&goal);
long long machines[n];
for(int i=0;i<n;i++)
{
scanf("%lld",&machines[i]);
}
long long low=1;
long long high=1e18;
while(low<=high)
{
long long mid=(low+high)/2;
long long done=0;
for(int i=0;i<n;i++)
{
done+=mid/machines[i];
if(done>=goal)
break;
}
if(done>=goal)
{
high=mid-1;
ans=mid;
}
else
low=mid+1;
}
printf("%lld\n",ans);
return 0;
}
Solution in Java :
In Java :
static long minTime(long[] machines, long goal) {
Arrays.sort(machines);
long max = machines[machines.length - 1];
long minDays = 0;
long maxDays = max*goal;
long result = -1;
while (minDays < maxDays) {
long mid = (minDays + maxDays) / 2;
long unit = 0;
for (long machine : machines) {
unit += mid / machine;
}
if (unit < goal) {
minDays = mid+1;
} else {
result = mid;
maxDays = mid;
}
}
return result;
}
Solution in Python :
In Python3 :
def minTime(machines, goal):
machines.sort()
low_rate = machines[0]
lower_bound = (goal // (len(machines) / low_rate))
high_rate = machines[-1]
upper_bound = (goal // (len(machines) / high_rate)) + 1
while lower_bound < upper_bound:
num_days = (lower_bound + upper_bound) // 2
total = getNumItems(machines, goal, num_days)
if total >= goal:
upper_bound = num_days
else:
lower_bound = num_days + 1
return int(lower_bound)
def getNumItems(machines, goal, num_days):
total = 0
for machine in machines:
total += (num_days // machine)
return total
View More Similar Problems
Tree: Level Order Traversal
Given a pointer to the root of a binary tree, you need to print the level order traversal of this tree. In level-order traversal, nodes are visited level by level from left to right. Complete the function levelOrder and print the values in a single line separated by a space. For example: 1 \ 2 \ 5 / \ 3 6 \ 4 F
View Solution →Binary Search Tree : Insertion
You are given a pointer to the root of a binary search tree and values to be inserted into the tree. Insert the values into their appropriate position in the binary search tree and return the root of the updated binary tree. You just have to complete the function. Input Format You are given a function, Node * insert (Node * root ,int data) { } Constraints No. of nodes in the tree <
View Solution →Tree: Huffman Decoding
Huffman coding assigns variable length codewords to fixed length input characters based on their frequencies. More frequent characters are assigned shorter codewords and less frequent characters are assigned longer codewords. All edges along the path to a character contain a code digit. If they are on the left side of the tree, they will be a 0 (zero). If on the right, they'll be a 1 (one). Only t
View Solution →Binary Search Tree : Lowest Common Ancestor
You are given pointer to the root of the binary search tree and two values v1 and v2. You need to return the lowest common ancestor (LCA) of v1 and v2 in the binary search tree. In the diagram above, the lowest common ancestor of the nodes 4 and 6 is the node 3. Node 3 is the lowest node which has nodes and as descendants. Function Description Complete the function lca in the editor b
View Solution →Swap Nodes [Algo]
A binary tree is a tree which is characterized by one of the following properties: It can be empty (null). It contains a root node only. It contains a root node with a left subtree, a right subtree, or both. These subtrees are also binary trees. In-order traversal is performed as Traverse the left subtree. Visit root. Traverse the right subtree. For this in-order traversal, start from
View Solution →Kitty's Calculations on a Tree
Kitty has a tree, T , consisting of n nodes where each node is uniquely labeled from 1 to n . Her friend Alex gave her q sets, where each set contains k distinct nodes. Kitty needs to calculate the following expression on each set: where: { u ,v } denotes an unordered pair of nodes belonging to the set. dist(u , v) denotes the number of edges on the unique (shortest) path between nodes a
View Solution →