#889202 (C++17) No.2378 Cards and Subsequences

提出ソース

結果

問題	No.2378 Cards and Subsequences
ユーザー	asaringo
提出日時	2023-07-08 16:02:25
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	62 ms / 2,000 ms
コード長	5,042 bytes
コンパイル時間	2,879 ms
コンパイル使用メモリ	216,128 KB
実行使用メモリ	34,724 KB
最終ジャッジ日時	2023-09-29 17:24:17
合計ジャッジ時間	5,744 ms
ジャッジサーバーID （参考情報）	judge14 / judge15

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 4,380 KB
testcase_01	AC	2 ms 4,376 KB
testcase_02	AC	2 ms 4,380 KB
testcase_03	AC	2 ms 4,384 KB
testcase_04	AC	3 ms 4,376 KB
testcase_05	AC	2 ms 4,380 KB
testcase_06	AC	6 ms 6,196 KB
testcase_07	AC	6 ms 7,028 KB
testcase_08	AC	7 ms 7,672 KB
testcase_09	AC	9 ms 8,460 KB
testcase_10	AC	3 ms 4,520 KB
testcase_11	AC	46 ms 34,376 KB
testcase_12	AC	46 ms 34,480 KB
testcase_13	AC	45 ms 34,360 KB
testcase_14	AC	45 ms 34,624 KB
testcase_15	AC	45 ms 34,412 KB
testcase_16	AC	45 ms 34,524 KB
testcase_17	AC	46 ms 34,356 KB
testcase_18	AC	46 ms 34,436 KB
testcase_19	AC	45 ms 34,480 KB
testcase_20	AC	46 ms 34,408 KB
testcase_21	AC	45 ms 34,720 KB
testcase_22	AC	45 ms 34,724 KB
testcase_23	AC	45 ms 34,692 KB
testcase_24	AC	45 ms 34,676 KB
testcase_25	AC	44 ms 34,708 KB
testcase_26	AC	59 ms 34,460 KB
testcase_27	AC	60 ms 34,484 KB
testcase_28	AC	59 ms 34,336 KB
testcase_29	AC	61 ms 34,424 KB
testcase_30	AC	62 ms 34,432 KB
testcase_31	AC	54 ms 34,460 KB
testcase_32	AC	39 ms 34,372 KB
testcase_33	AC	48 ms 34,460 KB
testcase_34	AC	48 ms 34,464 KB
testcase_35	AC	48 ms 34,440 KB
testcase_36	AC	48 ms 34,452 KB
testcase_37	AC	8 ms 4,792 KB

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

ソースコード

raw source code

#include <bits/stdc++.h>
using namespace std;
#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(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 debug(a) cout << #a << " " << a << endl;
#define all(a) a.begin(), a.end()
#define endl "\n";
#define v1(n,a) vector<ll>(n,a)
#define v2(n,m,a) vector<vector<ll>>(n,v1(m,a))
#define v3(n,m,k,a) vector<vector<vector<ll>>>(n,v2(m,k,a))
#define v4(n,m,k,l,a) vector<vector<vector<vector<ll>>>>(n,v3(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;}

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, m, k;
    cin >> n >> m >> k;
    vector<int> S(n);
    vector<int> A(m);
    vector<int> B(m);
    cin >> S >> A >> B;
    rep(i,n) S[i]--;
    vector<int> previ(n,-1);
    rep(i,n) rep(x,i) if(S[i] == S[x]) previ[i] = x;
    vector<vector<modint>> dp(n+1,vector<modint>(k+1));
    set<int> st;
    rep(i,n){
        if(st.count(S[i])) continue;
        dp[i][A[S[i]]] += 1;
        dp[i][B[S[i]]] += 1;
        st.insert(S[i]);
    }
    vector<vector<modint>> cum(n+1,vector<modint>(k+1,0));
    rep(i,n){
        int pid = previ[i];
        int a = A[S[i]];
        int b = B[S[i]];
        rep(j,k+1){
            if(pid == -1){
                if(j - a >= 0) dp[i][j] += cum[i][j-a];
                if(j - b >= 0) dp[i][j] += cum[i][j-b];
            }
            else{
                if(j - a >= 0) dp[i][j] += cum[i][j-a] - cum[pid][j-a];
                if(j - b >= 0) dp[i][j] += cum[i][j-b] - cum[pid][j-b];
            }
            cum[i+1][j] = cum[i][j] + dp[i][j];
        }
    }
    pt(cum[n][k]);
}

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

yukicoder

結果

テストケース

ソースコード