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 | tourist | 3880 |
2 | jiangly | 3669 |
3 | ecnerwala | 3654 |
4 | Benq | 3627 |
5 | orzdevinwang | 3612 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | jqdai0815 | 3532 |
9 | Radewoosh | 3522 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | adamant | 156 |
4 | maroonrk | 153 |
5 | -is-this-fft- | 148 |
5 | atcoder_official | 148 |
5 | SecondThread | 148 |
8 | Petr | 147 |
9 | nor | 144 |
9 | TheScrasse | 144 |
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.