1002 487-3279

之前用stl::map,tle了

换sort+O(n)扫一遍ac

 

1. //3513284_AC_1235MS_2964K
2. #include<iostream>
3. #include<algorithm>
4. #include<string>
5. using namespace std;
6. #define MAXN 100000
8. int i,j,n,t;
9. int pad[26]={2,2,2,3,3,3,4,4,4,5,5,5,6,6,6,7,0,7,7,8,8,8,9,9,9,0};
10. bool god;
11. char buf[1000];
12. string tel[MAXN];
14. int main()
15. {
16.     //freopen("d:/in.txt","r",stdin);
17.     while(cin>>n)
18.     {
19.         for(i=0;i<n;++i)
20.         {
21.             scanf("%s",&buf);
22.             t=0;
23.             tel[i].resize(7);
24.             for(j=0;t<7&&j<strlen(buf);++j)
25.             {
26.                 if(buf[j]!='-')
27.                 {
28.                     if(buf[j]>='A'&&buf[j]<='Z')
29.                     {
30.                         tel[i][t++]=pad[buf[j]-'A']+48;
31.                     }
32.                     else
33.                     {
34.                         tel[i][t++]=buf[j];
35.                     }
36.                 }
37.             }
38.         }
39.         god=true;
40.         sort(tel,tel+n);
41.         for(i=0;i<n;)
42.         {
43.             t=1;
44.             for(j=i+1;j<n&&tel[j]==tel[i];++j)
45.             {
46.                 t++;
47.             }
48.             if(t>1)
49.             {
50.                 god=false;
51.                 printf("%c%c%c-%c%c%c%c %d/n",tel[i][0],tel[i][1],tel[i][2],
52.                     tel[i][3],tel[i][4],tel[i][5],tel[i][6],t);
53.             }
54.             i=j;
55.         }
56.         if(god)
57.         {
58.             cout<<"No duplicates./n";
59.         }
60.     }
61.     return 0;
62. }