2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest A Email Aliases（模拟STL vector+map）

Email AliasesCrawling in process... Crawling failed Time Limit:2000MS     Memory Limit:524288KB     64bit IO Format:%I64d & %I64u

Submit Status

Description

 

Input

 

Output

 

Sample Input

 

Sample Output

 

Hint

 

Description

Polycarp has quite recently learned about email aliases. Of course, he used to suspect that the case of the letters doesn't matter in email addresses. He also learned that a popular mail server in Berland bmail.com ignores dots (characters '.') and all the part of an address from the first character "plus" ('+') to character "at" ('@') in a login part of email addresses.

Formally, any email address in this problem will look like "login@domain", where:

• a "login" is a non-empty sequence of lowercase and uppercase letters, dots ('.') and pluses ('+'), which starts from a letter;
• a "domain" is a non-empty sequence of lowercase and uppercase letters and dots, at that the dots split the sequences into non-empty words, consisting only from letters (that is, the "domain" starts from a letter, ends with a letter and doesn't contain two or more consecutive dots).

When you compare the addresses, the case of the characters isn't taken into consideration. Besides, when comparing the bmail.com addresses, servers ignore the dots in the login and all characters from the first character "plus" ('+') to character "at" ('@') in login part of an email address.

For example, addresses [e-mail] and [e-mail] correspond to the same account. Similarly, addresses [e-mail] and [e-mail] also correspond to the same account (the important thing here is that the domains of these addresses are bmail.com). The next example illustrates the use of character '+' in email address aliases: addresses [e-mail], [e-mail] and [e-mail] also correspond to the same account on the server bmail.com. However, addresses [e-mail] and [e-mail] are not equivalent, because '+' is a special character only for bmail.com addresses.

Polycarp has thousands of records in his address book. Until today, he sincerely thought that that's exactly the number of people around the world that he is communicating to. Now he understands that not always distinct records in the address book represent distinct people.

Help Polycarp bring his notes in order by merging equivalent addresses into groups.

Input

The first line of the input contains a positive integer n (1 ≤ n ≤ 2·10⁴) — the number of email addresses in Polycarp's address book.

The following n lines contain the email addresses, one per line. It is guaranteed that all of them are correct. All the given lines are distinct. The lengths of the addresses are from 3 to 100, inclusive.

Output

Print the number of groups k and then in k lines print the description of every group.

In the i-th line print the number of addresses in the group and all addresses that belong to the i-th group, separated by a space. It is allowed to print the groups and addresses in each group in any order.

Print the email addresses exactly as they were given in the input. Each address should go to exactly one group.

Sample Input

Input

6
[e-mail]
[e-mail]
[e-mail]
[e-mail]
[e-mail]
[e-mail]

Output

4
2 [e-mail] [e-mail] 
2 [e-mail] [e-mail] 
1 [e-mail] 
1 [e-mail] 

/*
不用map，查找的时候会超时的，血的教训
*/
#include<iostream>
#include<bits/stdc++.h>
#include<string.h>
#include<string>
#include<stdio.h>
#define N 20010
using namespace std;
struct node
{
    string name,lname;//名字
};
int main()
{
    //freopen("in.txt","r",stdin);
    int n,i;
    node fr[N];
    char ch[];
    int num[N]={};
    map<string,int>mop;
    vector<string>v[N];
    int ans=;
    int len=;
    bool visit[N];
    scanf("%d",&n);
        getchar();
        for(int i=;i<n;i++)//处理大小写
        {
            v[i].clear();
            scanf("%s",&ch);
            fr[i].name=ch;
            fr[i].lname=fr[i].name;
            transform(fr[i].lname.begin(), fr[i].lname.end(), fr[i].lname.begin(), ::toupper);
            v[i].clear();
            //cout<<i<<endl;
            string s="";
            if(fr[i].lname.size()>=)
                s=fr[i].lname.substr(fr[i].lname.size()-,fr[i].lname.size()-);
            //cout<<s<<endl;
            if(s=="@BMAIL.COM")//特殊邮箱的
            {
                string str="";
                for(int j=;j<fr[i].name.size();j++)
                {
                    if(fr[i].name[j]=='+'||fr[i].name[j]=='@')
                        break;
                    if(fr[i].name[j]=='.')
                        continue;
                    str+=fr[i].lname[j];
                }
                fr[i].lname=str;
            }//处理完了
            if(mop.find(fr[i].lname)==mop.end())mop[fr[i].lname]=len++;
            int o=mop[fr[i].lname];
            ++num[o];
            v[o].push_back(fr[i].name);
            /*int flag=0;
            for(int j=0;j<len;j++)//寻找的这个地方超时
            {
                if(fr[i].lname==fr[j].lname)
                {
                    v[j].push_back(fr[i].name);
                    flag=1;
                    visit[i]=false;
                }
            }
            if(flag==0)
            {
                v[len++].push_back(fr[i].name);
                ans++;
            }*/
        }
        printf("%d\n",len);
        for(int i=;i<len;i++)
        {
            printf("%d",num[i]);
            for(int j=;j<v[i].size();j++)
            {
                printf(" %s",v[i][j].c_str());
            }
            printf("\n");
        }
    return ;
}