提出 #704540

---

ソースコード 拡げる

#include <bits/stdc++.h>

#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define ALL(x) (x).begin(),(x).end()

using namespace std;

template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }

using ll = long long;
using ld = long double;

const int INF = 1e9;
const ld eps = 1e-10, pi = acos(-1.0);

string a, b;
int p, q;

int number(string &s, int &p) {
  int res = 0;
  while (p < (int)s.size() && isdigit(s[p])) {
    res = 10 * res + (s[p] - '0');
    ++p;
  }
  return res;
}

void parse(int la, int ra, int lb, int rb) {
  //cout << la << " " << ra << " " << lb << " " << rb << endl;
  if (ra - la <= 1 || rb - lb <= 1) return;
  int cnt = 0, pos1 = -1, pos2 = -1;
  for (int i = la; i < ra; ++i) {
    if (a[i] == '(') ++cnt;
    if (a[i] == ')') --cnt;
    if (cnt == 0 && a[i] == '[') pos1 = i;
  }
  cnt = 0;
  for (int i = lb; i < rb; ++i) {
    if (b[i] == '(') ++cnt;
    if (b[i] == ')') --cnt;
    if (cnt == 0 && b[i] == '[') pos2 = i;
  }
  cout << "(";
  parse(la+1, pos1-1, lb+1, pos2-1);
  cout << ")[";
  ++pos1; ++pos2;
  cout << number(a, pos1) + number(b, pos2);
  cout << "](";
  parse(pos1+2, ra-1, pos2+2, rb-1);
  cout << ")";
}

int main() {
  cin >> a >> b;
  p = q = 0;
  parse(0, (int)a.size(), 0, (int)b.size());
  cout << endl;
  return 0;
}

提出情報

ジャッジ結果