結果
問題 | No.1304 あなたは基本が何か知っていますか?私は知っています. |
ユーザー | mfbgjscz |
提出日時 | 2021-02-03 00:47:10 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 83 ms / 2,000 ms |
コード長 | 1,417 bytes |
コンパイル時間 | 1,549 ms |
コンパイル使用メモリ | 174,880 KB |
実行使用メモリ | 70,876 KB |
最終ジャッジ日時 | 2023-09-03 04:12:44 |
合計ジャッジ時間 | 8,293 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 24 ms
13,464 KB |
testcase_01 | AC | 28 ms
17,420 KB |
testcase_02 | AC | 24 ms
13,384 KB |
testcase_03 | AC | 83 ms
70,876 KB |
testcase_04 | AC | 25 ms
13,280 KB |
testcase_05 | AC | 24 ms
13,564 KB |
testcase_06 | AC | 23 ms
13,352 KB |
testcase_07 | AC | 22 ms
13,344 KB |
testcase_08 | AC | 31 ms
21,728 KB |
testcase_09 | AC | 24 ms
13,388 KB |
testcase_10 | AC | 23 ms
13,324 KB |
testcase_11 | AC | 23 ms
13,296 KB |
testcase_12 | AC | 23 ms
13,380 KB |
testcase_13 | AC | 22 ms
13,436 KB |
testcase_14 | AC | 24 ms
13,348 KB |
testcase_15 | AC | 24 ms
13,348 KB |
testcase_16 | AC | 25 ms
13,396 KB |
testcase_17 | AC | 27 ms
17,416 KB |
testcase_18 | AC | 24 ms
13,416 KB |
testcase_19 | AC | 24 ms
13,336 KB |
testcase_20 | AC | 24 ms
13,340 KB |
testcase_21 | AC | 27 ms
17,420 KB |
testcase_22 | AC | 23 ms
13,284 KB |
testcase_23 | AC | 23 ms
13,292 KB |
testcase_24 | AC | 23 ms
13,288 KB |
testcase_25 | AC | 43 ms
33,884 KB |
testcase_26 | AC | 33 ms
21,560 KB |
testcase_27 | AC | 31 ms
21,456 KB |
testcase_28 | AC | 34 ms
25,820 KB |
testcase_29 | AC | 30 ms
21,508 KB |
testcase_30 | AC | 38 ms
29,872 KB |
testcase_31 | AC | 50 ms
42,032 KB |
testcase_32 | AC | 32 ms
21,596 KB |
testcase_33 | AC | 45 ms
33,916 KB |
testcase_34 | AC | 32 ms
21,564 KB |
testcase_35 | AC | 41 ms
29,724 KB |
testcase_36 | AC | 49 ms
37,944 KB |
testcase_37 | AC | 40 ms
29,648 KB |
testcase_38 | AC | 39 ms
29,656 KB |
testcase_39 | AC | 53 ms
46,076 KB |
testcase_40 | AC | 38 ms
29,652 KB |
testcase_41 | AC | 55 ms
46,080 KB |
testcase_42 | AC | 40 ms
29,808 KB |
testcase_43 | AC | 40 ms
29,756 KB |
testcase_44 | AC | 48 ms
37,968 KB |
04_evil_A_01 | AC | 82 ms
70,964 KB |
04_evil_A_02 | AC | 49 ms
37,940 KB |
04_evil_A_03 | AC | 57 ms
46,124 KB |
04_evil_A_04 | AC | 44 ms
33,924 KB |
04_evil_A_05 | AC | 48 ms
37,968 KB |
04_evil_A_06 | AC | 25 ms
13,388 KB |
04_evil_A_07 | AC | 24 ms
13,288 KB |
04_evil_A_08 | AC | 25 ms
13,388 KB |
04_evil_A_09 | AC | 23 ms
13,352 KB |
04_evil_A_10 | AC | 24 ms
13,384 KB |
05_evil_B_01 | AC | 97 ms
70,836 KB |
05_evil_B_02 | AC | 92 ms
70,920 KB |
05_evil_B_03 | AC | 97 ms
70,700 KB |
05_evil_B_04 | AC | 103 ms
70,904 KB |
05_evil_B_05 | AC | 101 ms
70,808 KB |
05_evil_B_06 | AC | 99 ms
70,768 KB |
05_evil_B_07 | AC | 95 ms
70,948 KB |
05_evil_B_08 | AC | 94 ms
70,964 KB |
05_evil_B_09 | AC | 97 ms
70,884 KB |
05_evil_B_10 | AC | 105 ms
70,808 KB |
06_evil_C_01 | RE | - |
06_evil_C_02 | RE | - |
06_evil_C_03 | RE | - |
06_evil_C_04 | RE | - |
06_evil_C_05 | RE | - |
06_evil_C_06 | RE | - |
06_evil_C_07 | RE | - |
06_evil_C_08 | RE | - |
06_evil_C_09 | RE | - |
06_evil_C_10 | AC | 23 ms
11,272 KB |
ソースコード
#include <bits/stdc++.h> #pragma GCC target("avx") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") using namespace std; #define ll long long #define rep(i, m, n) for (ll i = m; i < n; i++) #define mod 998244353 void fwt(vector<ll>& f) { int n = f.size(); for(int i = 1; i < n; i <<= 1) { for(int j = 0; j < n; j++) { if((j & i) == 0) { ll x = f[j], y = f[j | i]; f[j] = x + y, f[j | i] = x - y; } } } } void ifwt(vector<ll>& f) { int n = f.size(); for(int i = 1; i < n; i <<= 1) { for(int j = 0; j < n; j++) { if((j & i) == 0) { ll x = f[j], y = f[j | i]; f[j] = (x + y) * 499122177 % mod, f[j | i] = (x - y) * 499122177 % mod; } } } } int main(){ cin.tie(nullptr); ios::sync_with_stdio(false); ll N, K, X, Y; cin >> N >> K >> X >> Y; ll M = 262144; vector<vector<ll>> dp(N + 2, vector<ll>(M, 1)); vector<ll> H(M, 0); rep(i, 0, K) { ll A; cin >> A; H[A] = 1; } fwt(H); rep(v, 0, M) dp[1][v] = dp[0][v] * H[v]; rep(v, 0, M) dp[2][v] = dp[1][v] * H[v] - K * dp[0][v]; rep(i, 3, N + 1) rep(v, 0, M) dp[i][v] = (dp[i - 1][v] * H[v] - (K - 1) * dp[i - 2][v] + mod) % mod; ifwt(dp[N]); ll res = 0; rep(v, 0, M) if(X <= v & v <= Y) res = (res + dp[N][v]) % mod; cout << (res + mod) % mod << endl; }