7296 Morse

最新推荐文章于 2021-10-25 07:05:30 发布

G-Howe

最新推荐文章于 2021-10-25 07:05:30 发布

阅读量318

点赞数

分类专栏： map

本文链接：https://blog.csdn.net/jk211766/article/details/84259440

版权

map 专栏收录该内容

2 篇文章 0 订阅

订阅专栏

map操作

A code developed by Samuel Morse was first used as a method of electronic communication between

two operators sending long and short electrical impulses. These impulses would activate an armature

equipped with an electromagnet. The duration of the impules and the silence between them evolved

into what is now known as Morse Code.

Letters are represented with a series of dots and/or dashes. SOS , the universal distress call, is represented by ‘... --- ...’ (S =...and O =---). Typically, letters are separated by long pauses between them, otherwise they cannot be properly distinguished. Without the proper pauses, the code gets obfuscated.

The word ACM is represented in Morse Code by ‘.- -.-. --’, but ANY is represented by ‘.- -.-.--’ and without the spacing between code letters, the words ACM and ANY are indistinguishable(.--.-.--).

Input

Input consists of the morse code conversion followed by a dictionary of valid words, then a number of test cases with words in morse code.

The first 26 lines of input each contain a unique upper case letter, a single space, and the morse code equivalent. The letters are in alphabetical order. The morse code equivalents will be exactly the same as the ones below in Sample Input.The next line contains the number of valid words,N(1 <=N <=100). The following N lines each contain a word containing 1 to 100 uppercase letters.

The dictionary is followed by one or more test cases. Each begins with a line containing the number of code words W(1 <=W<= 100) or 0 (zero) indicating end of input. The following W lines each contain a code word, in morse code, with no spacing between individual code letters. Each code word will contain 1 to 400 ‘.’ and/or ‘-’ symbols. If a codeword matches a word in the dictionary, it will only match a single word in the dictionary.

Output

For each test case, if all of the codewords are found in the dictionary, print a line containing the

corresponding alphabetical word of each code word in a sentence on one line with each word separated

by a single space. If any codeword in the input does not appear in the dictionary, report only the first

such codeword followed by ‘not in dictionary.’ and do not print any corresponding alphabetical words.

Sample Input

A .-

B -...

C -.-.

D -..

E .

F ..-.

G --.

H ....

I ..

ACM-ICPC Live Archive:

7296 – Morse

2/2

J .---

K -.-

L .-..

M --

N -.

O ---

P .--.

Q --.-

R .-.

S ...

T -

U ..-

V ...-

W .--

X -..-

Y -.--

Z --..

PROGRAMMING

REGIONAL

PARIS

CONTEST

CENTRAL

SOUTH

ACM

.--.-.--

...---..--....

-.-..-.-.-..-.-..

.-..--...----..-.-..

.--..-.-----..-..-----..-.--.

-.-.----.-....-

.--.-.--

.-...---..-

.-...---..-.

.--.-.--

.--..-.-......

Sample Output

ACM SOUTH CENTRAL REGIONAL PROGRAMMING CONTEST

.-...---..- not in dictionary.

PARIS

代码：

#include <iostream>
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>
#include<algorithm>
using namespace std;
#include<queue>
#include<vector>
#include<stack>
#include<map>
typedef long long int LL;
#define MAX 100010
int main()
{
    int i,j,n,m;
    char a;
    string b,c,d,e,s[1000],f[1000];
    map<char,string>mp1;
    map<string,string>mp2;
    for(i=0;i<26;i++)
    {
        cin>>a>>b;
        mp1[a]=b;
    }
    cin>>n;
    for(i=0;i<n;i++)
    {
        cin>>s[i];
        c.clear();
        for(j=0;j<s[i].length();j++)
        {
            d=mp1[s[i][j]];
            c+=d;
        }
        mp2[c]=s[i];
    }
    while(scanf("%d",&m)!=EOF&&m!=0)
    {
        int p=-1,flag=0,bl=0,k=0;
        for(i=0;i<m;i++)
        {
            cin>>e;
            if(flag==1)
                continue;
            if(mp2.count(e)==0)
            {
                cout<<e<<" not in dictionary."<<endl;
                flag=1;
            }
            else
                f[k++]=mp2[e];
        }
        if(flag==0)
        {
            for(i=0;i<k;i++)
            {
                if(i==0)
                    cout<<f[i];
                else
                    cout<<" "<<f[i];
            }
            cout<<endl;
        }
    }
    return 0;
}