ACM-1002(使用STL)

时间限制: 2000ms 内存限制: 65536kB

描述

Businesses like to have memorable telephone numbers. One way to make a telephone number memorable is to have it spell a memorable word or phrase. For example, you can call the University of Waterloo by dialing the memorable TUT-GLOP. Sometimes only part of the number is used to spell a word. When you get back to your hotel tonight you can order a pizza from Gino's by dialing 310-GINO. Another way to make a telephone number memorable is to group the digits in a memorable way. You could order your pizza from Pizza Hut by calling their ``three tens'' number 3-10-10-10.

The standard form of a telephone number is seven decimal digits with a hyphen between the third and fourth digits (e.g. 888-1200). The keypad of a phone supplies the mapping of letters to numbers, as follows:

A, B, and C map to 2

D, E, and F map to 3

G, H, and I map to 4

J, K, and L map to 5

M, N, and O map to 6

P, R, and S map to 7

T, U, and V map to 8

W, X, and Y map to 9

There is no mapping for Q or Z. Hyphens are not dialed, and can be added and removed as necessary. The standard form of TUT-GLOP is 888-4567, the standard form of 310-GINO is 310-4466, and the standard form of 3-10-10-10 is 310-1010.

Two telephone numbers are equivalent if they have the same standard form. (They dial the same number.)

Your company is compiling a directory of telephone numbers from local businesses. As part of the quality control process you want to check that no two (or more) businesses in the directory have the same telephone number

/*
输入 
The input will consist of one case. The first line of the input specifies the number of telephone numbers in the directory (up to 100,000) as a positive integer alone on the line. The remaining lines list the telephone numbers in the directory, with each number alone on a line. Each telephone number consists of a string composed of decimal digits, uppercase letters (excluding Q and Z) and hyphens. Exactly seven of the characters in the string will be digits or letters.

输出 
Generate a line of output for each telephone number that appears more than once in any form. The line should give the telephone number in standard form, followed by a space, followed by the number of times the telephone number appears in the directory. Arrange the output lines by telephone number in ascending lexicographical order. If there are no duplicates in the input print the line:

No duplicates.
*/

 代码如下:

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
string convert(string &a)//字母转换到对应数字
{
	string b(' ',a.length()+1);//由于要在第3位增加-号,所以b的长度要加1
	int j=0;//转换后的字符串下标
	for (int i=0;i<a.length();i++){
		if(a[i]=='-') continue;//-不转换,过滤掉
		else{
			if(a[i]>='0'&&a[i]<='9') b[j]=a[i];//数字不转换
			else  
         b[j]=(a[i]>='A'&&a[i]<='C')?'2':((a[i]>='D'&&a[i]<='F')?'3':((a[i]>='G'&&a[i]<='I')?'4':((a[i]>='J'&&a[i]<='L')?'5':((a[i]>='M'&&a[i]<='O')?'6':((a[i]=='P'||a[i]=='R'||a[i]=='S')?'7':((a[i]>='T'&&a[i]<='V')?'8':((a[i]>='W'&&a[i]<='Y')?'9':a[i])))))));  
       j++; 
		}
	}
	return b.substr(0,j).insert(3,1,'-');//substr是因为去掉-后,结果子串的长度与b初始化的长度不一致了,所以要截取
}
int main(){
	int nums,count=1,t=1;
	string b;
	cin>>nums;
	vector<string> strs;//创建string容器存储多个string
	vector<string>::iterator it;//创建对应迭代器
	while(nums--){
		cin>>b;
		strs.push_back(convert(b));//输入string，进行转换后存放到容器中
	}
	sort(strs.begin(),strs.end());//容器中的string进行排序
	for(it=strs.begin();(it+1)!=strs.end();++it){//利用一个循环找出排好序的容器中重复的string及重复次数
	if(*it==*(it+1)){ count++;continue;}
  if(count>1){
    cout<<*it<<" "<<count<<endl;
	t=count;count=1;} 
	}
if(count>1)cout<<*it<<" "<<count<<endl; //需要处理最后一个string也是重复的情况
else {
	if(t==1)cout<<"No duplicates."<<endl;}//没有一个重复的元素
	system("pause");
	return 0;
}

 

其中字符转换那里如果使用SWITCH ...CASE方法，会快20ms的样子.

一开始老是超时,因为在main中用了2个for循环去找重复的号码,后来直接利用STL算法的SORT之后，变为一个for就AC了。

----第一个用STL过ACM的程序，纪念下！