結果
問題 | No.1304 あなたは基本が何か知っていますか?私は知っています. |
ユーザー |
|
提出日時 | 2020-12-02 13:24:24 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 734 ms / 2,000 ms |
コード長 | 3,874 bytes |
コンパイル時間 | 2,959 ms |
コンパイル使用メモリ | 205,488 KB |
最終ジャッジ日時 | 2025-01-16 13:09:48 |
ジャッジサーバーID (参考情報) |
judge5 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 44 WA * 9 RE * 21 |
ソースコード
#include <bits/stdc++.h>using namespace std;#define rep(i, n) for(int i = 0; i < n; i++)#define rep2(i, x, n) for(int i = x; i <= n; i++)#define rep3(i, x, n) for(int i = x; i >= n; i--)#define each(e, v) for(auto &e: v)#define pb push_back#define eb emplace_back#define all(x) x.begin(), x.end()#define rall(x) x.rbegin(), x.rend()#define sz(x) (int)x.size()using ll = long long;using pii = pair<int, int>;using pil = pair<int, ll>;using pli = pair<ll, int>;using pll = pair<ll, ll>;//const int MOD = 1000000007;const int MOD = 998244353;const int inf = (1<<30)-1;const ll INF = (1LL<<60)-1;template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};struct io_setup{io_setup(){ios_base::sync_with_stdio(false);cin.tie(NULL);cout << fixed << setprecision(15);}} io_setup;template<int mod>struct Mod_Int{int x;Mod_Int() : x(0) {}Mod_Int(ll y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}Mod_Int &operator += (const Mod_Int &p){if((x += p.x) >= mod) x -= mod;return *this;}Mod_Int &operator -= (const Mod_Int &p){if((x += mod-p.x) >= mod) x -= mod;return *this;}Mod_Int &operator *= (const Mod_Int &p){x = (int)(1LL*x*p.x%mod);return *this;}Mod_Int &operator /= (const Mod_Int &p){*this *= p.inverse();return *this;}Mod_Int &operator ++ () {return *this += Mod_Int(1);}Mod_Int operator ++ (int){Mod_Int tmp = *this;++*this;return tmp;}Mod_Int &operator -- () {return *this -= Mod_Int(1);}Mod_Int operator -- (int){Mod_Int tmp = *this;--*this;return tmp;}Mod_Int operator - () const {return Mod_Int(-x);}Mod_Int operator + (const Mod_Int &p) const {return Mod_Int(*this) += p;}Mod_Int operator - (const Mod_Int &p) const {return Mod_Int(*this) -= p;}Mod_Int operator * (const Mod_Int &p) const {return Mod_Int(*this) *= p;}Mod_Int operator / (const Mod_Int &p) const {return Mod_Int(*this) /= p;}bool operator == (const Mod_Int &p) const {return x == p.x;}bool operator != (const Mod_Int &p) const {return x != p.x;}Mod_Int inverse() const {assert(*this != Mod_Int(0));return pow(mod-2);}Mod_Int pow(ll k) const{Mod_Int now = *this, ret = 1;while(k){if(k&1) ret *= now;now *= now, k >>= 1;}return ret;}friend ostream &operator << (ostream &os, const Mod_Int &p){return os << p.x;}friend istream &operator >> (istream &is, Mod_Int &p){ll a;is >> a;p = Mod_Int<mod>(a);return is;}};using mint = Mod_Int<MOD>;vector<vector<mint>> dp(1024, vector<mint>(1024, 0));vector<int> A;void dfs(int k, int pre, int now){if(k == 0) {dp[pre][now]++; return;}each(e, A){if(e != pre) dfs(k-1, e, now^e);}}int main(){int N, K, L, R;cin >> N >> K >> L >> R;A.resize(K);rep(i, K) cin >> A[i];sort(all(A));A.erase(unique(all(A)), end(A));int n = N/2;dfs(n, -1, 0);vector<mint> s(1024, 0);rep(i, 1024){rep(j, 1024) s[j] += dp[i][j];}mint ans = 0;rep(i, 1024){rep(j, 1024){if(L <= (i^j) && (i^j) <= R) ans += s[i]*s[j];}}rep(i, 1024){rep(j, 1024){mint tmp = 0;rep(k, j){if(L <= (j^k) && (j^k) <= R) tmp += dp[i][k];}tmp *= 2;if(L == 0) tmp += dp[i][j];ans -= tmp*dp[i][j];}}cout << ans << '\n';}