#include <bits/stdc++.h>
#pragma GCC target ("avx2,fma")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#define ll long long
#define ld long double
#define endl '\n'
#define st first
#define nd second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define FOR(i,l,r) for(int i=(l);i<=(r);i++)
#define ROF(i,r,l) for(int i=(r);i>=(l);i--)
using namespace std;
int inf=1000000007;
ll infl=1000000000000000007;
const ll mod=1000000007;
#ifdef LOCAL
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif
bool DP[3007][3007];
int ans=0;
void calc(string s,string t)
{
int n=sz(s),m=sz(t);
FOR(i,0,n) FOR(j,0,m) DP[i][j]=0;
vector<int>S(n+1,0),T(m+1,0);
FOR(i,1,n)
{
S[i]=S[i-1];
if(s[i-1]=='(') S[i]++;
else S[i]--;
}
FOR(i,1,m)
{
T[i]=T[i-1];
if(t[i-1]=='(') T[i]++;
else T[i]--;
}
DP[0][0]=1;
FOR(i,0,n)
{
FOR(j,0,m)
{
if(i<n&&S[i+1]+T[j]>=0) DP[i+1][j]|=DP[i][j];
if(j<m&&S[i]+T[j+1]>=0) DP[i][j+1]|=DP[i][j];
}
}
FOR(j,1,m) if(S[n]+T[j]==0) ans+=DP[n][j];
}
signed main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
string s="",t="";
int n;
char cc;
cin>>n>>cc;
FOR(i,1,n)
{
int x;
cin>>x;
if((cc=='('&&i%2==1)||(cc==')'&&i%2==0))
{
FOR(j,1,x) s+='(';
}
else
{
FOR(j,1,x) s+=')';
}
}
cin>>n>>cc;
FOR(i,1,n)
{
int x;
cin>>x;
if((cc=='('&&i%2==1)||(cc==')'&&i%2==0))
{
FOR(j,1,x) t+='(';
}
else
{
FOR(j,1,x) t+=')';
}
}
FOR(i,0,sz(t)-1)
{
string T="";
FOR(j,i,sz(t)-1) T+=t[j];
calc(s,T);
}
cout<<ans<<endl;
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 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 | #include <bits/stdc++.h> #pragma GCC target ("avx2,fma") #pragma GCC optimize ("Ofast") #pragma GCC optimize ("unroll-loops") #define ll long long #define ld long double #define endl '\n' #define st first #define nd second #define pb push_back #define sz(x) (int)(x).size() #define all(x) (x).begin(), (x).end() #define FOR(i,l,r) for(int i=(l);i<=(r);i++) #define ROF(i,r,l) for(int i=(r);i>=(l);i--) using namespace std; int inf=1000000007; ll infl=1000000000000000007; const ll mod=1000000007; #ifdef LOCAL auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";} auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";} #define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X) #else #define debug(...){} #endif bool DP[3007][3007]; int ans=0; void calc(string s,string t) { int n=sz(s),m=sz(t); FOR(i,0,n) FOR(j,0,m) DP[i][j]=0; vector<int>S(n+1,0),T(m+1,0); FOR(i,1,n) { S[i]=S[i-1]; if(s[i-1]=='(') S[i]++; else S[i]--; } FOR(i,1,m) { T[i]=T[i-1]; if(t[i-1]=='(') T[i]++; else T[i]--; } DP[0][0]=1; FOR(i,0,n) { FOR(j,0,m) { if(i<n&&S[i+1]+T[j]>=0) DP[i+1][j]|=DP[i][j]; if(j<m&&S[i]+T[j+1]>=0) DP[i][j+1]|=DP[i][j]; } } FOR(j,1,m) if(S[n]+T[j]==0) ans+=DP[n][j]; } signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); string s="",t=""; int n; char cc; cin>>n>>cc; FOR(i,1,n) { int x; cin>>x; if((cc=='('&&i%2==1)||(cc==')'&&i%2==0)) { FOR(j,1,x) s+='('; } else { FOR(j,1,x) s+=')'; } } cin>>n>>cc; FOR(i,1,n) { int x; cin>>x; if((cc=='('&&i%2==1)||(cc==')'&&i%2==0)) { FOR(j,1,x) t+='('; } else { FOR(j,1,x) t+=')'; } } FOR(i,0,sz(t)-1) { string T=""; FOR(j,i,sz(t)-1) T+=t[j]; calc(s,T); } cout<<ans<<endl; return 0; } |
English