結果

問題 No.1304 あなたは基本が何か知っていますか?私は知っています.
ユーザー ei1333333ei1333333
提出日時 2020-12-01 13:58:21
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 137 ms / 2,000 ms
コード長 5,337 bytes
コンパイル時間 2,128 ms
コンパイル使用メモリ 204,840 KB
実行使用メモリ 22,936 KB
最終ジャッジ日時 2023-09-03 03:27:51
合計ジャッジ時間 36,294 ms
ジャッジサーバーID
(参考情報)
judge11 / judge13
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 14 ms
18,268 KB
testcase_01 AC 23 ms
22,936 KB
testcase_02 AC 15 ms
18,480 KB
testcase_03 AC 137 ms
15,872 KB
testcase_04 AC 24 ms
18,280 KB
testcase_05 AC 22 ms
22,848 KB
testcase_06 AC 17 ms
15,672 KB
testcase_07 AC 24 ms
22,888 KB
testcase_08 AC 38 ms
18,576 KB
testcase_09 AC 24 ms
18,480 KB
testcase_10 AC 22 ms
18,336 KB
testcase_11 AC 24 ms
22,644 KB
testcase_12 AC 23 ms
18,264 KB
testcase_13 AC 22 ms
18,576 KB
testcase_14 AC 23 ms
22,764 KB
testcase_15 AC 22 ms
15,656 KB
testcase_16 AC 23 ms
15,824 KB
testcase_17 AC 31 ms
11,464 KB
testcase_18 AC 23 ms
11,220 KB
testcase_19 AC 21 ms
11,176 KB
testcase_20 AC 18 ms
11,224 KB
testcase_21 AC 35 ms
11,464 KB
testcase_22 AC 24 ms
11,180 KB
testcase_23 AC 24 ms
11,180 KB
testcase_24 AC 24 ms
11,224 KB
testcase_25 AC 63 ms
11,340 KB
testcase_26 AC 39 ms
11,344 KB
testcase_27 AC 42 ms
11,400 KB
testcase_28 AC 47 ms
11,340 KB
testcase_29 AC 39 ms
11,400 KB
testcase_30 AC 50 ms
11,348 KB
testcase_31 AC 76 ms
11,340 KB
testcase_32 AC 43 ms
11,476 KB
testcase_33 AC 60 ms
11,420 KB
testcase_34 AC 41 ms
11,468 KB
testcase_35 AC 54 ms
11,472 KB
testcase_36 AC 69 ms
11,336 KB
testcase_37 AC 54 ms
11,476 KB
testcase_38 AC 49 ms
11,408 KB
testcase_39 AC 83 ms
11,416 KB
testcase_40 AC 55 ms
11,404 KB
testcase_41 AC 84 ms
11,392 KB
testcase_42 AC 53 ms
11,412 KB
testcase_43 AC 54 ms
11,416 KB
testcase_44 AC 70 ms
11,488 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 11 ms
18,396 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#include <bits/stdc++.h>

using namespace std;

using int64 = long long;
//const int mod = 1e9 + 7;
const int mod = 998244353;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;


template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 > &p) {
  os << p.first << " " << p.second;
  return os;
}

template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
  is >> p.first >> p.second;
  return is;
}

template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
  for(int i = 0; i < (int) v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
  for(T &in : v) is >> in;
  return is;
}

template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

template< typename T = int64 >
vector< T > make_v(size_t a) {
  return vector< T >(a);
}

template< typename T, typename... Ts >
auto make_v(size_t a, Ts... ts) {
  return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));
}

template< typename T, typename V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
  t = v;
}

template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
  for(auto &e : t) fill_v(e, v);
}

template< typename F >
struct FixPoint : F {
  FixPoint(F &&f) : F(forward< F >(f)) {}

  template< typename... Args >
  decltype(auto) operator()(Args &&... args) const {
    return F::operator()(*this, forward< Args >(args)...);
  }
};

template< typename F >
inline decltype(auto) MFP(F &&f) {
  return FixPoint< F >{forward< F >(f)};
}

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 >;

template< typename T >
struct Combination {
  vector< T > _fact, _rfact, _inv;

  Combination(int sz) : _fact(sz + 1), _rfact(sz + 1), _inv(sz + 1) {
    _fact[0] = _rfact[sz] = _inv[0] = 1;
    for(int i = 1; i <= sz; i++) _fact[i] = _fact[i - 1] * i;
    _rfact[sz] /= _fact[sz];
    for(int i = sz - 1; i >= 0; i--) _rfact[i] = _rfact[i + 1] * (i + 1);
    for(int i = 1; i <= sz; i++) _inv[i] = _rfact[i] * _fact[i - 1];
  }

  inline T fact(int k) const { return _fact[k]; }

  inline T rfact(int k) const { return _rfact[k]; }

  inline T inv(int k) const { return _inv[k]; }

  T P(int n, int r) const {
    if(r < 0 || n < r) return 0;
    return fact(n) * rfact(n - r);
  }

  T C(int p, int q) const {
    if(q < 0 || p < q) return 0;
    return fact(p) * rfact(q) * rfact(p - q);
  }

  T H(int n, int r) const {
    if(n < 0 || r < 0) return (0);
    return r == 0 ? 1 : C(n + r - 1, r);
  }
};

int main() {
  int N, K, X, Y;
  cin >> N >> K >> X >> Y;
  vector< int > A(1024);
  for(int i = 0; i < K; i++) {
    int x;
    cin >> x;
    A[x] = true;
  }
  auto dp = make_v< modint >(1024, 1025);
  dp[0][1024] = 1;
  for(int i = 0; i < N; i++) {
    auto dp2 = make_v< modint >(1024, 1025);
    for(int j = 0; j < 1024; j++) {
      modint sum = 0;
      for(int k = 0; k < 1025; k++) {
        sum += dp[j][k];
      }
      for(int k = 0; k < 1024; k++) {
        if(A[k]) {
          dp2[j ^ k][k] += sum - dp[j][k];
        }
      }
    }
    dp = move(dp2);
  }
  modint ret = 0;
  for(int i = X; i <= min(Y, 1023); i++) {
    for(int j = 0; j < 1024; j++) {
      ret += dp[i][j];
    }
  }
  cout << ret << "\n";
}


0