Submission #1176854

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define int long long
using ll=long long;
using vi=vector<int>;
using vl=vector<long long>;
using pii=pair<int,int>;
using pll=pair<long long,long long>;
#define ITR(i,c) for(auto i=begin(c);i!=end(c);++i)
#define FORE(x,c) for(auto &x:c)
#define FOR(i,a,n) for(int i=a,i##_len=(int)(n);i<i##_len;++i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) for(int i=(int)(n);i>=0;--i)
#define ALL(c) begin(c),end(c)
#define RALL(c) rbegin(c),rend(c)   // c++14
#define SZ(c) ((int)c.size())
#define EXIST(c,x) (c.find(x)!=end(c))
#define dump(...)
const int DX[9]={0,1,0,-1,1,1,-1,-1,0},DY[9]={-1,0,1,0,-1,1,1,-1,0};
#define INF (1001001001)
#define INFLL (1001001001001001001ll)
template<class T> ostream& operator << (ostream &os,const vector<T> &v) {
    ITR(i,v) os << *i << (i==end(v)-1 ? "" : "\n"); return os; }
template<class T> istream& operator >> (istream &is,vector<T> &v) {
    ITR(i,v) is >> * i; return is; }
template<class T> istream& operator >> (istream &is, pair<T,T> &p) {
        is >> p.first >> p.second; return is; }
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return 1;}return 0;}
//------------------------------------------------------------------------------
struct before_main_function {
    before_main_function() {
        #ifdef int
            #undef INF
            #define INF INFLL
            #define stoi stoll
        #endif
        cin.tie(0);ios::sync_with_stdio(false);
        cout<<setprecision(15)<<fixed;
    }
} before_main_function;
//------------------------------------------------------------------------------

struct node {
    string left;
    int n;
    string right;
};
node compile(string s) {
    node ret;
    int k=1;
    string tmp="";
    int i;
    for(i=1;i<SZ(s);i++) {
        if(s[i]=='(') k++;
        if(s[i]==')') k--;
        if(k==0) break;
        tmp+=s[i];
    }
    ret.left=tmp;
    tmp="";
    i+=2;
    for(;i<SZ(s);i++) {
        if(s[i]==']') break;
        tmp+=s[i];
    }
    ret.n=stoi(tmp);
    tmp="";
    i+=2;
    k=1;
    for(;i<SZ(s);i++) {
        if(s[i]=='(') k++;
        if(s[i]==')') k--;
        if(k==0) break;
        tmp+=s[i];
    }
    ret.right=tmp;
    return ret;
}
string decompile(node n) {
    return "("+n.left+")["+to_string(n.n)+"]("+n.right+")";
}
node dfs(string a,string b) {
    node ret;
    node A=compile(a),B=compile(b);
    if(A.left=="" || B.left=="") ret.left="";
    else {
        ret.left=decompile(dfs(A.left,B.left));
    }
    if(A.right=="" || B.right=="") ret.right="";
    else {
        ret.right=decompile(dfs(A.right,B.right));
    }
    ret.n=A.n+B.n;
    return ret;
}
signed main() {
    string s,t;
    cin>>s>>t;
    cout<<decompile(dfs(s,t))<<endl;
    return 0;
}

Submission Info

Judge Result