#587502 (C++17) No.1304 あなたは基本が何か知っていますか？私は知っています．

提出ソース

結果

問題	No.1304 あなたは基本が何か知っていますか？私は知っています．
ユーザー	tkmst201
提出日時	2020-12-01 09:41:40
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	4,545 bytes
コンパイル時間	2,749 ms
コンパイル使用メモリ	214,092 KB
実行使用メモリ	11,904 KB
最終ジャッジ日時	2024-06-12 09:46:02
合計ジャッジ時間	8,709 ms
ジャッジサーバーID （参考情報）	judge2 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,812 KB
testcase_01	AC	2 ms 6,944 KB
testcase_02	AC	2 ms 6,940 KB
testcase_03	AC	2 ms 6,944 KB
testcase_04	AC	17 ms 11,904 KB
testcase_05	AC	9 ms 7,296 KB
testcase_06	AC	2 ms 6,940 KB
testcase_07	AC	14 ms 10,496 KB
testcase_08	WA	-
testcase_09	AC	13 ms 9,728 KB
testcase_10	AC	9 ms 8,448 KB
testcase_11	AC	12 ms 10,112 KB
testcase_12	AC	10 ms 8,576 KB
testcase_13	AC	7 ms 7,040 KB
testcase_14	AC	10 ms 8,064 KB
testcase_15	AC	9 ms 7,680 KB
testcase_16	AC	11 ms 8,576 KB
testcase_17	AC	3 ms 6,940 KB
testcase_18	AC	10 ms 8,192 KB
testcase_19	AC	6 ms 6,944 KB
testcase_20	AC	2 ms 6,940 KB
testcase_21	WA	-
testcase_22	AC	11 ms 8,960 KB
testcase_23	AC	13 ms 10,112 KB
testcase_24	AC	15 ms 11,776 KB
testcase_25	AC	2 ms 6,940 KB
testcase_26	WA	-
testcase_27	WA	-
testcase_28	WA	-
testcase_29	WA	-
testcase_30	AC	2 ms 6,944 KB
testcase_31	AC	2 ms 6,944 KB
testcase_32	WA	-
testcase_33	AC	2 ms 6,940 KB
testcase_34	WA	-
testcase_35	AC	2 ms 6,944 KB
testcase_36	AC	2 ms 6,940 KB
testcase_37	AC	2 ms 6,944 KB
testcase_38	AC	2 ms 6,944 KB
testcase_39	AC	2 ms 6,940 KB
testcase_40	AC	2 ms 6,940 KB
testcase_41	AC	2 ms 6,940 KB
testcase_42	AC	2 ms 6,940 KB
testcase_43	AC	2 ms 6,940 KB
testcase_44	AC	2 ms 6,940 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	WA	-
04_evil_A_07	WA	-
04_evil_A_08	WA	-
04_evil_A_09	WA	-
04_evil_A_10	WA	-
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	2 ms 6,944 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 998244353;
constexpr bool debug = false;
//---------------------------------//

template<int M>
struct ModInt {
	static_assert(M > 0);
	
public:
	using value_type = int;
	using calc_type = std::int_fast64_t;
	
private:
	value_type val_;
	
public:
	constexpr ModInt(calc_type val = 0) : val_(val < 0 ? (val % M + M) % M : val % M) {}
	constexpr const value_type & val() const noexcept { return val_; }
	constexpr static decltype(M) mod() noexcept { return M; }
	
