結果

問題 No.1304 あなたは基本が何か知っていますか？私は知っています．
ユーザー rniyarniya
提出日時 2020-12-01 23:49:06
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 7,360 bytes
コンパイル時間 1,934 ms
コンパイル使用メモリ 204,556 KB
実行使用メモリ 23,168 KB
最終ジャッジ日時 2024-06-12 12:45:19
合計ジャッジ時間 35,080 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 16 ms
18,592 KB
testcase_01 AC 22 ms
22,912 KB
testcase_02 AC 18 ms
18,588 KB
testcase_03 AC 114 ms
22,784 KB
testcase_04 WA -
testcase_05 AC 25 ms
23,040 KB
testcase_06 AC 18 ms
18,464 KB
testcase_07 WA -
testcase_08 AC 40 ms
18,588 KB
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 AC 26 ms
18,592 KB
testcase_13 AC 25 ms
23,040 KB
testcase_14 AC 26 ms
18,464 KB
testcase_15 WA -
testcase_16 AC 27 ms
18,588 KB
testcase_17 AC 28 ms
11,648 KB
testcase_18 AC 28 ms
11,392 KB
testcase_19 AC 24 ms
11,520 KB
testcase_20 AC 19 ms
11,648 KB
testcase_21 AC 30 ms
11,520 KB
testcase_22 WA -
testcase_23 AC 27 ms
11,648 KB
testcase_24 WA -
testcase_25 AC 54 ms
11,520 KB
testcase_26 AC 33 ms
11,648 KB
testcase_27 AC 34 ms
11,520 KB
testcase_28 AC 39 ms
11,648 KB
testcase_29 WA -
testcase_30 AC 43 ms
11,648 KB
testcase_31 AC 64 ms
11,520 KB
testcase_32 AC 35 ms
11,520 KB
testcase_33 AC 52 ms
11,520 KB
testcase_34 AC 35 ms
11,520 KB
testcase_35 AC 46 ms
11,520 KB
testcase_36 AC 58 ms
11,648 KB
testcase_37 AC 45 ms
11,520 KB
testcase_38 AC 43 ms
11,520 KB
testcase_39 AC 72 ms
11,648 KB
testcase_40 AC 47 ms
11,520 KB
testcase_41 AC 73 ms
11,648 KB
testcase_42 AC 47 ms
11,776 KB
testcase_43 AC 48 ms
11,520 KB
testcase_44 AC 59 ms
11,648 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 RE -
05_evil_B_02 RE -
05_evil_B_03 RE -
05_evil_B_04 RE -
05_evil_B_05 RE -
05_evil_B_06 RE -
05_evil_B_07 RE -
05_evil_B_08 RE -
05_evil_B_09 RE -
05_evil_B_10 RE -
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 12 ms
22,912 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
// const long long MOD=1000000007;
const long long MOD=998244353;
#define LOCAL
#pragma region Macros
typedef long long ll;
typedef __int128_t i128;
typedef unsigned int uint;
typedef unsigned long long ull;
#define ALL(x) (x).begin(),(x).end()
const int INF=1e9;
const long long IINF=1e18;
const int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
const char dir[4]={'D','R','U','L'};

template<typename T>
istream &operator>>(istream &is,vector<T> &v){
    for (T &x:v) is >> x;
    return is;
}
template<typename T>
ostream &operator<<(ostream &os,const vector<T> &v){
    for (int i=0;i<v.size();++i){
        os << v[i] << (i+1==v.size()?"": " ");
    }
    return os;
}
template<typename T,typename U>
ostream &operator<<(ostream &os,const pair<T,U> &p){
    os << '(' << p.first << ',' << p.second << ')';
    return os;
}
template<typename T,typename U,typename V>
ostream&operator<<(ostream &os,const tuple<T,U,V> &t){
    os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ')';
    return os;
}
template<typename T,typename U,typename V,typename W>
ostream&operator<<(ostream &os,const tuple<T,U,V,W> &t){
    os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ',' << get<3>(t) << ')';
    return os;
}
template<typename T,typename U>
ostream &operator<<(ostream &os,const map<T,U> &m){
    os << '{';
    for (auto itr=m.begin();itr!=m.end();){
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr!=m.end()) os << ',';
    }
    os << '}';
    return os;
}
template<typename T,typename U>
ostream &operator<<(ostream &os,const unordered_map<T,U> &m){
    os << '{';
    for (auto itr=m.begin();itr!=m.end();){
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr!=m.end()) os << ',';
    }
    os << '}';
    return os;
}
template<typename T>
ostream &operator<<(ostream &os,const set<T> &s){
    os << '{';
    for (auto itr=s.begin();itr!=s.end();){
        os << *itr;
        if (++itr!=s.end()) os << ',';
    }
    os << '}';
    return os;
}
template<typename T>
ostream &operator<<(ostream &os,const multiset<T> &s){
    os << '{';
    for (auto itr=s.begin();itr!=s.end();){
        os << *itr;
        if (++itr!=s.end()) os << ',';
    }
    os << '}';
    return os;
}
template<typename T>
ostream &operator<<(ostream &os,const unordered_set<T> &s){
    os << '{';
    for (auto itr=s.begin();itr!=s.end();){
        os << *itr;
        if (++itr!=s.end()) os << ',';
    }
    os << '}';
    return os;
}
template<typename T>
ostream &operator<<(ostream &os,const deque<T> &v){
    for (int i=0;i<v.size();++i){
        os << v[i] << (i+1==v.size()?"": " ");
    }
    return os;
}

