結果

問題 No.1304 あなたは基本が何か知っていますか？私は知っています．
ユーザー hedwig100hedwig100
提出日時 2020-12-05 18:34:47
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 31 ms / 2,000 ms
コード長 3,977 bytes
コンパイル時間 2,027 ms
コンパイル使用メモリ 176,284 KB
実行使用メモリ 23,044 KB
最終ジャッジ日時 2023-09-03 04:06:04
合計ジャッジ時間 44,955 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
7,532 KB
testcase_01 AC 2 ms
7,480 KB
testcase_02 AC 1 ms
8,748 KB
testcase_03 AC 2 ms
7,552 KB
testcase_04 AC 31 ms
23,044 KB
testcase_05 AC 13 ms
13,504 KB
testcase_06 AC 2 ms
7,824 KB
testcase_07 AC 23 ms
19,840 KB
testcase_08 AC 3 ms
7,580 KB
testcase_09 AC 21 ms
18,640 KB
testcase_10 AC 16 ms
15,856 KB
testcase_11 AC 22 ms
19,456 KB
testcase_12 AC 18 ms
16,512 KB
testcase_13 AC 11 ms
13,152 KB
testcase_14 AC 16 ms
15,564 KB
testcase_15 AC 14 ms
15,032 KB
testcase_16 AC 19 ms
16,064 KB
testcase_17 AC 4 ms
4,384 KB
testcase_18 AC 17 ms
12,520 KB
testcase_19 AC 9 ms
8,072 KB
testcase_20 AC 3 ms
4,384 KB
testcase_21 AC 7 ms
5,368 KB
testcase_22 AC 20 ms
13,484 KB
testcase_23 AC 24 ms
15,940 KB
testcase_24 AC 29 ms
19,580 KB
testcase_25 AC 2 ms
4,384 KB
testcase_26 AC 3 ms
4,384 KB
testcase_27 AC 3 ms
4,380 KB
testcase_28 AC 3 ms
4,380 KB
testcase_29 AC 2 ms
4,384 KB
testcase_30 AC 1 ms
4,380 KB
testcase_31 AC 2 ms
4,384 KB
testcase_32 AC 3 ms
4,380 KB
testcase_33 AC 2 ms
4,384 KB
testcase_34 AC 3 ms
4,384 KB
testcase_35 AC 2 ms
4,384 KB
testcase_36 AC 2 ms
4,384 KB
testcase_37 AC 2 ms
4,380 KB
testcase_38 AC 2 ms
4,384 KB
testcase_39 AC 2 ms
4,380 KB
testcase_40 AC 2 ms
4,384 KB
testcase_41 AC 2 ms
4,384 KB
testcase_42 AC 2 ms
4,384 KB
testcase_43 AC 2 ms
4,384 KB
testcase_44 AC 2 ms
4,380 KB
04_evil_A_01 RE -
04_evil_A_02 RE -
04_evil_A_03 RE -
04_evil_A_04 RE -
04_evil_A_05 RE -
04_evil_A_06 RE -
04_evil_A_07 RE -
04_evil_A_08 RE -
04_evil_A_09 RE -
04_evil_A_10 RE -
05_evil_B_01 MLE -
05_evil_B_02 MLE -
05_evil_B_03 MLE -
05_evil_B_04 MLE -
05_evil_B_05 MLE -
05_evil_B_06 MLE -
05_evil_B_07 MLE -
05_evil_B_08 MLE -
05_evil_B_09 MLE -
05_evil_B_10 MLE -
06_evil_C_01 TLE -
06_evil_C_02 TLE -
06_evil_C_03 TLE -
06_evil_C_04 TLE -
06_evil_C_05 TLE -
06_evil_C_06 TLE -
06_evil_C_07 TLE -
06_evil_C_08 TLE -
06_evil_C_09 TLE -
06_evil_C_10 AC 2 ms
8,724 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL_
void debug_out() {cerr << endl;}
template<typename Head,typename... Tail> void debug_out(Head H,Tail... T){cerr << ' ' << H; debug_out(T...);}
#define debug(...) cerr << 'L' << __LINE__ << " [" << #__VA_ARGS__ << "]:",debug_out(__VA_ARGS__)
#define dump(x) cerr << 'L' << __LINE__ << " " << #x << " = " << (x) << endl;
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif
#define rep(i,n) for (int i = 0; i < (int)(n); i ++)
#define irep(i,n) for (int i = (int)(n) - 1;i >= 0;--i)
using ll = long long;
using PL = pair<ll,ll>;
using P = pair<int,int>;
constexpr int INF = 1000000000;
constexpr long long HINF = 100000'00000'00000;
constexpr long long MOD = 1000000007;// = 998244353;
constexpr double EPS = 1e-4;
constexpr double PI = 3.14159265358979;

