SRM 114 DIV2 [550]
2008-04-25 17:27
344 查看
#include<iostream>
#include<vector>
#include<string>
using namespace std;
class BinaryCode
...{
public:
vector<string> decode(string message)
...{
vector<string> temp;
temp.push_back(message);
temp.push_back(message);
temp[0][0]='0';
temp[1][0]='1';
int len=message.size();
if (len==1)
switch (message[0])...{
case '0':
temp[1].assign("NONE");
break;
case '1':
temp[0].assign("NONE");
break;
default:
temp[0].assign("NONE");
temp[1].assign("NONE");
break;
}
else...{
for (int i=1;i!=len;++i)...{
if (i==1)...{
temp[0][i]=message[i-1]-temp[0][i-1]+'0';
temp[1][i]=message[i-1]-temp[1][i-1]+'0';
}
else...{
temp[0][i]=message[i-1]-temp[0][i-1]-temp[0][i-2]+'0'+'0';
temp[1][i]=message[i-1]-temp[1][i-1]-temp[1][i-2]+'0'+'0';
}
}
if (temp[0][len-1]+temp[0][len-2]!=message[len-1]+'0') temp[0].assign("NONE");
if (temp[1][len-1]+temp[1][len-2]!=message[len-1]+'0') temp[1].assign("NONE");
for (int i=1;i!=len;++i)...{
if (temp[0][i]>'1' || temp[0][i]<'0')...{
temp[0].assign("NONE");
}
if (temp[1][i]>'1' || temp[1][i]<'0')...{
temp[1].assign("NONE");
}
}
}
return temp;
}
};
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] = 0, 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 vector <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 | ||||||||||||
| ||||||||||||
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) | ||||||||||||
|
相关文章推荐
- SRM 114 DIV2 [550]
- 博弈论重要算法:Sprague-Grundy 定理 (SRM 561 Div1 550)
- SRM 114 DIV 2 [200]
- SRM 550 DIV2
- SRM 570 DIV1 550 CentaurCompany
- SRM 497 DIV1 550
- TopCoder 550 points 1-SRM 144 DIV 1 165/550 30%
- TopCoder SRM 677 Div. 2 550 - FourStrings (枚举)
- srm 144 div 2 550
- SRM 697 div2 550 推公式
- Topcoder SRM 144 Div1 550(数学和dp问题求方案数,很有意思)
- 小朋友学TopCoder(3):SRM144 DIV2 550-point
- TopCoder SRM 144 DIV2(550-point)
- TopCoder SRM 144 DIV1 550 Lottery
- 小朋友学TopCoder(5):SRM144 DIV1 550-point
- SRM 475 DIV1 900
- SRM 453.5(Div1)
- SRM 453 DIV1 总结
- srm 304 div2 1000(环形DP进阶,几何)
- SRM 590 DIV1 B题 XorCards ---- 高斯消元法