I am struggling very hard with this easy problem. I am not sure how to solve it at all.
How should I go to it? Should I form a graph?
Ie
Email -> Account ID -> Email -> Account ID etc...?
Thanks
# | User | Rating |
---|---|---|
1 | jiangly | 3640 |
2 | Benq | 3593 |
3 | tourist | 3572 |
4 | orzdevinwang | 3561 |
5 | cnnfls_csy | 3539 |
6 | ecnerwala | 3534 |
7 | Radewoosh | 3532 |
8 | gyh20 | 3447 |
9 | Rebelz | 3409 |
10 | Geothermal | 3408 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 173 |
2 | adamant | 164 |
3 | awoo | 161 |
4 | TheScrasse | 160 |
5 | nor | 159 |
6 | maroonrk | 156 |
7 | SecondThread | 152 |
8 | pajenegod | 146 |
9 | BledDest | 144 |
10 | Um_nik | 143 |
I am struggling very hard with this easy problem. I am not sure how to solve it at all.
How should I go to it? Should I form a graph?
Ie
Email -> Account ID -> Email -> Account ID etc...?
Thanks
Name |
---|
Yes, you can create a graph with vertexes of emails and names. But it's important to create only one vertex for same emails, but different vertexes for same names — it's required by problem. Now, lets create edges — you have to connect account name with it's emails.
Now you have to find emails that belongs to some account. Just use BFS/DFS to process entire connectivity component and add them to some list.
It's easy to solve using
std::map
inC++
. Just createmap<int, string>
to get name of vertex by it's ID andmap<string, int>
to get ID by it's name. And again, dont forget that same account names must be different vertexes.