結果

問題 No.1304 あなたは基本が何か知っていますか？私は知っています．
ユーザー chocopuuchocopuu
提出日時 2020-12-01 03:32:09
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 299 ms / 2,000 ms
コード長 4,203 bytes
コンパイル時間 6,465 ms
コンパイル使用メモリ 211,024 KB
実行使用メモリ 19,712 KB
最終ジャッジ日時 2023-09-03 03:15:45
合計ジャッジ時間 14,137 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 27 ms
19,464 KB
testcase_01 AC 48 ms
19,420 KB
testcase_02 AC 30 ms
19,508 KB
testcase_03 AC 299 ms
19,384 KB
testcase_04 AC 46 ms
19,388 KB
testcase_05 AC 40 ms
19,456 KB
testcase_06 AC 29 ms
19,384 KB
testcase_07 AC 44 ms
19,468 KB
testcase_08 AC 78 ms
19,432 KB
testcase_09 AC 45 ms
19,372 KB
testcase_10 AC 41 ms
19,464 KB
testcase_11 AC 42 ms
19,528 KB
testcase_12 AC 44 ms
19,472 KB
testcase_13 AC 38 ms
19,440 KB
testcase_14 AC 42 ms
19,572 KB
testcase_15 AC 40 ms
19,712 KB
testcase_16 AC 42 ms
19,516 KB
testcase_17 AC 59 ms
19,376 KB
testcase_18 AC 41 ms
19,468 KB
testcase_19 AC 39 ms
19,508 KB
testcase_20 AC 34 ms
19,460 KB
testcase_21 AC 62 ms
19,432 KB
testcase_22 AC 43 ms
19,448 KB
testcase_23 AC 44 ms
19,468 KB
testcase_24 AC 43 ms
19,376 KB
testcase_25 AC 128 ms
19,424 KB
testcase_26 AC 81 ms
19,388 KB
testcase_27 AC 82 ms
19,704 KB
testcase_28 AC 93 ms
19,500 KB
testcase_29 AC 79 ms
19,448 KB
testcase_30 AC 102 ms
19,704 KB
testcase_31 AC 164 ms
19,456 KB
testcase_32 AC 83 ms
19,552 KB
testcase_33 AC 125 ms
19,380 KB
testcase_34 AC 85 ms
19,436 KB
testcase_35 AC 113 ms
19,568 KB
testcase_36 AC 144 ms
19,568 KB
testcase_37 AC 110 ms
19,368 KB
testcase_38 AC 105 ms
19,572 KB
testcase_39 AC 182 ms
19,552 KB
testcase_40 AC 114 ms
19,372 KB
testcase_41 AC 182 ms
19,384 KB
testcase_42 AC 111 ms
19,424 KB
testcase_43 AC 111 ms
19,380 KB
testcase_44 AC 150 ms
19,460 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 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 18 ms
19,392 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include "bits/stdc++.h"
using namespace std;
//#include "atcoder/all"
//using namespace atcoder;
#define int long long
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define RREP(i, n) for (int i = (int)n - 1; i >= 0; --i)
#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)
#define RFOR(i, s, n) for (int i = (int)n - 1; i >= s; --i)
#define ALL(a) a.begin(), a.end()
#define IN(a, x, b) (a <= x && x < b)
template<class T>istream&operator >>(istream&is,vector<T>&vec){for(T&x:vec)is>>x;return is;}
template<class T>inline void out(T t){cout << t << "\n";}
template<class T,class... Ts>inline void out(T t,Ts... ts){cout << t << " ";out(ts...);}
template<class T>inline bool CHMIN(T&a,T b){if(a > b){a = b;return true;}return false;}
template<class T>inline bool CHMAX(T&a,T b){if(a < b){a = b;return true;}return false;}
constexpr int INF = 1e18;

