Submission #1355077

---

Source Code Expand

#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <functional>
#include <cctype>
using namespace std;

#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)
#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)
#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)
#define int long long int

template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}

typedef pair<int, int> pii;
typedef long long ll;

int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
constexpr ll INF = 1001001001001001LL;
constexpr ll MOD = 1000000007LL;

struct Node {
    int Number;
    Node *left, *right;
};

int getNumber(string::iterator &it);
Node* getChildren(string::iterator &it);
Node* parseNode(string::iterator &it);

int getNumber(string::iterator &it) {
    int ret = 0;
    while(isdigit(*it)) {
        ret *= 10;
        ret += (*it - '0');
        it++;
    }
    return ret;
}

Node* getChildren(string::iterator &it) {
    if(*it == '(' && *(it+1) == ')') {
        it += 2;
        return NULL;
    }
    it++;
    Node *ret = parseNode(it);
    it++;
    return ret;
}

Node* parseNode(string::iterator &it) {
    // cerr << *it << endl;
    assert(*it == '(');
    Node *CurrentNode = new Node;
    CurrentNode->left = getChildren(it);
    it++; // '['
    CurrentNode->Number = getNumber(it);
    it++; // ']'
    CurrentNode->right = getChildren(it);
    return CurrentNode;
}

void dfs(Node *cur) {
    if(cur == NULL) return;
    cout << "(";
    dfs(cur->left);
    cout << ")";
    cout << "[";
    cout << cur->Number;
    cout << "]";
    cout << "(";
    dfs(cur->right);
    cout << ")";
}

Node *CreateTree(Node *ns, Node *nt) {
    if(ns == NULL || nt == NULL) return NULL;
    Node *ret = new Node;
    ret->Number = ns->Number + nt->Number;
    ret->left = CreateTree(ns->left, nt->left);
    ret->right = CreateTree(ns->right, nt->right);
    return ret;
}

signed main() {
    string s, t; cin >> s >> t;
    string::iterator its = s.begin(), itt = t.begin();
    Node *ns = parseNode(its), *nt = parseNode(itt);

    Node *ans = CreateTree(ns, nt);
    // dfs(ns); cout << endl;
    // dfs(nt); cout << endl;

    dfs(ans); cout << endl;
    return 0;
}

Submission Info

Judge Result