Ternary XOR(CodeForces-1328C)

C. Ternary XOR
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
A number is ternary if it contains only digits 0, 1 and 2. For example, the following numbers are ternary: 1022, 11, 21, 2002.

You are given a long ternary number x. The first (leftmost) digit of x is guaranteed to be 2, the other digits of x can be 0, 1 or 2.

Let’s define the ternary XOR operation ⊙ of two ternary numbers a and b (both of length n) as a number c=a⊙b of length n, where ci=(ai+bi)%3 (where % is modulo operation). In other words, add the corresponding digits and take the remainders of the sums when divided by 3. For example, 10222⊙11021=21210.

Your task is to find such ternary numbers a and b both of length n and both without leading zeros that a⊙b=x and max(a,b) is the minimum possible.

You have to answer t independent test cases.

Input
The first line of the input contains one integer t (1≤t≤104) — the number of test cases. Then t test cases follow. The first line of the test case contains one integer n (1≤n≤5⋅104) — the length of x. The second line of the test case contains ternary number x consisting of n digits 0,1 or 2. It is guaranteed that the first digit of x is 2. It is guaranteed that the sum of n over all test cases does not exceed 5⋅104 (∑n≤5⋅104).

Output
For each test case, print the answer — two ternary integers a and b both of length n and both without leading zeros such that a⊙b=x and max(a,b) is the minimum possible. If there are several answers, you can print any.

Example
inputCopy
4
5
22222
5
21211
1
2
9
220222021
outputCopy
11111
11111
11000
10211
1
1
110111011
110111010

题意：一个数字是3元的，只包括0 1 2三个数字，且第一个数字保证必须是2，剩下的数字是0 1 2中的，a和b的三进制异或运算⊙为一个长度为n的数c=a⊙b，其中ci=(ai+bi)%3(其中%为模运算)，就是两个数字都是n位的，每一位对应相加之和再对3取余所产生的值就是这个之前输入的n位数字，然后打印a,b，使max（a,b）是最小的情况。
思路：就是说max（a,b）就是a和b中的最大值得最小化，贪心，从第一位开始，最小化的话，2=1+1,0=0+0,1=1+0，当1的时候就要分辨大小了，我设第一个字符串为最大的，所以先要让第一个为1，第二个为2，然后退出去，因为要保证最大值得最小化，现在第一个字符串就是最大的，所以要保证之后的都是最小的数字，所以之后第一个都是0，第二个字符是本来的那个元素，然后就可以求出最大值的最小化的数字了。
代码

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<queue>
using namespace std;
int main ()
{
    int t;
    scanf("%d",&t);
    while(t--){
        int n;
        scanf("%d",&n);
        getchar();
        string ch;//本身的那个数字
        cin>>ch;
        string a,b;//拆成的两个数字
        int i;
        for(i=0;i<n;i++){
            if(ch[i]=='2'){
                a=a+'1';b=b+'1';//2的话平分成1+1
            }
            else if(ch[i]=='1'){//1的话，让第一是最大的数字为1，第二个为0
                a=a+'1';b=b+'0';break;
            }
            else if(ch[i]=='0'){
                a=a+'0';b=b+'0';//0的话平分成0+0
            }
        }
        for(int j=i+1;j<n;j++){
            a=a+'0';b=b+ch[j];//是第一个最大的保持最小化为0，第二个为原本数字
        }
        cout<<a<<endl;
        cout<<b<<endl;
    }
    return 0;
}