|
| 1 | +class Solution { |
| 2 | +public: |
| 3 | + vector<int> maxTargetNodes(vector<vector<int>>& edges1, vector<vector<int>>& edges2, int k) { |
| 4 | + if (k==0) { |
| 5 | + return vector<int>(edges1.size() + 1, 1); |
| 6 | + } |
| 7 | + int n = edges1.size() + 1, m = edges2.size() + 1; |
| 8 | + vector<vector<int>> mp1(n), mp2(m); |
| 9 | + for (auto edge : edges1) { |
| 10 | + mp1[edge[0]].push_back(edge[1]); |
| 11 | + mp1[edge[1]].push_back(edge[0]); |
| 12 | + } |
| 13 | + for (auto edge : edges2) { |
| 14 | + mp2[edge[0]].push_back(edge[1]); |
| 15 | + mp2[edge[1]].push_back(edge[0]); |
| 16 | + } |
| 17 | + auto bfs = [](vector<vector<int>>& mp, int k) { |
| 18 | + int n = mp.size(); |
| 19 | + vector<int> tot(n, 0); |
| 20 | + for (int ind = 0; ind < n; ++ind) { |
| 21 | + vector<bool> vis(n, false); |
| 22 | + queue<int> q; |
| 23 | + q.push(ind); |
| 24 | + vis[ind] = true; |
| 25 | + int level = 0; |
| 26 | + while (!q.empty() && level < k) { |
| 27 | + int qsize = q.size(); |
| 28 | + level++; |
| 29 | + |
| 30 | + for (int i = 0; i < qsize; ++i) { |
| 31 | + int top = q.front(); |
| 32 | + q.pop(); |
| 33 | + for (auto adjnode : mp[top]) { |
| 34 | + if (!vis[adjnode]) { |
| 35 | + vis[adjnode] = true; |
| 36 | + q.push(adjnode); |
| 37 | + } |
| 38 | + } |
| 39 | + } |
| 40 | + } |
| 41 | + tot[ind] = count(vis.begin(), vis.end(), true); |
| 42 | + } |
| 43 | + return tot; |
| 44 | + }; |
| 45 | + vector<int> tot1 = bfs(mp1, k); |
| 46 | + vector<int> tot2 = bfs(mp2, k - 1); |
| 47 | + int maxi = *max_element(tot2.begin(), tot2.end()); |
| 48 | + vector<int> ans(tot1.size(), 0); |
| 49 | + for (int i = 0; i < tot1.size(); ++i) { |
| 50 | + ans[i] = tot1[i] + maxi; |
| 51 | + } |
| 52 | + return ans; |
| 53 | + } |
| 54 | +}; |
0 commit comments