結果
問題 | No.1304 あなたは基本が何か知っていますか?私は知っています. |
ユーザー |
![]() |
提出日時 | 2021-01-02 20:33:24 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 54 ms / 2,000 ms |
コード長 | 4,554 bytes |
コンパイル時間 | 1,692 ms |
コンパイル使用メモリ | 147,492 KB |
最終ジャッジ日時 | 2025-01-17 09:08:10 |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 45 RE * 20 TLE * 9 |
ソースコード
#pragma GCC optimize("Ofast") //#pragma GCC target ("sse4") #include<iostream> #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<bitset> #include<stack> #include<unordered_map> #include<unordered_set> #include<utility> #include<cassert> #include<complex> #include<numeric> #include<array> using namespace std; //#define int long long typedef long long ll; typedef unsigned long long ul; typedef unsigned int ui; constexpr ll mod = 998244353; const ll INF = mod * mod; 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 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++) #define all(v) (v).begin(),(v).end() typedef pair<ll, ll> LP; typedef double ld; typedef pair<ld, ld> LDP; const ld eps = 1e-12; const ld pi = acosl(-1.0); ll mod_pow(ll x, ll n, ll m = mod) { if (n < 0) { ll res = mod_pow(x, -n, m); return mod_pow(res, m - 2, m); } if (abs(x) >= m)x %= m; if (x < 0)x += m; ll res = 1; while (n) { if (n & 1)res = res * x % m; x = x * x % m; n >>= 1; } return res; } struct modint { ll n; modint() :n(0) { ; } modint(ll m) :n(m) { if (n >= mod)n %= mod; else if (n < 0)n = (n % mod + mod) % mod; } operator int() { return n; } }; bool operator==(modint a, modint b) { return a.n == b.n; } modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; } modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; } modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; } modint operator+(modint a, modint b) { return a += b; } modint operator-(modint a, modint b) { return a -= b; } modint operator*(modint a, modint b) { return a *= b; } modint operator^(modint a, ll n) { if (n == 0)return modint(1); modint res = (a * a) ^ (n / 2); if (n % 2)res = res * a; return res; } ll inv(ll a, ll p) { return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p); } modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); } modint operator/=(modint& a, modint b) { a = a / b; return a; } const int max_n = 1 << 10; modint fact[max_n], factinv[max_n]; void init_f() { fact[0] = modint(1); for (int i = 0; i < max_n - 1; i++) { fact[i + 1] = fact[i] * modint(i + 1); } factinv[max_n - 1] = modint(1) / fact[max_n - 1]; for (int i = max_n - 2; i >= 0; i--) { factinv[i] = factinv[i + 1] * modint(i + 1); } } modint comb(int a, int b) { if (a < 0 || b < 0 || a < b)return 0; return fact[a] * factinv[b] * factinv[a - b]; } modint combP(int a, int b) { if (a < 0 || b < 0 || a < b)return 0; return fact[a] * factinv[a - b]; } bool exi[1024]; modint dp[1024][1024]; modint cop[1024][1024]; void solve() { int n, k, x, y; cin >> n >> k >> x >> y; y = min(y, 1023); vector<int> a(k); rep(i, k)cin >> a[i]; rep(i, k)exi[a[i]] = true; vector<int> nex; rep(j, 1024)if (exi[j])nex.push_back(j); if (n <= 12) { dp[0][0] = 1; rep(i, n) { rep(j, 1024) { if (dp[i][j] == (modint)0)continue; for (int to : nex) { dp[i + 1][j ^ to] += dp[i][j]; } } } modint ans = 0; rep(i, (1 << n - 1)) { int cnt = 0; int tmp = 1; modint pro = 1; int loc = 0; rep(j, n - 1) { if (i & (1 << j)) { loc ^= 1; tmp ^= 1; } else { if (tmp == 1)cnt++; else { pro *= nex.size(); } tmp = 1; } } if (tmp)cnt++; else pro *= nex.size(); //cout << i << " " << cnt << "\n"; modint num = 0; Rep1(j, x, y)num += dp[cnt][j]; //cout << i << " " << pro << "\n"; num *=pro; if (loc==0)ans += num; else ans -= num; } cout << ans << "\n"; } else { rep(i, 1024)if (exi[i]) { dp[i][i] += 1; } rep(i, n - 1) { rep(j, 1024)rep(k, 1024)cop[j][k] = 0; rep(j, 1024)rep(k, 1024) { if (dp[j][k] != (modint)0) { for (int to : nex) { if (j != to) { cop[to][k ^ to] += dp[j][k]; } } } } rep(j, 1024)rep(k, 1024)dp[j][k] = cop[j][k]; } modint ans = 0; rep(j, 1024)Rep1(k, x, y)ans += dp[j][k]; cout << ans << "\n"; } } signed main() { ios::sync_with_stdio(false); cin.tie(0); //cout << fixed << setprecision(15); init_f(); //init(); //expr(); //int t; cin >> t; rep(i, t) solve(); return 0; }