-
Notifications
You must be signed in to change notification settings - Fork 0
/
Accounts_Merge.cpp
63 lines (63 loc) · 1.39 KB
/
Accounts_Merge.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
#include<iostream>
#include<vector>
#include<unordered_set>
#include<unordered_map>
using namespace std;
unordered_map<string, vector<string>> G;
unordered_set<string> seen;
vector<vector<string>> ans;
void dfs(string& email)
{
seen.insert(email);
ans.back().push_back(email);
for(auto& adjEmail : G[email])
if(!seen.count(adjEmail))
dfs(adjEmail);
}
vector<vector<string>> accountsMerge(vector<vector<string>>& A)
{
for(auto& acc : A)
for(int i = 2; i < size(acc); i++)
{
G[acc[i]].push_back(acc[i-1]);
G[acc[i-1]].push_back(acc[i]);
}
for(auto& acc : A)
if(!seen.count(acc[1]))
{
ans.push_back({acc[0]});
dfs(acc[1]);
sort(begin(ans.back())+1,end(ans.back()));
}
return ans;
}
int main()
{
int n;
cin>>n;
vector<vector<string>> A(n);
for(int i=0; i<n; i++)
{
string name;
cin>>name;
A[i].push_back(name);
int m;
cin>>m;
for(int j=0; j<m; j++)
{
string eid;
cin>>eid;
A[i].push_back(eid);
}
}
vector<vector<string>> ans=accountsMerge(A);
for(int i=0; i<ans.size(); i++)
{
cout<<ans[i][0]<<":";
for(int j=0; j<ans[i].size()-1; j++)
{
cout<<ans[i][j+1]<<", ";
}
cout<<endl;
}
}