算法1

(BFS) $O(n)$

C++ 代码

/*
// Definition for Employee.
class Employee {
public:
    int id;
    int importance;
    vector<int> subordinates;
};
*/

class Solution {
private:
    Employee* h[2010];
public:
    int getImportance(vector<Employee*> employees, int id) {
        for(auto ep : employees)
            h[ep->id] = ep;
        long long ans = 0;
        queue<int> q;
        q.push(id);
        while(q.size()) {
            auto tid = q.front(); q.pop();
            ans += h[tid]->importance;
            for(auto id : h[tid]->subordinates)
                q.push(id);
        }
        return ans;
    }
};