#pragma region Macros
template<typename T1,typename T2> ostream &operator<<(ostream &os,const pair<T1,T2> &p) {
    os << '(' << p.first << ',' << p.second << ')'; return os;
}
template<typename T> ostream &operator<<(ostream &os,const vector<T> &v) {
    os << '[';
    for (auto &e:v) {os << e << ',';}
    os << ']'; return os;
}
// grid searh
const int dy[8] = {-1,0,1,0,-1,-1,1,1};
const int dx[8] = {0,1,0,-1,-1,1,-1,1};
bool IN(int y,int x,int H,int W) {return (0 <= y)&&(y < H)&&(0 <= x)&&(x < W);}
//integer
template<class T> T gcd(T a,T b) {return (b ? gcd(b,a%b): a);}
#pragma endregion


template<int Modulus> 
struct ModInt {
    long long x;
    ModInt(long long x = 0) :x((x%Modulus + Modulus)%Modulus) {}
    constexpr ModInt &operator+=(const ModInt a) {if ((x += a.x) >= Modulus) x -= Modulus; return *this;}
    constexpr ModInt &operator-=(const ModInt a) {if ((x += Modulus - a.x) >= Modulus) x -= Modulus; return *this;}
    constexpr ModInt &operator*=(const ModInt a) {(x *= a.x) %= Modulus; return *this;}
    constexpr ModInt &operator/=(const ModInt a) {return *this *= a.inverse();}

    constexpr ModInt operator+(const ModInt a) const {return ModInt(*this) += a.x;}
    constexpr ModInt operator-(const ModInt a) const {return ModInt(*this) -= a.x;}
    constexpr ModInt operator*(const ModInt a) const {return ModInt(*this) *= a.x;}
    constexpr ModInt operator/(const ModInt a) const {return ModInt(*this) /= a.x;}
    
    friend constexpr ostream& operator<<(ostream& os,const ModInt<Modulus>& a) {return os << a.x;}
    friend constexpr istream& operator>>(istream& is,ModInt<Modulus>& a) {return is >> a.x;}
    
    ModInt inverse() const {// x ^ (-1) 
        long long a = x,b = Modulus,p = 1,q = 0;
        while (b) {long long d = a/b; a -= d*b; swap(a,b); p -= d*q; swap(p,q);}
        return ModInt(p);
    }
    ModInt pow(long long N) {// x ^ N 
        ModInt a = 1;
        while (N) {
            if (N&1) a *= *this;
            *this *= *this;
            N >>= 1;
        }
        return a;
    }
};

using mint = ModInt<998244353>;


int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(20);

    int N,K;
    ll X,Y; cin >> N >> K >> X >> Y;
    vector<int> A(K);
    rep(i,K) cin >> A[i];
    sort(A.begin(),A.end());
    A.erase(unique(A.begin(),A.end()),A.end());

    K = A.size();
    int bitsize = (1<<10);
    vector<vector<mint>> dp(K,vector<mint>(bitsize,0));
    rep(i,K) dp[i][A[i]] = 1;
    rep(i,N-1) {
        vector<mint> cumsum(bitsize,0);
        for (int x = 0;x < bitsize;++x) {
            for (int k = 0; k < K;++k) {
                cumsum[x] += dp[k][x];
            }
        }
        vector<vector<mint>> ndp(K,vector<mint>(bitsize,0));
        for (int j = 0;j < K;++j) {
            for (int x = 0;x < bitsize;++x) {
                ndp[j][x] = cumsum[A[j]^x] - dp[j][x^A[j]];
            }
        }
        swap(dp,ndp);
    }
    mint ans = 0;
    for (ll i = X;i <= Y;++i) {
        if (i < 0 || i >= bitsize) break;
        rep(j,K) ans += dp[j][i];
    }
    debug(dp);
    cout << ans << '\n';
    return 0;
}
0