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
Polynomial Division
Consider a sequence, c0, c1, . . . , cn-1 , and a polynomial of degree 1 defined as Q(x ) = a * x + b. You must perform q queries on the sequence, where each query is one of the following two types: 1 i x: Replace ci with x. 2 l r: Consider the polynomial and determine whether is divisible by over the field , where . In other words, check if there exists a polynomial with integer coefficie
View Solution →Costly Intervals
Given an array, your goal is to find, for each element, the largest subarray containing it whose cost is at least k. Specifically, let A = [A1, A2, . . . , An ] be an array of length n, and let be the subarray from index l to index r. Also, Let MAX( l, r ) be the largest number in Al. . . r. Let MIN( l, r ) be the smallest number in Al . . .r . Let OR( l , r ) be the bitwise OR of the
View Solution →The Strange Function
One of the most important skills a programmer needs to learn early on is the ability to pose a problem in an abstract way. This skill is important not just for researchers but also in applied fields like software engineering and web development. You are able to solve most of a problem, except for one last subproblem, which you have posed in an abstract way as follows: Given an array consisting
View Solution →Self-Driving Bus
Treeland is a country with n cities and n - 1 roads. There is exactly one path between any two cities. The ruler of Treeland wants to implement a self-driving bus system and asks tree-loving Alex to plan the bus routes. Alex decides that each route must contain a subset of connected cities; a subset of cities is connected if the following two conditions are true: There is a path between ever
View Solution →Unique Colors
You are given an unrooted tree of n nodes numbered from 1 to n . Each node i has a color, ci. Let d( i , j ) be the number of different colors in the path between node i and node j. For each node i, calculate the value of sum, defined as follows: Your task is to print the value of sumi for each node 1 <= i <= n. Input Format The first line contains a single integer, n, denoti
View Solution →Fibonacci Numbers Tree
Shashank loves trees and math. He has a rooted tree, T , consisting of N nodes uniquely labeled with integers in the inclusive range [1 , N ]. The node labeled as 1 is the root node of tree , and each node in is associated with some positive integer value (all values are initially ). Let's define Fk as the Kth Fibonacci number. Shashank wants to perform 22 types of operations over his tree, T
View Solution →