номер по псп два вида скобок

#include <iostream>
#include <string>
#include <sstream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <memory.h>
#include <stdio.h>
#include <stack>
#include <deque>
#include <queue>
#include <set>
#include <iterator>
#include <map>
#include <iomanip>
#include <unordered_set>
#define int long long
#define pb push_back
#define double long double
#define endl "\n"
#define un unsigned
#define INF 1000000009
#define pii pair<int, int>
#define all(v) v.begin(), v.end()
using namespace std;

const int N = 1000000;
const int MOD = 1e9 + 7;

signed main()
{
    ios_base::sync_with_stdio();
    cin.tie(0);
    cout.tie(0);

    freopen("brackets2num2.in", "r", stdin);
    freopen("brackets2num2.out", "w", stdout);

    string s;
    cin >> s;

    int n = s.size() / 2;

    vector<vector<int>> dp(2 * n + 5, vector<int>(2 * n + 5, 0));

    dp[0][0] = 1;

    for (int i = 1; i <= 2 * n; i++)
    {
        for (int bal = 0; bal <= 2 * n; bal++)
        {
            if (bal > 0)
            {
                dp[i][bal] = dp[i - 1][bal - 1];
            }

            if (bal < n)
            {
                dp[i][bal] += dp[i - 1][bal + 1];
            }
        }
    }

    int ans = 0;
    int bal = 0;

    int open_k = 0, open_sq = 0;

    vector<pii> kr;

    for (int i = 0; i < s.size(); i++)
    {
        if (s[i] == '(')
        {
            bal++;
            open_k++;
            kr.push_back({ i,0 });
        }
        else if (s[i] == ')')
        {
            ans += dp[2 * n - i - 1][bal + 1] * (1 << ((2 * n - i - 1 - bal - 1) / 2));

            bal--;
            open_k--;
            kr.pop_back();
        }
        else if (s[i] == '[')
        {
            ans += dp[2 * n - i - 1][bal + 1] * (1 << ((2 * n - i - 1 - bal - 1) / 2));

            if (bal > 0 && open_k > 0 && kr.back().second == 0 && s[i - 1] != '[')
            {
                ans += dp[2 * n - i - 1][bal - 1] * (1 << ((2 * n - i - 1 - bal + 1) / 2));
            }

            for (int p = 0; p < kr.size(); p++)
            {
                kr[p].second++;
            }

            bal++;
            open_sq++;
        }
        else
        {
            if (bal > 0 && open_k > 0 && open_sq == 0)
            {
                ans += dp[2 * n - i - 1][bal - 1] * (1 << ((2 * n - i - 1 - bal + 1) / 2));
            }

            ans += 2 * dp[2 * n - i - 1][bal + 1] * (1 << ((2 * n - i - 1 - bal - 1) / 2));

            for (int p = 0; p < kr.size(); p++)
            {
                kr[p].second--;
            }

            bal--;
            open_sq--;
        }
    }

    cout << ans;
    return 0;
}