My code for the pratice. It seems been written very disorder...., but pass the test. and only got 97 points.
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
class BinaryCode
{
vector<string> vsRet;
public:
vector<string> decode(string message);
};
vector<string> BinaryCode::decode(string message)
{
string::iterator ib,ie;
char ch;
bool b_p0error = false, b_p1error =false;
string p0(message.size(),'0'), p1(message.size(), '0');
p1[0] = '1';
p0[1] = message[0] - p0[0] + 0x30;
p1[1] = message[0] - p1[0] + 0x30;
if (message[0]>'1') b_p0error = true;
if (message[0]>'2') b_p1error = true;
for (int i=1; i<message.size()-1; i++)
{
ch = message[i] - p0[i-1] + 0x30 - p0[i] + 0x30;
if(ch >= '1')
{
if(ch == '1')
{
p0[i+1] = '1';
}
else
{
b_p0error = true;
}
}
ch = message[i] - p1[i-1] + 0x30 - p1[i] + 0x30;
if(ch >= '1')
{
if(ch == '1' )
{
p1[i+1] = '1';
}
else
{
b_p1error = true;
}
}
}
if((message[message.size()-1] - p0[message.size()-1] +0x30 - p0[message.size()-2] +0x30) > '0') b_p0error = true;;
if((message[message.size()-1] - p1[message.size()-1] +0x30 - p1[message.size()-2] +0x30) > '0') b_p1error = true;;
if(b_p0error) p0 = "NONE";
if(b_p1error) p1 = "NONE";
vsRet.push_back(p0);
vsRet.push_back(p1);
return vsRet;
};
int main()
{
BinaryCode bc;
string str1("22111");
bc.decode(str1);
return 0;
}
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
|
|
Class: |
BinaryCode |
Method: |
decode |
Parameters: |
string |
Returns: |
vector <string> |
Method signature: |
vector <string> decode(string message) |
(be sure your method is public) |
|
|
|
Constraints
|
- |
message will contain between 1 and 50 characters, inclusive. |
- |
Each character in message will be either '0', '1', '2', or '3'. |
Examples
|
0) |
|
|
|
Returns: { "011100011", "NONE" }
|
|
|
1) |
|
|
|
Returns: { "01", "10" }
|
We know that one of the digits must be '1', and the other must be '0'. We return both cases.
|
|
|
2) |
|
|
|
Returns: { "NONE", "11001" }
|
Since the first digit of the encrypted string is '2', the first two digits of the original string must be '1'. Our test fails when we try to assume that P[0] = 0.
|
|
|
3) |
|
|
|
Returns: { "NONE", "NONE" }
|
This is the same as the first example, but the rightmost digit has been changed to something inconsistent with the rest of the original string. No solutions are possible.
|
|
|
4) |
|
|
|
Returns: { "NONE", "NONE" }
|
|
|
5) |
|
|
"12221112222221112221111111112221111"
|
|
Returns:
{ "01101001101101001101001001001101001",
"10110010110110010110010010010110010" }
|
|
|
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.
分享到:
相关推荐
Topcoder软件比赛注册方法和平台使用 Topcoder算法大赛客户端安装流程 Topcoder算法大赛客户端登陆及使用 Topcoder算法大赛注册流程 Topcoder图形比赛注册方法和平台使用
适合topcoder新手
topcoder竞赛的算法讲座ppt
TopCoder比赛登录使用的客户端,需要配置Java环境
TopCoder新手入门指南,一步步操作既可以了,然后开启您的Topcoder编程之旅吧。
topcoder arena,包含ContestAppletProd.jnlp,CodeProcessor.jar,FileEdit.jar,TZTester,运行需要jre环境
Topcoder的Java客户端,安装前确定已经安装了JRE
你可以通过这道题去了解Topcoder的题目以及比赛形式
用于topcoder的第3方编辑器插件。
TopCoper SmartWordToy problem 解决方法,C++源码。 Problem Statement The toy company "I Can't Believe It Works!...Form: http://community.topcoder.com/stat?c=problem_statement&pm=3935&rd=6532
topcoder的比赛作品,编译通过的。可以放心使用。
给新手提供的TopCoder注册方法和平台使用 十分详细
topcoder入门,对想做tc,但又不知道怎么搞的很有帮助,我首先也不知道搞。
这是一类关于acm学习的资料,它详细的说明了Acm学习的内容,如何提高编写软件的能力
topcoder的在线答题系统
关于TopCoder的竞赛指导,不仅仅是SRM,还有Bug Race、软件比赛的资料,是我从网上收集的,大部分是中文的
关于TopCoder的一些程序竞赛的相关资料
无描述,下载的请自重 无描述,下载的请自重 无描述,下载的请自重 无描述,下载的请自重
topcoder算法讲座ppt