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

提出ソース

結果

問題	No.2031 Colored Brackets
ユーザー	asaringo
提出日時	2023-11-09 01:26:33
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	52 ms / 2,000 ms
コード長	5,362 bytes
コンパイル時間	2,574 ms
コンパイル使用メモリ	210,640 KB
実行使用メモリ	38,656 KB
最終ジャッジ日時	2023-11-09 01:26:38
合計ジャッジ時間	4,977 ms
ジャッジサーバーID （参考情報）	judge13 / judge15

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,548 KB
testcase_01	AC	1 ms 6,548 KB
testcase_02	AC	2 ms 6,548 KB
testcase_03	AC	2 ms 6,548 KB
testcase_04	AC	15 ms 13,824 KB
testcase_05	AC	7 ms 7,424 KB
testcase_06	AC	10 ms 9,600 KB
testcase_07	AC	2 ms 6,548 KB
testcase_08	AC	23 ms 21,376 KB
testcase_09	AC	36 ms 27,520 KB
testcase_10	AC	37 ms 34,688 KB
testcase_11	AC	28 ms 26,624 KB
testcase_12	AC	41 ms 37,504 KB
testcase_13	AC	21 ms 19,584 KB
testcase_14	AC	43 ms 38,656 KB
testcase_15	AC	43 ms 38,656 KB
testcase_16	AC	52 ms 38,656 KB
testcase_17	AC	47 ms 38,656 KB
testcase_18	AC	36 ms 38,656 KB
testcase_19	AC	30 ms 31,744 KB
testcase_20	AC	20 ms 21,120 KB
testcase_21	AC	20 ms 22,016 KB
testcase_22	AC	23 ms 24,064 KB
testcase_23	AC	34 ms 36,480 KB
testcase_24	AC	1 ms 6,548 KB
testcase_25	AC	2 ms 6,548 KB
testcase_26	AC	2 ms 6,548 KB
testcase_27	AC	2 ms 6,548 KB
testcase_28	AC	2 ms 6,548 KB
testcase_29	AC	2 ms 6,548 KB
testcase_30	AC	2 ms 6,548 KB
testcase_31	AC	2 ms 6,548 KB
testcase_32	AC	2 ms 6,548 KB
testcase_33	AC	2 ms 6,548 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <bits/stdc++.h>
using namespace std;
#define overload2(a, b, c, ...) c
#define overload3(a, b, c, d, ...) d
#define overload4(a, b, c, d, e ...) e
#define overload5(a, b, c, d, e, f ...) f
#define overload6(a, b, c, d, e, f, g ...) g
#define fast_io ios::sync_with_stdio(false); cin.tie(nullptr);
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
typedef long long ll;
typedef long double ld;
#define chmin(a,b) a = min(a,b);
#define chmax(a,b) a = max(a,b);
#define bit_count(x) __builtin_popcountll(x)
#define leading_zero_count(x) __builtin_clz(x)
#define trailing_zero_count(x) __builtin_ctz(x)
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) a / gcd(a,b) * b
#define rep(...) overload3(__VA_ARGS__, rrep, rep1)(__VA_ARGS__)
#define rep1(i,n) for(int i = 0 ; i < n ; i++)
#define rrep(i,a,b) for(int i = a ; i < b ; i++)
#define repi(it,S) for(auto it = S.begin() ; it != S.end() ; it++)
#define pt(a) cout << a << endl;
#define print(...) printall(__VA_ARGS__);
#define debug(a) cout << #a << " " << a << endl;
#define all(a) a.begin(), a.end()
#define endl "\n";
#define v1(T,n,a) vector<T>(n,a)
#define v2(T,n,m,a) vector<vector<T>>(n,v1(T,m,a))
#define v3(T,n,m,k,a) vector<vector<vector<T>>>(n,v2(T,m,k,a))
#define v4(T,n,m,k,l,a) vector<vector<vector<vector<T>>>>(n,v3(T,m,k,l,a))
template<typename T,typename U>istream &operator>>(istream&is,pair<T,U>&p){is>>p.first>>p.second;return is;}
template<typename T,typename U>ostream &operator<<(ostream&os,const pair<T,U>&p){os<<p.first<<" "<<p.second;return os;}
template<typename T>istream &operator>>(istream&is,vector<T>&v){for(T &in:v){is>>in;}return is;}
template<typename T>ostream &operator<<(ostream&os,const vector<T>&v){for(auto it=v.begin();it!=v.end();){os<<*it<<((++it)!=v.end()?" ":"");}return os;}
template<typename T>istream &operator>>(istream&is,vector<vector<T>>&v){for(T &in:v){is>>in;}return is;}
template<typename T>ostream &operator<<(ostream&os,const vector<vector<T>>&v){for(auto it=v.begin();it!=v.end();){os<<*it<<((++it)!=v.end()?"\n":"");}return os;}
template<typename T>ostream &operator<<(ostream&os,const set<T>&v){for(auto it=v.begin();it!=v.end();){os<<*it<<((++it)!=v.end()?" ":"");}return os;}
template<typename T>ostream &operator<<(ostream&os,const multiset<T>&v){for(auto it=v.begin();it!=v.end();){os<<*it<<((++it)!=v.end()?" ":"");}return os;}
template<class... Args> void printall(Args... args){for(auto i:initializer_list<common_type_t<Args...>>{args...}) cout<<i<<" ";cout<<endl;}

