結果

問題 No.1304 あなたは基本が何か知っていますか？私は知っています．
ユーザー Chanyuh
提出日時 2021-01-01 16:15:46
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 5,528 bytes
コンパイル時間 1,374 ms
コンパイル使用メモリ 133,552 KB
最終ジャッジ日時 2025-01-17 08:54:34
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample WA * 1
other WA * 54 RE * 20
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include<iostream>
#include<array>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<tuple>
#include<cassert>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 998244353;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define Per(i,sta,n) for(int i=n-1;i>=sta;i--)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef long double ld;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;
int dx[4]={1,-1,0,0};
int dy[4]={0,0,1,-1};
template<class T>bool chmax(T &a, const T &b) {if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T &a, const T &b) {if(b<a){a=b;return 1;}return 0;}
template<typename T>
struct Compress{
  vector<T> V;
  
  Compress(){
    V.clear();
  }
  Compress(vector<T> &V):V(V){}
  void add(T x){
    V.push_back(x);
  }
  int build(){
    sort(V.begin(),V.end());
    V.erase(unique(V.begin(),V.end()),V.end());
    return  V.size();
  }
  int get(T x){//get the index of the minimum element which is greater than x 
    return lower_bound(V.begin(),V.end(),x)-V.begin();
  }
  pair<int, int> section(T l,T r){//get the range of indexes of [l,r)
    int l_=get(l),r_=get(r);
    return pair<int,int>(l_,r_);
  }
  T &operator [] (int i) {return V[i];};
};
template<int mod>
struct ModInt {
    long long x;
    static constexpr int MOD = mod;
 
    ModInt() : x(0) {}
    ModInt(long long y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
    explicit operator int() const {return x;}
 
    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; }
    ModInt operator%(const ModInt &p) const { return ModInt(0); }         
 
    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;
            a -= t * b;
            swap(a, b);
            u -= t * v;
            swap(u, v);
        }
        return ModInt(u);
    }
    ModInt power(long long n) const {
        ModInt ret(1), mul(x);
        while(n > 0) {
            if(n & 1)
            ret *= mul;
            mul *= mul;
            n >>= 1;
        }
        return ret;
    }
    ModInt power(const ModInt p) const{
        return ((ModInt)x).power(p.x);
    }
    friend ostream &operator<<(ostream &os, const ModInt<mod> &p) {
        return os << p.x;
    }
    friend istream &operator>>(istream &is, ModInt<mod> &a) {
        long long x;
        is >> x;
        a = ModInt<mod>(x);
        return (is);
    }
};
using modint = ModInt<mod>;
int n,k,x,y,m=1024;
Compress<int> A;
vector<modint> Z[1024];
vector<modint> Y;
void calc(int siz,int sum,int pre){
  //cout << siz << " " << sum << " " << pre << endl;
  if(siz==n/2){
    Y[sum]+=1;
    Z[pre][sum]+=1;
    return;
  }
  rep(i,k){
    //cout << i << endl;
    if(A[i]==pre) continue;
    calc(siz+1,sum^A[i],A[i]);
  }
}
void fwt(vector<modint>& f) {
    int n = f.size();
    for(int i = 1; i < n; i <<= 1) {
        for(int j = 0; j < n; j++) {
            if((j & i) == 0) {
                modint x = f[j], y = f[j | i];
                f[j] = x + y, f[j | i] = x - y;
            }
        }
    }
}
void ifwt(vector<modint>& f) {
    int n = f.size();
    for(int i = 1; i < n; i <<= 1) {
        for(int j = 0; j < n; j++) {
            if((j & i) == 0) {
                modint x = f[j], y = f[j | i];
                f[j] = (x + y) / 2, f[j | i] = (x - y) / 2;
            }
        }
    }
}
void solve(){
  cin >> n >> k >> x >> y;
  rep(i,k){
    int a;cin >> a;
    //a=i%1024;
    A.add(a);
  }
  k=A.build();
  //cout << k << endl;
  rep(i,k){
    cout << A[i] << endl;
  }
  Y.resize(m,0);
  rep(i,m) Z[i].resize(m,0);
  calc(0,0,-1);
  //rep(i,20) cout << i << " " << Y[i] << endl;
  fwt(Y);
  rep(i,m){
    Y[i]*=Y[i];
  }
  ifwt(Y);
  //rep(i,20) cout << i << " " << S[i] << endl;
  rep(i,m) {
    fwt(Z[i]);
    rep(j,m){
      Z[i][j]*=Z[i][j];
    }
    ifwt(Z[i]);
  }
  chmin(x,m-1);chmin(y,m-1);
  modint ans=0;
  Rep(i,x,y+1){
    ans+=Y[i];
    rep(j,m){
      ans-=Z[j][i];
    }
  }
  cout << ans << endl;
}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(50);
    solve();
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0