	explicit constexpr operator bool() const noexcept { return val_; }
	constexpr bool operator !() const noexcept { return !static_cast<bool>(*this); }
	constexpr ModInt operator +() const noexcept { return ModInt(*this); }
	constexpr ModInt operator -() const noexcept { return ModInt(-val_); }
	constexpr ModInt operator ++(int) noexcept { ModInt res = *this; ++*this; return res; }
	constexpr ModInt operator --(int) noexcept { ModInt res = *this; --*this; return res; }
	constexpr ModInt & operator ++() noexcept { val_ = val_ + 1 == M ? 0 : val_ + 1; return *this; }
	constexpr ModInt & operator --() noexcept { val_ = val_ == 0 ? M - 1 : val_ - 1; return *this; }
	constexpr ModInt & operator +=(const ModInt & rhs) noexcept { val_ += val_ < M - rhs.val_ ? rhs.val_ : rhs.val_ - M; return *this; }
	constexpr ModInt & operator -=(const ModInt & rhs) noexcept { val_ += val_ >= rhs.val_ ? -rhs.val_ : M - rhs.val_; return *this; }
	constexpr ModInt & operator *=(const ModInt & rhs) noexcept { val_ = static_cast<calc_type>(val_) * rhs.val_ % M; return *this; }
	constexpr ModInt & operator /=(const ModInt & rhs) noexcept { return *this *= rhs.inv(); }
	friend constexpr ModInt operator +(const ModInt & lhs, const ModInt & rhs) noexcept { return ModInt(lhs) += rhs; }
	friend constexpr ModInt operator -(const ModInt & lhs, const ModInt & rhs) noexcept { return ModInt(lhs) -= rhs; }
	friend constexpr ModInt operator *(const ModInt & lhs, const ModInt & rhs) noexcept { return ModInt(lhs) *= rhs; }
	friend constexpr ModInt operator /(const ModInt & lhs, const ModInt & rhs) noexcept { return ModInt(lhs) /= rhs; }
	friend constexpr bool operator ==(const ModInt & lhs, const ModInt & rhs) noexcept { return lhs.val_ == rhs.val_; }
	friend constexpr bool operator !=(const ModInt & lhs, const ModInt & rhs) noexcept { return !(lhs == rhs); }
	friend std::ostream & operator <<(std::ostream & os, const ModInt & rhs) { return os << rhs.val_; }
	friend std::istream & operator >>(std::istream & is, ModInt & rhs) { calc_type x; is >> x; rhs = ModInt(x); return is; }
	
	constexpr ModInt pow(calc_type n) const noexcept {
		ModInt res = 1, x = val_;
		if (n < 0) { x = x.inv(); n = -n; }
		while (n) { if (n & 1) res *= x; x *= x; n >>= 1; }
		return res;
	}
	
	constexpr ModInt inv() const noexcept {
		value_type a = val_, a1 = 1, a2 = 0, b = M, b1 = 0, b2 = 1;
		while (b > 0) {
			value_type q = a / b, r = a % b;
			value_type nb1 = a1 - q * b1, nb2 = a2 - q * b2;
			a = b; b = r;
			a1 = b1; b1 = nb1;
			a2 = b2; b2 = nb2;
		}
		assert(a == 1);
		return a1;
	}
};
using mint = ModInt<MOD>;

int main() {
	int N, K, X, Y;
	cin >> N >> K >> X >> Y;
	constexpr int MAXA = (1 << 10) - 1;
	vector<bool> done(MAXA + 1);
	REP(i, K) {
		int A;
		scanf("%d", &A);
		done[A] = true;
	}
	vector<int> A;
	REP(i, MAXA + 1) if (done[i]) A.emplace_back(i);
	K = A.size();
	
	chmin(X, MAXA);
	chmin(Y, MAXA);
	
	// [j][k] := i 個構築し、最後が j であるようなときの数 全体の xor が k
	// i について配列の再利用
	vector dp(vector(K, vector(MAXA + 1, mint(0))));
	auto nextdp = dp;
	vector sum(MAXA + 1, mint(0)); // [k] := \Sum dp[*][k]
	
	dp[0][0] = 1;
	REP(i, N) {
		nextdp.assign(K, vector(MAXA + 1, mint(0)));
		sum.assign(MAXA, 0);
		REP(j, K) REP(k, MAXA + 1) sum[k] += dp[j][k];
		
		REP(j, K) REP(k, MAXA + 1) {
			if (i > 0) nextdp[j][k] = sum[A[j] ^ k] - dp[j][A[j] ^ k];
			else nextdp[j][k] = sum[A[j] ^ k];
		}
		swap(dp, nextdp);
	}
	
	mint ans = 0;
	REP(j, K) FOR(k, X, Y + 1) ans += dp[j][k];
	cout << ans << endl;
}

yukicoder

結果

テストケース

ソースコード