TopCoder SRM Practice Room 144 DIV1
2014-02-23 00:00
351 查看
摘要: 摘自TopCoder/tc的算法题目
This problem statement is the exclusive and proprietary property of TopCoder, Inc. Any unauthorized use or reproduction of this information without the prior written consent of TopCoder, Inc. is strictly prohibited. (c)2003, TopCoder, Inc. All rights reserved.
Problem Statement | |||||||||||||
Let's say you have a binary string such as the following: 011100011 One way to encrypt this string is to add to each digit the sum of its adjacent digits. For example, the above string would become: 123210122 In particular, if P is the original string, and Q is the encrypted string, then Q[i] = P[i-1] + P[i] + P[i+1] for all digit positions i. Characters off the left and right edges of the string are treated as zeroes. An encrypted string given to you in this format can be decoded as follows (using 123210122 as an example): Assume P[0] = 0. Because Q[0] = P[0] + P[1] = 0 + P[1] = 1, we know that P[1] = 1. Because Q[1] = P[0] + P[1] + P[2] = 0 + 1 + P[2] = 2, we know that P[2] = 1. Because Q[2] = P[1] + P[2] + P[3] = 1 + 1 + P[3] = 3, we know that P[3] = 1. Repeating these steps gives us P[4] = 0, P[5] = 0, P[6] = 0, P[7] = 1, and P[8] = 1. We check our work by noting that Q[8] = P[7] + P[8] = 1 + 1 = 2. Since this equation works out, we are finished, and we have recovered one possible original string. Now we repeat the process, assuming the opposite about P[0]: Assume P[0] = 1. Because Q[0] = P[0] + P[1] = 1 + P[1] = 1, we know that P[1] = 0. Because Q[1] = P[0] + P[1] + P[2] = 1 + 0 + P[2] = 2, we know that P[2] = 1. Now note that Q[2] = P[1] + P[2] + P[3] = 0 + 1 + P[3] = 3, which leads us to the conclusion that P[3] = 2. However, this violates the fact that each character in the original string must be '0' or '1'. Therefore, there exists no such original string P where the first digit is '1'. Note that this algorithm produces at most two decodings for any given encrypted string. There can never be more than one possible way to decode a string once the first binary digit is set. Given a String message, containing the encrypted string, return a String[] with exactly two elements. The first element should contain the decrypted string assuming the first character is '0'; the second element should assume the first character is '1'. If one of the tests fails, return the string "NONE" in its place. For the above example, you should return {"011100011", "NONE"}. | |||||||||||||
Definition | |||||||||||||
| |||||||||||||
Limits | |||||||||||||
| |||||||||||||
Constraints | |||||||||||||
- | message will contain between 1 and 50 characters, inclusive. | ||||||||||||
- | Each character in message will be either '0', '1', '2', or '3'. | ||||||||||||
Examples | |||||||||||||
0) | |||||||||||||
| |||||||||||||
1) | |||||||||||||
| |||||||||||||
2) | |||||||||||||
| |||||||||||||
3) | |||||||||||||
| |||||||||||||
4) | |||||||||||||
| |||||||||||||
5) | |||||||||||||
|
相关文章推荐
- TopCoder Practice SRMs -- SRM 144 DIV 1 -- 300p
- TopCoder SRM144 DIV1(one)
- Topcoder SRM 600 ORSolitaire
- Topcoder srm log
- TopCoder SRM 659 Div2 Problem 500 - PublicTransit (思维)
- Topcoder SRM 573 WolfPackDivTwo
- Top Coder SRM 614 DIV 2
- TopCoder SRM 633 Div.2 500 Jumping
- Topcoder SRM 639 (Div.2)
- TopCoder SRM 548 1000分 dp+组合数
- topcoder srm 518 div 2
- Topcoder SRM 668 DIV 2
- 第一次参加Topcoder SRM
- TopCoder SRM 613 Div.2 C DFS+剪枝
- topcoder srm 519 div 1
- TopCoder SRM 681 Div. 2 Problem 500 - ExplodingRobots (枚举)
- TopCoder SRM 649 Div2 Problem 500 - CartInSupermarketEasy (区间DP)
- Topcoder SRM 652 DIV1 250
- [Topcoder SRM 467]均匀字符串Next…
- Topcoder SRM 656 DIV2 1000 题解(动态规划)