#785173 (C++17) No.2031 Colored Brackets

• 問題: No.2031 Colored Brackets
• ユーザー: noya2
• 提出日時: 2022-08-05 22:18:22
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 52 ms / 2,000 ms
• コード長: 4,182 bytes
• コンパイル時間: 4,518 ms
• コンパイル使用メモリ: 267,440 KB
• 実行使用メモリ: 38,656 KB
• 最終ジャッジ日時: 2024-09-15 19:21:48
• 合計ジャッジ時間: 6,300 ms
• ジャッジサーバーID （参考情報）: judge1 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,376 KB
testcase_02	AC	2 ms; 5,376 KB
testcase_03	AC	2 ms; 5,376 KB
testcase_04	AC	17 ms; 13,824 KB
testcase_05	AC	8 ms; 7,680 KB
testcase_06	AC	10 ms; 9,472 KB
testcase_07	AC	2 ms; 5,376 KB
testcase_08	AC	28 ms; 21,376 KB
testcase_09	AC	36 ms; 27,520 KB
testcase_10	AC	46 ms; 34,688 KB
testcase_11	AC	35 ms; 26,624 KB
testcase_12	AC	51 ms; 37,376 KB
testcase_13	AC	25 ms; 19,328 KB
testcase_14	AC	51 ms; 38,656 KB
testcase_15	AC	51 ms; 38,656 KB
testcase_16	AC	51 ms; 38,656 KB
testcase_17	AC	52 ms; 38,528 KB
testcase_18	AC	50 ms; 38,656 KB
testcase_19	AC	40 ms; 31,616 KB
testcase_20	AC	27 ms; 20,992 KB
testcase_21	AC	29 ms; 22,016 KB
testcase_22	AC	32 ms; 23,936 KB
testcase_23	AC	47 ms; 36,480 KB
testcase_24	AC	2 ms; 5,376 KB
testcase_25	AC	2 ms; 5,376 KB
testcase_26	AC	2 ms; 5,376 KB
testcase_27	AC	2 ms; 5,376 KB
testcase_28	AC	2 ms; 5,376 KB
testcase_29	AC	2 ms; 5,376 KB
testcase_30	AC	2 ms; 5,376 KB
testcase_31	AC	2 ms; 5,376 KB
testcase_32	AC	2 ms; 5,376 KB
testcase_33	AC	2 ms; 5,376 KB

ソースコード

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for (int i = 0; i < int(n); ++i)
#define repp(i,n,m) for (int i = m; i < int(n); ++i)
#define repb(i,n) for (int i = int(n)-1; i >= 0; --i)
#define all(v) v.begin(),v.end()
using namespace std;
using namespace atcoder;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using PL = pair<long long, long long>;
using pdd = pair<long double, long double>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;
using ppi = pair<P,int>;
using pip = pair<int,P>;
const int INF = 1001001007;
const long long mod1 = 1000000007LL;
const long long mod2 = 998244353LL;
const ll inf = 2e18;
const ld pi = 3.14159265358979323;
const ld eps = 1e-7;
template<typename T>void o(T a);
template<class T>istream &operator>>(istream &is,vector<T> &v){for(auto &e:v)is>>e;return is;}
template<class T>istream &operator>>(istream &is,vector<vector<T>> &v){for(auto &e:v)is>>e;return is;}
template<typename T>bool range(T a,T b,T x){return (a<=x&&x<b);}
template<typename T>bool rrange(T a,T b,T c,T d,T x,T y){return (range(a,c,x)&&range(b,d,y));}
template<typename T>void rev(vector<T> &v){reverse(v.begin(),v.end());}
void revs(string &s) {reverse(s.begin(),s.end());}
template<typename T>void sor(vector<T> &v, int f=0){sort(v.begin(),v.end());if(f!=0) rev(v);}
template<typename T>bool chmin(T &a,const T &b){if(a>b){a=b;return true;}return false;}
template<typename T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<typename T>void uniq(vector<T> &v){sor(v);v.erase(unique(v.begin(),v.end()),v.end());}
template<typename T>T cel(T a,T b){return (a+b-1)/b;}
template<typename T1, typename T2>void print(pair<T1,T2> a);
template<typename T>void print(vector<T> v);
template<typename T>void print(vector<vector<T>> v);
void print(){ putchar(' '); }
void print(bool a){ printf("%d", a); }
void print(int a){ printf("%d", a); }
void print(long a){ printf("%ld", a); }
void print(long long a){ printf("%lld", a); }
void print(char a){ printf("%c", a); }
void print(char a[]){ printf("%s", a); }
void print(const char a[]){ printf("%s", a); }
void print(long double a){ printf("%.15Lf", a); }
void print(const string& a){ for(auto&& i : a) print(i); }
template<class T> void print(const T& a){ cout << a; }
int out(){ putchar('\n'); return 0; }
template<class T> int out(const T& t){ print(t); putchar('\n'); return 0; }
template<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); putchar(' '); out(tail...); return 0; }
void o(){cout<<"!?"<<endl;}
template<typename T>void o(T a){cout<<a<<endl;}
template<typename T1,typename T2>void print(pair<T1,T2> a){print(a.first);print(),print(a.second);}
template<typename T>void print(vector<T> v){for(auto ite=v.begin();ite!=v.end();){print(*ite);if(++ite!=v.end())print();}}
template<typename T>void print(vector<vector<T>> v){for(auto ite=v.begin();ite!=v.end();){print(*ite);if(++ite!=v.end())out();}}
void yes(){out("Yes");}
void no (){out("No");}
void yn (bool t){if(t)yes();else no();}
template<typename T>void dame(bool t, T s){if(!t){out(s);exit(0);}}
vector<int> dx = {0,1,0,-1,1,1,-1,-1};
vector<int> dy = {1,0,-1,0,1,-1,-1,1};
const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string alp = "abcdefghijklmnopqrstuvwxyz";
const string NUM = "0123456789";

ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
ll mpow(ll x,ll n,ll m){if(n==0)return 1LL;x%=m;ll a=mpow(x,n/2,m);a=a*a%m;return (n&1)?a*x%m:a;}


void solve(){
    int n; cin >> n;
    string s; cin >> s;
    using mint = modint998244353;
    vector<vector<mint>> dp(n+1,vector<mint>(n+1,0));
    dp[0][0] = 1;
    int sum = 0;
    rep(i,n){
        rep(j,n+1){
            int x = j, y = sum - j;
            if (s[i] == '('){
                dp[i+1][x+1] += dp[i][x];
                dp[i+1][x] += dp[i][x];
            }
            else {
                if (x > 0) dp[i+1][x-1] += dp[i][x];
                if (y > 0) dp[i+1][x] += dp[i][x];
            }
        }
        sum += (s[i] == '(' ? 1 : -1);
    }
    out(dp[n][0].val());
}

int main(){
    int t = 1; //cin >> t;
    while(t--) solve();
}