1376.Time Needed to Inform All Employees

tags: Medium,Tree,DFS,BFS

1376. Time Needed to Inform All Employees

題目描述

A company has n employees with a unique ID for each employee from 0 to n - 1. The head of the company is the one with headID.

Each employee has one direct manager given in the manager array where manager[i] is the direct manager of the i-th employee, manager[headID] = -1. Also, it is guaranteed that the subordination relationships have a tree structure.

The head of the company wants to inform all the company employees of an urgent piece of news. He will inform his direct subordinates, and they will inform their subordinates, and so on until all employees know about the urgent news.

The i-th employee needs informTime[i] minutes to inform all of his direct subordinates (i.e., After informTime[i] minutes, all his direct subordinates can start spreading the news).

Return the number of minutes needed to inform all the employees about the urgent news.

範例

Example 1:

Input: n = 1, headID = 0, manager = [-1], informTime = [0]
Output: 0
Explanation: The head of the company is the only employee in the company.

Example 2:

Input: n = 6, headID = 2, manager = [2,2,-1,2,2,2], informTime = [0,0,1,0,0,0]
Output: 1
Explanation: The head of the company with id = 2 is the direct manager of all the employees in the company and needs 1 minute to inform them all.
The tree structure of the employees in the company is shown.

Constraints:

• 1 <= n <= 10⁵
• 0 <= headID < n
• manager.length == n
• 0 <= manager[i] < n
• manager[headID] == -1
• informTime.length == n
• 0 <= informTime[i] <= 1000
• informTime[i] == 0 if employee i has no subordinates.
• It is guaranteed that all the employees can be informed.

解答

C++

class Solution {
public:
    int numOfMinutes(int n, int headID, vector<int>& manager, vector<int>& informTime) {
        ios_base::sync_with_stdio(0), cin.tie(0);
        if (n == 1) {
            return 0;
        }
        vector<int> adj[n];
        for (int i = 0; i < n; i ++) {
            if (manager[i] == -1) {
                continue;
            }
            adj[manager[i]].push_back(i);
        }

        vector<int> distance(n, 0);
        queue<int> frontier;
        frontier.push(headID);
        // distance[headID] = informTime[headID];
        while (not frontier.empty()) {
            int u = frontier.front();
            for (int v : adj[u]) {
                distance[v] = distance[u] + informTime[u];
                frontier.push(v);
            }
            frontier.pop();
        }
        return *max_element(distance.begin(), distance.end());
    }
};

Jerry Wu3 June, 2023

Python

class Solution:
    def numOfMinutes(self, n: int, headID: int, manager: List[int], informTime: List[int]) -> int:
        def find(node):
            if manager[node] != -1:
                informTime[node] += find(manager[node])
                manager[node] = -1
            return informTime[node]
        return max(map(find, range(n)))

Yen-Chi ChenSun, Jun 4, 2023

class Solution:
    def numOfMinutes(self, n: int, headID: int, manager: List[int], informTime: List[int]) -> int:
        if n == 1:
            return 0
        adj = [[] for _ in range(n)]
        for i in range(n):
            if manager[i] == -1:
                continue
            adj[manager[i]].append(i)

        distance = [0] * n
        frontier = deque()
        frontier.append(headID)
        while frontier:
            u = frontier.popleft()
            for v in adj[u]:
                distance[v] = distance[u] + informTime[u]
                frontier.append(v)
        return max(distance)
        

Jerry Wu3 June, 2023

Reference

回到題目列表