#include <bits/stdc++.h>
using namespace std;
string decode(char c, const vector<int>& a) {
string res = "";
for (int i = 0; i < (int)a.size(); i++) {
res.append(a[i], c);
c ^= '(' ^ ')';
}
return res;
}
bool check(const string& s, const string& t) {
int n = s.length();
int m = t.length();
vector<int> bs(n + 1), bt(m + 1);
for (int i = 0; i < n; ++i) bs[i + 1] = bs[i] + (s[i] == '(' ? 1 : -1);
for (int i = 0; i < m; ++i) bt[i + 1] = bt[i] + (t[i] == '(' ? 1 : -1);
if (bs[n] + bt[m] != 0) {
return false;
}
vector dp(n + 1, vector<int>(m + 1, false));
dp[0][0] = true;
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= m; j++) {
if (!dp[i][j]) continue;
if (i < n && bs[i + 1] + bt[j] >= 0)
dp[i + 1][j] = true;
if (j < m && bs[i] + bt[j + 1] >= 0)
dp[i][j + 1] = true;
}
}
return dp[n][m];
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n; char c; cin >> n >> c;
vector<int> a(n);
for (auto &i : a) cin >> i;
int m; char k; cin >> m >> k;
vector<int> b(m);
for (auto &i : b) cin >> i;
string s = decode(c, a);
string t = decode(k, b);
int ans = 0;
for (int i = 0; i < (int)t.length(); i++) {
for (int j = i; j < (int)t.length(); j++) {
ans += check(s, t.substr(i, j - i + 1));
}
}
cout << ans << "\n";
return 0;
}
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 | #include <bits/stdc++.h> using namespace std; string decode(char c, const vector<int>& a) { string res = ""; for (int i = 0; i < (int)a.size(); i++) { res.append(a[i], c); c ^= '(' ^ ')'; } return res; } bool check(const string& s, const string& t) { int n = s.length(); int m = t.length(); vector<int> bs(n + 1), bt(m + 1); for (int i = 0; i < n; ++i) bs[i + 1] = bs[i] + (s[i] == '(' ? 1 : -1); for (int i = 0; i < m; ++i) bt[i + 1] = bt[i] + (t[i] == '(' ? 1 : -1); if (bs[n] + bt[m] != 0) { return false; } vector dp(n + 1, vector<int>(m + 1, false)); dp[0][0] = true; for (int i = 0; i <= n; i++) { for (int j = 0; j <= m; j++) { if (!dp[i][j]) continue; if (i < n && bs[i + 1] + bt[j] >= 0) dp[i + 1][j] = true; if (j < m && bs[i] + bt[j + 1] >= 0) dp[i][j + 1] = true; } } return dp[n][m]; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n; char c; cin >> n >> c; vector<int> a(n); for (auto &i : a) cin >> i; int m; char k; cin >> m >> k; vector<int> b(m); for (auto &i : b) cin >> i; string s = decode(c, a); string t = decode(k, b); int ans = 0; for (int i = 0; i < (int)t.length(); i++) { for (int j = i; j < (int)t.length(); j++) { ans += check(s, t.substr(i, j - i + 1)); } } cout << ans << "\n"; return 0; } |
English