aboutsummaryrefslogtreecommitdiff
path: root/min_time_complete_trip.cpp
blob: 2e325a21a776bee00f45086c0c4784df075ea04a (plain)
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
// 2187. Minimum Time to Complete Trips
#include "leetcode.h"

/*
 * given array 'time' where 'time[i]' denotes the time taken by the 'i'th bus to
 * complete one trip. each bus can make multiple trips successively; that is,
 * the next trip can start immediately after completing the current trip. also,
 * each bus operates independently; that is, the trips of one bus do not
 * influence the trips of any other bus. also given an integer 'totalTrips',
 * which denotes the number of trips all buses should make in total. return the
 * minimum time required to complete all trips.
 */

class Solution {
public:
  long long minimumTime(vector<int> &time, int totalTrips) {
    long long l = 0, r = LLONG_MAX / time.size();
    while (l < r) {
      long long m = (l + r) / 2, trips = 0;
      for (int t : time)
        trips += m / t;
      if (trips < totalTrips)
        l = m + 1;
      else
        r = m;
    }
    return l;
  }
};

int main() {
  Solution obj;
  vector<int> t1 = {1, 2, 3}, t2 = {2};
  printf("%lld\n", obj.minimumTime(t1, 5)); // expect: 3
  printf("%lld\n", obj.minimumTime(t2, 1)); // expect: 2
}