結果
| 問題 | No.1304 あなたは基本が何か知っていますか？私は知っています． |
| ユーザー |
👑  emthrm
|
| 提出日時 | 2020-12-01 01:57:43 |
| 言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
TLE
(最新)
AC
(最初)
|
| 実行時間 | - |
| コード長 | 4,763 bytes |
| コンパイル時間 | 2,313 ms |
| コンパイル使用メモリ | 212,468 KB |
| 実行使用メモリ | 18,592 KB |
| 最終ジャッジ日時 | 2024-06-12 08:10:09 |
| 合計ジャッジ時間 | 6,068 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge4 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 13 ms
18,592 KB |
| testcase_01 | AC | 38 ms
11,548 KB |
| testcase_02 | AC | 10 ms
11,392 KB |
| testcase_03 | AC | 176 ms
11,428 KB |
| testcase_04 | TLE | - |
| testcase_05 | -- | - |
| testcase_06 | -- | - |
| testcase_07 | -- | - |
| testcase_08 | -- | - |
| testcase_09 | -- | - |
| testcase_10 | -- | - |
| testcase_11 | -- | - |
| testcase_12 | -- | - |
| testcase_13 | -- | - |
| testcase_14 | -- | - |
| testcase_15 | -- | - |
| testcase_16 | -- | - |
| testcase_17 | -- | - |
| testcase_18 | -- | - |
| testcase_19 | -- | - |
| testcase_20 | -- | - |
| testcase_21 | -- | - |
| testcase_22 | -- | - |
| testcase_23 | -- | - |
| testcase_24 | -- | - |
| testcase_25 | -- | - |
| testcase_26 | -- | - |
| testcase_27 | -- | - |
| testcase_28 | -- | - |
| testcase_29 | -- | - |
| testcase_30 | -- | - |
| testcase_31 | -- | - |
| testcase_32 | -- | - |
| testcase_33 | -- | - |
| testcase_34 | -- | - |
| testcase_35 | -- | - |
| testcase_36 | -- | - |
| testcase_37 | -- | - |
| testcase_38 | -- | - |
| testcase_39 | -- | - |
| testcase_40 | -- | - |
| testcase_41 | -- | - |
| testcase_42 | -- | - |
| testcase_43 | -- | - |
| testcase_44 | -- | - |
| 04_evil_A_01 | -- | - |
| 04_evil_A_02 | -- | - |
| 04_evil_A_03 | -- | - |
| 04_evil_A_04 | -- | - |
| 04_evil_A_05 | -- | - |
| 04_evil_A_06 | -- | - |
| 04_evil_A_07 | -- | - |
| 04_evil_A_08 | -- | - |
| 04_evil_A_09 | -- | - |
| 04_evil_A_10 | -- | - |
| 05_evil_B_01 | -- | - |
| 05_evil_B_02 | -- | - |
| 05_evil_B_03 | -- | - |
| 05_evil_B_04 | -- | - |
| 05_evil_B_05 | -- | - |
| 05_evil_B_06 | -- | - |
| 05_evil_B_07 | -- | - |
| 05_evil_B_08 | -- | - |
| 05_evil_B_09 | -- | - |
| 05_evil_B_10 | -- | - |
| 06_evil_C_01 | -- | - |
| 06_evil_C_02 | -- | - |
| 06_evil_C_03 | -- | - |
| 06_evil_C_04 | -- | - |
| 06_evil_C_05 | -- | - |
| 06_evil_C_06 | -- | - |
| 06_evil_C_07 | -- | - |
| 06_evil_C_08 | -- | - |
| 06_evil_C_09 | -- | - |
| 06_evil_C_10 | -- | - |
ソースコード
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
constexpr int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
constexpr int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
IOSetup() {
std::cin.tie(nullptr);
std::ios_base::sync_with_stdio(false);
std::cout << fixed << setprecision(20);
}
} iosetup;
template <int MOD>
struct MInt {
unsigned val;
MInt(): val(0) {}
MInt(long long x) : val(x >= 0 ? x % MOD : x % MOD + MOD) {}
static int get_mod() { return MOD; }
static void set_mod(int divisor) { assert(divisor == MOD); }
MInt pow(long long exponent) const {
MInt tmp = *this, res = 1;
while (exponent > 0) {
if (exponent & 1) res *= tmp;
tmp *= tmp;
exponent >>= 1;
}
return res;
}
MInt &operator+=(const MInt &x) { if((val += x.val) >= MOD) val -= MOD; return *this; }
MInt &operator-=(const MInt &x) { if((val += MOD - x.val) >= MOD) val -= MOD; return *this; }
MInt &operator*=(const MInt &x) { val = static_cast<unsigned long long>(val) * x.val % MOD; return *this; }
MInt &operator/=(const MInt &x) {
// assert(std::__gcd(static_cast<int>(x.val), MOD) == 1);
unsigned a = x.val, b = MOD; int u = 1, v = 0;
while (b) {
unsigned tmp = a / b;
std::swap(a -= tmp * b, b);
std::swap(u -= tmp * v, v);
}
return *this *= u;
}
bool operator==(const MInt &x) const { return val == x.val; }
bool operator!=(const MInt &x) const { return val != x.val; }
bool operator<(const MInt &x) const { return val < x.val; }
bool operator<=(const MInt &x) const { return val <= x.val; }
bool operator>(const MInt &x) const { return val > x.val; }
bool operator>=(const MInt &x) const { return val >= x.val; }
MInt &operator++() { if (++val == MOD) val = 0; return *this; }
MInt operator++(int) { MInt res = *this; ++*this; return res; }
MInt &operator--() { val = (val == 0 ? MOD : val) - 1; return *this; }
MInt operator--(int) { MInt res = *this; --*this; return res; }
MInt operator+() const { return *this; }
MInt operator-() const { return MInt(val ? MOD - val : 0); }
MInt operator+(const MInt &x) const { return MInt(*this) += x; }
MInt operator-(const MInt &x) const { return MInt(*this) -= x; }
MInt operator*(const MInt &x) const { return MInt(*this) *= x; }
MInt operator/(const MInt &x) const { return MInt(*this) /= x; }
friend std::ostream &operator<<(std::ostream &os, const MInt &x) { return os << x.val; }
friend std::istream &operator>>(std::istream &is, MInt &x) { long long val; is >> val; x = MInt(val); return is; }
};
namespace std { template <int MOD> MInt<MOD> abs(const MInt<MOD> &x) { return x; } }
template <int MOD>
struct Combinatorics {
using ModInt = MInt<MOD>;
int val; // "val!" and "mod" must be disjoint.
std::vector<ModInt> fact, fact_inv, inv;
Combinatorics(int val = 10000000) : val(val), fact(val + 1), fact_inv(val + 1), inv(val + 1) {
fact[0] = 1;
for (int i = 1; i <= val; ++i) fact[i] = fact[i - 1] * i;
fact_inv[val] = ModInt(1) / fact[val];
for (int i = val; i > 0; --i) fact_inv[i - 1] = fact_inv[i] * i;
for (int i = 1; i <= val; ++i) inv[i] = fact[i - 1] * fact_inv[i];
}
ModInt nCk(int n, int k) const {
if (n < 0 || n < k || k < 0) return 0;
assert(n <= val && k <= val);
return fact[n] * fact_inv[k] * fact_inv[n - k];
}
ModInt nPk(int n, int k) const {
if (n < 0 || n < k || k < 0) return 0;
assert(n <= val);
return fact[n] * fact_inv[n - k];
}
ModInt nHk(int n, int k) const {
if (n < 0 || k < 0) return 0;
return k == 0 ? 1 : nCk(n + k - 1, k);
}
};
using ModInt = MInt<MOD>;
int main() {
constexpr int X = 1024;
int n, k, x, y; cin >> n >> k >> x >> y;
vector<int> a(k); REP(i, k) cin >> a[i];
sort(ALL(a));
a.erase(unique(ALL(a)), a.end());
k = a.size();
vector dp(X, vector(X, ModInt(0)));
REP(i, k) dp[a[i]][a[i]] = 1;
FOR(_, 1, n) {
vector nx(X, vector(X, ModInt(0)));
REP(i, X) REP(j, X) {
REP(l, k) {
if (a[l] != i) nx[a[l]][j ^ a[l]] += dp[i][j];
}
}
dp.swap(nx);
}
ModInt ans = 0;
REP(i, X) for (int j = x; j <= y && j < X; ++j) ans += dp[i][j];
cout << ans << '\n';
return 0;
}