Submission #641763

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;

#define int long long

typedef pair<int,int>pint;
typedef vector<int>vint;
typedef vector<pint>vpint;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,f,n) for(int i=(f);i<(n);i++)
#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)
template<class T,class U>void chmin(T &t,U f){if(t>f)t=f;}
template<class T,class U>void chmax(T &t,U f){if(t<f)t=f;}

const int mod=1000000007;

const int L=3000;

string S;
int K;
int N;
vint G[3000];
bool isroot[3000];

int w[3000];
vint dp[3000];
int ord[3000];

vint tmp;

void solve(int v,int p=-1){
    w[v]=0;
    dp[v][L]=1;
    rep(hoge,G[v].size()){
        int to=G[v][hoge];
        if(to==p)continue;
        solve(to,v);
        if(w[v]<w[to]){
            swap(ord[v],ord[to]);
            swap(w[v],w[to]);
        }
        fill(all(tmp),0);
        int ww=w[v];
        vint &f=dp[ord[to]],&t=dp[ord[v]];
        for(int i=L-w[to];i<=L+w[to];i++){
            for(int j=L-w[v];j<=L+w[v];j++){
                int foo=(i-L)+(j-L)+L;
                if(foo<0||foo>2*L)continue;
                tmp[foo]=(tmp[foo]+f[i]*t[j])%mod;
                chmax(ww,foo-L);
            }
        }
        chmax(w[v],ww);
        rep(i,L*2+1)t[i]=tmp[i];
        //cout<<to<<"->"<<v<<":";for(int i=L-K;i<=L+K;i++)cout<<t[i]<<" ";cout<<endl;
    }

    fill(all(tmp),0);
    vint &t=dp[ord[v]];
    rep(i,L*2+1){
        if(i)tmp[i-1]+=t[i];
        if(i<L*2)tmp[i+1]+=t[i];
        tmp[i]+=t[i]*2;
    }
    rep(i,L*2+1){
        if(L-K<=i&&i<=L+K)t[i]=tmp[i];
        else t[i]=0;
    }
    w[v]=min(w[v]+1,L);

    //cout<<v<<":";for(int i=L-K;i<=L+K;i++)cout<<t[i]<<" ";cout<<endl;
}

signed main(){
    cin>>S>>K;K/=2;

    stack<int>st;
    rep(i,S.size()){
        if(S[i]==')'){
            int tmp=st.top();st.pop();
            if(st.empty())isroot[tmp]=true;
            else{
                int foo=st.top();
                G[foo].pb(tmp);
                G[tmp].pb(foo);
            }
        }
        else{
            st.push(N++);
        }
    }

    rep(i,N)dp[i].resize(L*2+1);
    rep(i,N)ord[i]=i;
    tmp.resize(L*2+1);
    int ans=1;
    rep(i,N)if(isroot[i]){
        solve(i);
        int sum=0;
        for(int j=L-K;j<=L+K;j++)sum+=dp[ord[i]][j];
        ans=sum%mod*ans%mod;
    }
    cout<<ans<<endl;
    return 0;
}

Submission Info

Judge Result