void debug_out(){cerr << '\n';}
template<class Head,class... Tail>
void debug_out(Head&& head,Tail&&... tail){
    cerr << head;
    if (sizeof...(Tail)>0) cerr << ", ";
    debug_out(move(tail)...);
}
#ifdef LOCAL
#define debug(...) cerr << " ";\
cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n';\
cerr << " ";\
debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

template<typename T> T gcd(T x,T y){return y!=0?gcd(y,x%y):x;}
template<typename T> T lcm(T x,T y){return x/gcd(x,y)*y;}

template<class T1,class T2> inline bool chmin(T1 &a,T2 b){
    if (a>b){a=b; return true;} return false;
}
template<class T1,class T2> inline bool chmax(T1 &a,T2 b){
    if (a<b){a=b; return true;} return false;
}
#pragma endregion

template<uint32_t mod> class modint{
    using i64=int64_t;
    using u32=uint32_t;
    using u64=uint64_t;
public:
    u32 v;
    constexpr modint(const i64 x=0) noexcept :v(x<0?mod-1-(-(x+1)%mod):x%mod){}
    constexpr u32 &value() noexcept {return v;}
    constexpr const u32 &value() const noexcept {return v;}
    constexpr modint operator+(const modint &rhs) const noexcept {return modint(*this)+=rhs;}
    constexpr modint operator-(const modint &rhs) const noexcept {return modint(*this)-=rhs;}
    constexpr modint operator*(const modint &rhs) const noexcept {return modint(*this)*=rhs;}
    constexpr modint operator/(const modint &rhs) const noexcept {return modint(*this)/=rhs;}
    constexpr modint &operator+=(const modint &rhs) noexcept {
        v+=rhs.v;
        if (v>=mod) v-=mod;
        return *this;
    }
    constexpr modint &operator-=(const modint &rhs) noexcept {
        if (v<rhs.v) v+=mod;
        v-=rhs.v;
        return *this;
    }
    constexpr modint &operator*=(const modint &rhs) noexcept {
        v=(u64)v*rhs.v%mod;
        return *this;
    }
    constexpr modint &operator/=(const modint &rhs) noexcept {
        return *this*=rhs.pow(mod-2);
    }
    constexpr modint pow(u64 exp) const noexcept {
        modint self(*this),res(1);
        while (exp>0){
            if (exp&1) res*=self;
            self*=self; exp>>=1;
        }
        return res;
    }
    constexpr modint &operator++() noexcept {if (++v==mod) v=0; return *this;}
    constexpr modint &operator--() noexcept {if (v==0) v=mod; return --v,*this;}
    constexpr modint operator++(int) noexcept {modint t=*this; return ++*this,t;}
    constexpr modint operator--(int) noexcept {modint t=*this; return --*this,t;}
    constexpr modint operator-() const noexcept {return modint(mod-v);}
    template<class T> friend constexpr modint operator+(T x,modint y) noexcept {return modint(x)+y;}
    template<class T> friend constexpr modint operator-(T x,modint y) noexcept {return modint(x)-y;}
    template<class T> friend constexpr modint operator*(T x,modint y) noexcept {return modint(x)*y;}
    template<class T> friend constexpr modint operator/(T x,modint y) noexcept {return modint(x)/y;}
    constexpr bool operator==(const modint &rhs) const noexcept {return v==rhs.v;}
    constexpr bool operator!=(const modint &rhs) const noexcept {return v!=rhs.v;}
    constexpr bool operator!() const noexcept {return !v;}
    friend istream &operator>>(istream &s,modint &rhs) noexcept {
        i64 v; rhs=modint{(s>>v,v)}; return s;
    }
    friend ostream &operator<<(ostream &s,const modint &rhs) noexcept {
        return s<<rhs.v;
    }
};

using mint=modint<MOD>;
const int MAX_A=1024;
mint dp[2][MAX_A][MAX_A];

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N,K,X,Y; cin >> N >> K >> X >> Y;
    X=min(X,MAX_A); Y=min(Y,MAX_A);
    vector<int> cnt(MAX_A,0);
    for (int i=0;i<K;++i){
        int A; cin >> A;
        ++cnt[A];
    }

    dp[0][0][0]=1;
    for (int i=0;i<N;++i){
        int cur=i&1,nxt=cur^1;
        vector<mint> sum(MAX_A,0);
        for (int j=0;j<MAX_A;++j){
            for (int k=0;k<MAX_A;++k){
                sum[j]+=dp[cur][j][k];
            }
        }
        for (int j=0;j<MAX_A;++j){
            for (int k=0;k<MAX_A;++k){
                if (!cnt[k]) continue;
                dp[nxt][j^k][k]+=sum[j];
            }
        }
        for (int j=0;j<MAX_A;++j){
            for (int k=0;k<MAX_A;++k){
                if (!cnt[k]) continue;
                dp[nxt][j^k][k]-=dp[cur][j][k];
            }
        }
        for (int j=0;j<MAX_A;++j){
            for (int k=0;k<MAX_A;++k){
                dp[cur][j][k]=0;
            }
        }
    }

    mint ans=0;
    for (int j=X;j<=Y;++j){
        for (int k=0;k<MAX_A;++k){
            ans+=dp[N&1][j][k];
        }
    }

    cout << ans << '\n';
}
0