POJ1002-487-3279 map应用

487-3279

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 303418		Accepted: 54259

Description

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. 

Input

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. 

Output

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. 

链接

一、题意

        给定字母与数字的对应关系，要求检查输入中的所有电话号码，输出其中出现次数大于1的电话号码的标准格式。要求输出顺序按电话号码字典序排列。没有重复时记得输出"No duplicates."

二、思路

        使用STL中的map完成映射关系，并用map进行统计。最后输出重复的电话号码。用电话号码作为key可以实现对输出的排序。

三、代码

#include <iostream>
#include <sstream>
#include <iomanip>
#include <string>
#include <numeric>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <bitset>
#include <utility>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>

using namespace std;
typedef long long ll;
const int MAXN = 100100;
const int MOD7 = 1000000007;
const int MOD9 = 1000000009;
const int INF = 2000000000;//0x7fffffff
const double EPS = 1e-9;
const double PI = 3.14159265358979;
const int dir_4r[] = { -1, 1, 0, 0 };
const int dir_4c[] = { 0, 0, -1, 1 };
const int dir_8r[] = { -1, -1, -1, 0, 0, 1, 1, 1 };
const int dir_8c[] = { -1, 0, 1, -1, 1, -1, 0, 1 };

map<char, char> mp;
map<string, int> phones;

int main() {
	int n;
	char ch, phone[9], line[20];

	mp['A'] = mp['B'] = mp['C'] = '2';
	mp['D'] = mp['E'] = mp['F'] = '3';
	mp['G'] = mp['H'] = mp['I'] = '4';
	mp['J'] = mp['K'] = mp['L'] = '5';
	mp['M'] = mp['N'] = mp['O'] = '6';
	mp['P'] = mp['R'] = mp['S'] = '7';
	mp['T'] = mp['U'] = mp['V'] = '8';
	mp['W'] = mp['X'] = mp['Y'] = '9';
	for (char i = '0'; i <= '9'; ++i)
		mp[i] = i;

	scanf("%d", &n);
	while (n--) {
		scanf("%s", line);
		int index = 0;
		for (int i = 0; line[i]; ++i) {
			if (line[i] == '-')
				continue;
			phone[index++] = mp[line[i]];
			if (index == 3)
				phone[index++] = '-';
		}
		phone[8] = '\0';
		phones[phone]++;
	}

	bool flag = true;
	for (map<string, int>::iterator it = phones.begin(); it != phones.end(); ++it)
		if (it->second > 1) {
			flag = false;
			cout << it->first << " " << it->second << endl;
		}

	if (flag)
		printf("No duplicates.\n");

	//system("pause");
	return 0;
}