853. Car Fleet

N cars are going to the same destination along a one lane road.  The destination is target miles away.

Each car i has a constant speed speed[i] (in miles per hour), and initial position position[i] miles towards the target along the road.

A car can never pass another car ahead of it, but it can catch up to it, and drive bumper to bumper at the same speed.

The distance between these two cars is ignored - they are assumed to have the same position.

A car fleet is some non-empty set of cars driving at the same position and same speed.  Note that a single car is also a car fleet.

If a car catches up to a car fleet right at the destination point, it will still be considered as one car fleet.

How many car fleets will arrive at the destination?

 

Example 1:

Input: target = 12, position = [10,8,0,5,3], speed = [2,4,1,1,3]
Output: 3
Explanation:
The cars starting at 10 and 8 become a fleet, meeting each other at 12.
The car starting at 0 doesn't catch up to any other car, so it is a fleet by itself.
The cars starting at 5 and 3 become a fleet, meeting each other at 6.
Note that no other cars meet these fleets before the destination, so the answer is 3.

Note:

1. 0 <= N <= 10 ^ 4
2. 0 < target <= 10 ^ 6
3. 0 < speed[i] <= 10 ^ 6
4. 0 <= position[i] < target
5. All initial positions are different.

位置从后往前计算

class Solution:
    def carFleet(self, target, position, speed):
        """
        :type target: int
        :type position: List[int]
        :type speed: List[int]
        :rtype: int
        """
        if not position: return 0
        res = len(position)
        a = [(i,j) for i,j in zip(position, speed)]
        a.sort()
        
        mi = (target-a[-1][0])/a[-1][1]
        for i in range(len(a)-2,-1,-1):
            t = (target-a[i][0])/a[i][1]
            if t<=mi: res-=1
            else: mi=t
        return res
    
s=Solution()
print(s.carFleet(target = 12, position = [10,8,0,5,3], speed = [2,4,1,1,3]))
print(s.carFleet(target = 10, position =  [0,4,2], speed = [2,1,3]))

Calculate time needed to arrive the target, sort by the start position.
Loop on each car from the end to the beginning. cur recorde the current biggest time (the slowest).
If another car needs less or equal time than cur, it can catch up this car.
Otherwise it will become the new slowest car, that is new lead of a car fleet.

 

Time Complexity:
O(NlogN)

 

C++:

 

    int carFleet(int target, vector<int>& pos, vector<int>& speed) {
        map<int, double> m;
        for (int i = 0; i < pos.size(); i++) m[-pos[i]] = (double)(target - pos[i]) / speed[i];
        int res = 0; double cur = 0;
        for (auto it : m) if (it.second > cur) cur = it.second, res++;
        return res;
    }