TopCoder SRM 144 DIV2(550-point)

2023-12-15 14:03:44

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, thenQ[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 (using123210122 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 thatP[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 stringP 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)

Limits

Time limit (s):	2.000
Memory limit (MB):	64

Constraints

- message will contain between 1 and 50 characters, inclusive.

- Each character in message will be either ‘0‘, ‘1‘, ‘2‘, or ‘3‘.

Examples

"123210122"

Returns: { "011100011",  "NONE" }

The example from above.

"11"

Returns: { "01",  "10" }

We know that one of the digits must be ‘1‘, and the other must be ‘0‘. We return both cases.

"22111"

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 thatP[0] = 0.

"123210120"

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.

"3"

Returns: { "NONE",  "NONE" }

"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.

解析：

包括了string类、以及vector容器，花了一段时间去了解这些东西，但是还在仿照一个博客上面的方法做了出来。

发现还有很多东西并未搞懂，所以这个仅仅是照猫画虎吧~~

代码：

#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <cstring>
#include <vector>
using namespace std;

class BinaryCode{
    public:
    vector <string> decode(string message){
        vector <string> ret;
        string str1(message.size(), 0), str2(message.size(), 0);
        str1[0]=‘0‘;
        str2[0]=‘1‘;

        if(1==message.size()){
            if(message[0]<‘0‘||message[0]>‘1‘){
                str1="NONE";
                str2="NONE";
            }
            else if(message[0] == ‘0‘)
                str2 = "NONE";
            else if(message[0] == ‘1‘)
                str1 = "NONE";
        }
        else{
            int i;
            for(i=0; i<message.size(); ++i){
                if(0 == i){
                    if(str1!="NONE"){
                        str1[i+1] = message[i]-str1[i]+‘0‘;
                        if(str1[i+1]<‘0‘||str1[i+1]>‘1‘)
                            str1 = "NONE";
                    }
                    if(str2!="NONE"){
                        str2[i+1] = message[i]-str2[i]+‘0‘;
                        if(str2[i+1]<‘0‘||str2[i+1]>‘1‘)
                            str2 = "NONE";
                    }
                }
                else{
                    if(str1!="NONE"){
                        str1[i+1] = message[i]-str1[i]+‘0‘-str1[i-1]+‘0‘;
                        if(str1[i+1]<‘0‘||str1[i+1]>‘1‘)
                            str1 = "NONE";
                    }
                    if(str2!="NONE"){
                        str2[i+1] = message[i]-str2[i]+‘0‘-str2[i-1]+‘0‘;
                        if(str2[i+1]<‘0‘||str2[i+1]>‘1‘)
                            str2 = "NONE";
                    }
                }
            }

            if(str1!="NONE"&&message[i-1]!=str1[i-1]-‘0‘+str1[i-2])
                str1 = "NONE";
            if(str2!="NONE"&&message[i-1]!=str2[i-1]-‘0‘+str2[i-2])
                str2 = "NONE";
        }

        ret.push_back(str1);
        ret.push_back(str2);
        return ret;
    }
};