Submission #1836118

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define vi vector<int>
#define vvi vector<vi>
#define pb push_back
#define P pair<int,int>
#define PP pair<P,int>
#define fi first
#define se second
#define INF 1e9
#define MOD 1000000007
#define REP(i,n) for(int i=0;i<n;i++)
#define REPR(i,n) for(int i=n;i>=0;i--)
#define FOR(i,m,n) for(int i=m;i<n;i++)
#define all(x) (x).begin(),(x).end()
struct node{
    int x;
    node* l;
    node* r;
};
node* f(string st){
    if(st.length()==0){
        return NULL;
    }
    node* res=new node;
    int cnt=0;
    REP(i,st.length()){
        if(st[i]=='('){
            cnt++;
        }else if(st[i]==')'){
            cnt--;
        }
        if(cnt==0&&st[i]=='['){
            res->l=f(st.substr(1,i-2));
            i++;
            int rs=0;
            for(;;rs++){
                if(st[i+rs]==']'){
                    break;
                }
            }
            res->x=stoi(st.substr(i,rs));
            res->r=f(st.substr(i+rs+2,st.length()-3-i-rs));
        }
    }
    return res;
}
void output(node* a,node* b){
    if(a==NULL||b==NULL)return;
    cout<<'(';
    output(a->l,b->l);
    cout<<")["<<a->x+b->x<<"](";
    output(a->r,b->r);
    cout<<")";
}
int main(){
    string a;
    cin>>a;
    node* p=f(a);
    string b;
    cin>>b;
    node* q=f(b);
    output(p,q);
    cout<<endl;
    return 0;
}

Submission Info

Judge Result