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
63
64
65
66
67
68
69
70
71
72
73
74
#include <bits/stdc++.h>

using namespace std;
#define pb push_back
#define st first
#define nd second
typedef long long ll;
typedef long double ld;
const ll I = 1'000'000'000'000'000'000LL;
const int II = 2'000'000'000;
const ll M = 1'000'000'007LL;
const int N = 5'007;
int tab[2][N];
ll dp[N][N];

void Solve()
{
    int n, m, m2 = 0, a;
    char z; int r;
    cin >> n >> z;
    r = (z == '(') ? 1 : -1;
    for(int i = 1; i <= n; ++i)
    {
        cin >> tab[0][i];
        tab[0][i] *= r;
        r *= -1;
    }
    cin >> m >> z;
    r = (z == '(') ? 1 : -1;
    for(int i = 1; i <= m; ++i)
    {
        cin >> a;
        while(a > 0)
        {
            tab[1][++m2] = r;
            --a;
        }
        r *= -1;
    }
    m = m2;
    ll ans = 0LL;
    for(int l = 1; l <= m; ++l)
    {
        dp[0][0] = 0;
        for(int i = 0; i <= n; ++i)
            for(int k = 0; k <= m - l + 1; ++k)
            {
                int j = l + k - 1;
                if(i == 0 && k == 0) continue;
                dp[i][k] = -I;
                if(i > 0 && dp[i - 1][k] >= 0)
                    dp[i][k] = dp[i - 1][k] + tab[0][i];
                if(k > 0 && dp[i][k - 1] >= 0)
                    dp[i][k] = dp[i][k - 1] + tab[1][j];
            }

        for(int k = 1; k <= m - l + 1; ++k)
            if(dp[n][k] == 0LL)
                ++ans;
        // cout << l << " " << ans << "\n";
    }
    cout << ans << '\n';
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    //int t; cin >> t;
    //while(t--)
        Solve();

    return 0;
}