結果

問題 No.1304 あなたは基本が何か知っていますか？私は知っています．
ユーザー heno239heno239
提出日時 2020-12-31 03:43:04
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 62 ms / 2,000 ms
コード長 3,786 bytes
コンパイル時間 1,622 ms
コンパイル使用メモリ 142,556 KB
実行使用メモリ 39,592 KB
最終ジャッジ日時 2024-06-12 16:35:14
合計ジャッジ時間 35,023 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 9 ms
26,740 KB
testcase_01 AC 14 ms
39,328 KB
testcase_02 AC 11 ms
26,868 KB
testcase_03 AC 54 ms
39,468 KB
testcase_04 AC 15 ms
26,868 KB
testcase_05 AC 12 ms
39,592 KB
testcase_06 AC 12 ms
26,740 KB
testcase_07 AC 15 ms
39,344 KB
testcase_08 AC 20 ms
26,864 KB
testcase_09 AC 14 ms
39,340 KB
testcase_10 AC 12 ms
26,876 KB
testcase_11 AC 14 ms
39,460 KB
testcase_12 AC 13 ms
26,740 KB
testcase_13 AC 13 ms
39,336 KB
testcase_14 AC 14 ms
26,996 KB
testcase_15 AC 11 ms
26,744 KB
testcase_16 AC 13 ms
39,336 KB
testcase_17 AC 18 ms
19,796 KB
testcase_18 AC 13 ms
19,800 KB
testcase_19 AC 12 ms
19,792 KB
testcase_20 AC 11 ms
19,664 KB
testcase_21 AC 62 ms
19,796 KB
testcase_22 AC 14 ms
19,792 KB
testcase_23 AC 14 ms
19,800 KB
testcase_24 AC 15 ms
19,796 KB
testcase_25 AC 26 ms
19,800 KB
testcase_26 AC 18 ms
19,796 KB
testcase_27 AC 22 ms
19,800 KB
testcase_28 AC 20 ms
19,924 KB
testcase_29 AC 19 ms
19,924 KB
testcase_30 AC 23 ms
19,800 KB
testcase_31 AC 33 ms
19,796 KB
testcase_32 AC 23 ms
19,796 KB
testcase_33 AC 25 ms
19,796 KB
testcase_34 AC 22 ms
19,668 KB
testcase_35 AC 23 ms
19,796 KB
testcase_36 AC 30 ms
19,796 KB
testcase_37 AC 25 ms
19,924 KB
testcase_38 AC 25 ms
19,668 KB
testcase_39 AC 36 ms
19,796 KB
testcase_40 AC 26 ms
19,796 KB
testcase_41 AC 37 ms
19,796 KB
testcase_42 AC 24 ms
19,792 KB
testcase_43 AC 26 ms
19,796 KB
testcase_44 AC 30 ms
19,920 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 TLE -
06_evil_C_02 TLE -
06_evil_C_03 TLE -
06_evil_C_04 TLE -
06_evil_C_05 TLE -
06_evil_C_06 TLE -
06_evil_C_07 TLE -
06_evil_C_08 TLE -
06_evil_C_09 TLE -
06_evil_C_10 AC 9 ms
26,744 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#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;
	vector<int> a(k);
	rep(i, k)cin >> a[i];
	rep(i, k)exi[a[i]] = true;
	rep(i, 1024)if(exi[i]) {
		dp[i][i] += 1;
	}
	vector<int> nex;
	rep(j, 1024)if (exi[j])nex.push_back(j);
	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;
	y = min(y, 1023);
	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;
}
0