template<int MOD> struct Fp {
	long long val;
	constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
		if (val < 0) val += MOD;
	}
	constexpr int getmod() { return MOD; }
	constexpr Fp operator - () const noexcept {
		return val ? MOD - val : 0;
	}
	constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; }
	constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; }
	constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; }
	constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; }
	constexpr Fp& operator += (const Fp& r) noexcept {
		val += r.val;
		if (val >= MOD) val -= MOD;
		return *this;
	}
	constexpr Fp& operator -= (const Fp& r) noexcept {
		val -= r.val;
		if (val < 0) val += MOD;
		return *this;
	}
	constexpr Fp& operator *= (const Fp& r) noexcept {
		val = val * r.val % MOD;
		return *this;
	}
	constexpr Fp& operator /= (const Fp& r) noexcept {
		long long a = r.val, b = MOD, u = 1, v = 0;
		while (b) {
			long long t = a / b;
			a -= t * b; swap(a, b);
			u -= t * v; swap(u, v);
		}
		val = val * u % MOD;
		if (val < 0) val += MOD;
		return *this;
	}
	constexpr bool operator == (const Fp& r) const noexcept {
		return this->val == r.val;
	}
	constexpr bool operator != (const Fp& r) const noexcept {
		return this->val != r.val;
	}
	friend constexpr ostream& operator << (ostream &os, const Fp<MOD>& x) noexcept {
		return os << x.val;
	}
	friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {
		if (n == 0) return 1;
		auto t = modpow(a, n / 2);
		t = t * t;
		if (n & 1) t = t * a;
		return t;
	}
};
 

template<class T> struct BiCoef {
	vector<T> fact_, inv_, finv_;
	constexpr BiCoef() {}
	constexpr BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) {
		init(n);
	}
	constexpr void init(int n) noexcept {
		fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1);
		int MOD = fact_[0].getmod();
		for(int i = 2; i < n; i++){
			fact_[i] = fact_[i-1] * i;
			inv_[i] = -inv_[MOD%i] * (MOD/i);
			finv_[i] = finv_[i-1] * inv_[i];
		}
	}
	constexpr T com(int n, int k) const noexcept {
		if (n < k || n < 0 || k < 0) return 0;
		return fact_[n] * finv_[k] * finv_[n-k];
	}
	constexpr T P(int n, int k) const noexcept {
		if (n < k || n < 0 || k < 0) return 0;
		return fact_[n] * finv_[n-k];
	}
	constexpr T fact(int n) const noexcept {
		if (n < 0) return 0;
		return fact_[n];
	}
	constexpr T inv(int n) const noexcept {
		if (n < 0) return 0;
		return inv_[n];
	}
	constexpr T finv(int n) const noexcept {
		if (n < 0) return 0;
		return finv_[n];
	}
};
 
// const int MOD = 1000000007;
const int MOD = 998244353;
using mint = Fp<MOD>;
BiCoef<mint> bc;
// bc.init(500050);

vector<vector<mint>> dp(1024, vector<mint> (1025));

signed main(){
	int N, K, X, Y;
	cin >> N >> K >> X >> Y;
	vector<int>ok(1025);
	ok[1024] = 1;
	vector<int> a(K);
	cin >> a;
	REP(i, K) ok[a[i]] = 1;
	dp[0][1024] = 1;
	REP(i, N) {
		vector<mint> dp2(1024);
		vector<vector<mint>> ndp(1024, vector<mint> (1025));
		REP(j, 1024) {
			REP(k, 1025) {
				if(ok[k]) {
					dp2[j] += dp[j][k];
				}
			}
		}
		REP(j, 1024) {
			REP(k, 1024) {
				if(ok[k]) {
					ndp[j][k] += dp2[j ^ k] - dp[j ^ k][k];
				}
			}
		}
		dp = ndp;
	}
	mint ans = 0;
	FOR(j, X, Y + 1) REP(k, 1024) if(ok[k]) ans += dp[j][k];
	out(ans);
}
0