fork download
copy 
  1. #include <vector>
  2. #include <iostream>
  3. #include <unordered_map>
  4. #include <unordered_set>
  5. using namespace std;
  6.  
  7. void dfs(unordered_map<int, vector<int>> followMap, unordered_set<int>& visited, int follower) {
  8. 	visited.insert(follower);
  9. 	for (const auto& follow : followMap[follower]) {
  10. 		if (visited.find(follow) == visited.end()) {
  11. 			visited.insert(follow);
  12. 			dfs(followMap, visited, follow);
  13. 		}
  14. 	}
  15. }
  16.  
  17. int main() {
  18. 	int total_mem = 0, mem, total_edge = 0, follower, following;
  19. 	unordered_map<int, vector<int>> followMap, followerMap;
  20. 	cin >> total_mem;
  21. 	unordered_set<int> visited(total_mem);
  22. 	for (int i = 0; i < total_mem; i++)	cin >> mem;
  23. 	cin >> total_edge;
  24. 	for (int i = 0; i < total_edge; i++) {
  25. 		cin >> follower >> following;
  26. 		if (followMap.find(follower) == followMap.end())
  27. 			followMap[follower] = vector<int>();
  28. 		followMap[follower].push_back(following);
  29. 		if (followerMap.find(following) == followerMap.end())
  30. 			followerMap[following] = vector<int>();
  31. 		followerMap[following].push_back(follower);
  32. 	}
  33. 	cin >> follower >> following;
  34. 	dfs(followMap, visited, following);
  35. 	for(const auto& x : visited)
  36. 		cout<<x<<" ";
  37. 	cout<<endl;
  38. 	for(int i = 0;i < followerMap[follower].size();i++){
  39. 		if(visited.find(followerMap[follower][i]) != visited.end())
  40. 			cout<<followerMap[follower][i]<<" ";
  41. 	}
  42. 	return 0;
  43. }
Success #stdin #stdout 0s 5280KB
comments (?)
stdin
copy 
4
2
5
7
9
4
2 9
7 2
7 9
9 5
7
9
stdout
copy 
5 9
https://ideone.com/c80Bwf
language:
C++ (gcc 8.3)
created:
5 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!