const int mod = 998244353 ;

template< int mod >
struct ModInt {
    int x;

    ModInt() : x(0) {}

    ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}

    ModInt &operator+=(const ModInt &p) {
        if((x += p.x) >= mod) x -= mod;
        return *this;
    }

    ModInt &operator-=(const ModInt &p) {
        if((x += mod - p.x) >= mod) x -= mod;
        return *this;
    }

    ModInt &operator*=(const ModInt &p) {
        x = (int) (1LL * x * p.x % mod);
        return *this;
    }

    ModInt &operator/=(const ModInt &p) {
        *this *= p.inverse();
        return *this;
    }

    ModInt operator-() const { return ModInt(-x); }

    ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }

    ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }

    ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }

    ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }

    bool operator==(const ModInt &p) const { return x == p.x; }

    bool operator!=(const ModInt &p) const { return x != p.x; }

    ModInt inverse() const {
        int a = x, b = mod, u = 1, v = 0, t;
        while(b > 0) {
            t = a / b;
            swap(a -= t * b, b);
            swap(u -= t * v, v);
        }
        return ModInt(u);
    }

    ModInt pow(int64_t n) const {
        ModInt ret(1), mul(x);
        while(n > 0) {
            if(n & 1) ret *= mul;
            mul *= mul;
            n >>= 1;
        }
        return ret;
    }

    friend ostream &operator<<(ostream &os, const ModInt &p) {
        return os << p.x;
    }

    friend istream &operator>>(istream &is, ModInt &a) {
        int64_t t;
        is >> t;
        a = ModInt< mod >(t);
        return (is);
    }

    static int get_mod() { return mod; }
};

using modint = ModInt< mod >;

void solve(){
    int n;
    string S;
    cin >> n >> S;
    vector<int> L(n+1,0), R(n+1,0);
    rep(i,n){
        L[i+1] = L[i];
        R[i+1] = R[i];
        if(S[i] == '(') L[i+1]++;
        if(S[i] == ')') R[i+1]++;
    }
    if(L[n] != R[n]){
        pt(0)
        return;
    }
    vector<vector<modint>> dp(n+1,vector<modint>(n+1,0));
    dp[0][0] = 1;
    rep(i,n){
        int l = L[i];
        int r = R[i];
        rep(j,i+1){
            if(S[i] == '('){
                if(l - j - r >= 0){
                    dp[i+1][j+1] += dp[i][j];
                    dp[i+1][j] += dp[i][j];
                }
            }
            if(S[i] == ')'){
                if(l - j - r > 0){
                    dp[i+1][j] += dp[i][j];
                }
                if(j > 0 && l - j - r >= 0){
                    dp[i+1][j-1] += dp[i][j];
                }
            }
        }
    }
    pt(dp[n][0])
}

int main(){
    fast_io
    int t = 1;
    // cin >> t;
    rep(i,t) solve();
}

yukicoder

結果

テストケース

ソースコード