|시간 제한||메모리 제한||제출||정답||맞힌 사람||정답 비율|
|2 초||128 MB||44||22||22||53.659%|
Freddy discovered a new procedure to grow much bigger cauliﬂowers. He wants to share this ﬁnding with his fellow gardener Tommy but he does not want anyone to steal the procedure. So the two gardeners agreed upon using a simple encryption technique proposed by M. E. Ohaver.
The encryption is based on the Morse code, which represents characters as variable-length sequences of dots and dashes. The following table shows the Morse code sequences for all letters:
Note that four possible dot-dash combinations are unassigned. For the purposes of this problem we will assign them as follows (note these are not the assignments for actual Morse code):
In practice, characters in a message are delimited by short pauses, typically displayed as spaces.
Thus, the message ACM GREATER NY REGION is encoded as:
.- -.-. -- ..-- --. .-. . .- - . .-. ..-- -. -.-- ..-- .-. . --. .. --- -.
The Ohaver’s encryption scheme is based on mutilating Morse code, namely by removing the pauses between letters. Since the pauses are necessary (because Morse is a variable-length encoding that is not preﬁx-free), a string is added that identiﬁes the number of dots and dashes in each character. For example, consider the message “.--.-.--”. Without knowing where the pauses should be, this could be “ACM”, “ANK”, or several other possibilities. If we add length information, such as “.--.-.-- 242”, then the code is unambiguous.
Ohaver’s scheme has three steps, the same for encryption and decryption:
As an example, consider the encrypted message “AKADTOF IBOETATUK IJN”. Converting to Morse code with a length string yields:
By reversing the numbers and decoding, we get the original message “ACM GREATER NY REGION”.
The security of this encoding scheme is not too high but Freddy believes it is suﬃcient for his purposes. Will you help Freddy to implement this encoding algorithm and to protect his sensitive information?
The input will consist of several messages encoded with Ohaver’s algorithm, each of them on one line. Each message will use only the twenty-six capital letters, underscores, commas, periods, and question marks. Messages will not exceed 1000 characters in length.
For each message in the input, output the decoded message on one line.
FENDSVTSLHW.EDATS,EULAY TRDNWPLOEF NTTTGAZEJUIIGDUZEHKUE QEWOISE.EIVCAEFNRXTBELYTGD. ?EJHUT.TSMYGW?EJHOT DSU.XFNCJEVE.OE_UJDXNO_YHU?VIDWDHPDJIKXZT?E ADAWEKHZN,OTEATWRZMZN_IDWCZGTEPION
FALSE_SENSE_OF_SECURITY CTU_PRAGUE TWO_THOUSAND_THIRTEEN QUOTH_THE_RAVEN,_NEVERMORE. TO_BE_OR_NOT_TO_BE? THE_QUICK_BROWN_FOX_JUMPS_OVER_THE_LAZY_DOG ADAPTED_FROM_ACM_GREATER_NY_REGION