CodeForce 898 C. Phone Numbers

最新推荐文章于 2022-05-22 00:06:39 发布

DlPF_C

最新推荐文章于 2022-05-22 00:06:39 发布

阅读量1.7k

点赞数

CC 4.0 BY-SA版权

分类专栏：日常

本文链接：https://blog.youkuaiyun.com/DlPF_C/article/details/78879071

日常专栏收录该内容

88 篇文章

订阅专栏

本文介绍了一个整理电话簿的算法题目，任务是合并重复的名字条目并去除尾号重复的电话号码，最终输出整理后的电话簿。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Vasya has several phone books, in which he recorded the telephone numbers of his friends. Each of his friends can have one or several phone numbers.

Vasya decided to organize information about the phone numbers of friends. You will be given n strings — all entries from Vasya's phone books. Each entry starts with a friend's name. Then follows the number of phone numbers in the current entry, and then the phone numbers themselves. It is possible that several identical phones are recorded in the same record.

Vasya also believes that if the phone number a is a suffix of the phone number b (that is, the number b ends up with a), and both numbers are written by Vasya as the phone numbers of the same person, then a is recorded without the city code and it should not be taken into account.

The task is to print organized information about the phone numbers of Vasya's friends. It is possible that two different people have the same number. If one person has two numbers x and y, and x is a suffix of y (that is, y ends in x), then you shouldn't print number x. If the number of a friend in the Vasya's phone books is recorded several times in the same format, it is necessary to take it into account exactly once.

Read the examples to understand statement and format of the output better.

Input

First line contains the integer n (1 ≤ n ≤ 20) — number of entries in Vasya's phone books.

The following n lines are followed by descriptions of the records in the format described in statement. Names of Vasya's friends are non-empty strings whose length does not exceed 10. They consists only of lowercase English letters. Number of phone numbers in one entry is not less than 1 is not more than 10. The telephone numbers consist of digits only. If you represent a phone number as a string, then its length will be in range from 1 to 10. Phone numbers can contain leading zeros.

Output

Print out the ordered information about the phone numbers of Vasya's friends. First output m — number of friends that are found in Vasya's phone books.

The following m lines must contain entries in the following format "name number_of_phone_numbers phone_numbers". Phone numbers should be separated by a space. Each record must contain all the phone numbers of current friend.

Entries can be displayed in arbitrary order, phone numbers for one record can also be printed in arbitrary order.

Examples

input
2
ivan 1 00123
masha 1 00123

output
2
masha 1 00123 
ivan 1 00123 

input
3
karl 2 612 12
petr 1 12
katya 1 612

output
3
katya 1 612 
petr 1 12 
karl 1 612 

input
4
ivan 3 123 123 456
ivan 2 456 456
ivan 8 789 3 23 6 56 9 89 2
dasha 2 23 789

output
2
dasha 2 23 789 
ivan 4 789 123 2 456 

题意：整理一个电话簿，要求：同名字的电话归在一起，同一个人的电话号码中如果一个电话是另一个电话的尾号，这个电话就舍去，相同的电话号码保留一个。最后输出整理后的电话簿。

纯模拟题，先将同名字的电话号码归在一起，然后再删除不符合要求的电话号码

#include <bits/stdc++.h>
using namespace std;
struct per
{
    char name[15];
    int num;
    int c[220];
    char tel[220][12];
};
int main()
{
    int n;
    while(scanf("%d",&n)!=EOF)
    {
        per a[n+10];
        for(int i=0;i<n;i++)
        {
            scanf("%s",a[i].name);
            scanf("%d",&a[i].num);
            for(int j=0;j<a[i].num;j++)
            {
                scanf("%s",a[i].tel[j]);
            }
        }
        //printf("dddddd\n");
//        for(int i=0;i<n;i++)
//        {
//            printf("%s",a[i].name);
//            printf(" %d",a[i].num);
//            for(int j=0;j<a[i].num;j++)
//            {
//                printf(" %s",a[i].tel[j]);
//            }
//            printf("\n");
//        }
        per ans[n+10];
        int q=0;
        int b[25];
        memset(b,1,sizeof(b));
        for(int i=0;i<n;i++)
        {
            if(b[i])
            {
                b[i]=0;
                strcpy(ans[q].name,a[i].name);
                ans[q].num=a[i].num;
                for(int  j=0;j<ans[q].num;j++)
                    strcpy(ans[q].tel[j],a[i].tel[j]);
                for(int j=i+1;j<n;j++)
                {
                    if(strcmp(ans[q].name,a[j].name)==0)
                    {
                        b[j]=0;
                        for(int k=0;k<a[j].num;k++)
                        {
                            strcpy(ans[q].tel[ans[q].num++],a[j].tel[k]);
                        }
                    }
                }
                memset(ans[q].c,1,sizeof(ans[q].c));
                for(int j=0;j<ans[q].num;j++)
                {
                    if(ans[q].c[j])
                    {
                        for(int k=0;k<ans[q].num;k++)
                        {
                            if(k==j||ans[q].c[k]==0)
                                continue;
                            int l1=strlen(ans[q].tel[j]);
                            int l2=strlen(ans[q].tel[k]);
                            if(l2>l1)
                                continue;
                            int flag=1;
                            for(int l=l2-1;l>=0;l--,l1--)
                            {
                                if(ans[q].tel[k][l]!=ans[q].tel[j][l1-1])
                                {
                                    flag=0;
                                    break;
                                }
                            }
                            if(flag)
                                ans[q].c[k]=0;
                        //printf("----------\n");
                        }
                    }
                }
                q++;
            }
        }
//        printf("--------\n");
//        for(int i=0;i<q;i++)
//        {
//            printf("%s",ans[i].name);
//            printf(" %d",ans[i].num);
//            for(int j=0;j<ans[i].num;j++)
//            {
//                printf(" %s",ans[i].tel[j]);
//            }
//            printf("\n");
//        }
//        printf("-------\n");
        printf("%d\n",q);
        for(int i=0;i<q;i++)
        {
            //printf("%d\n",ans[i].num);
            printf("%s",ans[i].name);
            int m=0;
            for(int j=0;j<ans[i].num;j++)
            {
                if(ans[i].c[j])
                    m++;
            }
            printf(" %d",m);
            for(int j=0;j<ans[i].num;j++)
            {
                if(ans[i].c[j])
                {
                    printf(" %s",ans[i].tel[j]);
                }
            }
            printf("\n");
        }
    }
    return 0;
}