代码

#include <bits/stdc++.h>

using namespace std;

void add_n(const unsigned *a, int n, unsigned *b) {
  int i = 0;
  for (; i < n - 1; i += 2) {
    b[i] += a[i];
    b[i + 1] += a[i + 1];
  }
  for (; i < n; ++i) {
    b[i] += a[i];
  }
}

unsigned solve(int n, char *s) {
  int nsz = 1;
  unsigned *dp = new unsigned[n / 2 + 1]();
  unsigned *pd = new unsigned[n / 2 + 1];
  dp[0] = 1;
  for (int i = 0; i < n; ++i) {
    int sz = min(i + 1, n - i - 1) / 2 + 1;
    if (s[i] != ')') {
      if (i & 1) {
        copy_n(dp, min(nsz, sz - 1), pd + 1);
        pd[0] = 0;
        fill(pd + min(nsz + 1, sz), pd + sz, 0);
      } else {
        copy_n(dp, min(nsz, sz), pd);
        fill(pd + min(nsz, sz), pd + sz, 0);
      }
    }
    if (s[i] != '(') {
      if (i & 1) {
        add_n(dp, min(sz, nsz), pd);
      } else {
        add_n(dp + 1, min(nsz - 1, sz), pd);
      }
    }
    swap(pd, dp);
    nsz = sz;
  }
  return dp[0];
}

评测结果