結果

問題 No.2964 Obstruction Bingo
ユーザー 👑 binapbinap
提出日時 2024-11-16 17:44:11
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,718 ms / 2,468 ms
コード長 3,412 bytes
コンパイル時間 4,831 ms
コンパイル使用メモリ 272,396 KB
実行使用メモリ 52,276 KB
最終ジャッジ日時 2024-11-16 17:45:19
合計ジャッジ時間 60,457 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 43 ms
5,248 KB
testcase_03 AC 2 ms
5,248 KB
testcase_04 AC 2 ms
5,248 KB
testcase_05 AC 899 ms
35,620 KB
testcase_06 AC 910 ms
34,068 KB
testcase_07 AC 174 ms
10,624 KB
testcase_08 AC 917 ms
35,164 KB
testcase_09 AC 934 ms
35,624 KB
testcase_10 AC 1,409 ms
49,744 KB
testcase_11 AC 210 ms
11,520 KB
testcase_12 AC 1,183 ms
42,364 KB
testcase_13 AC 892 ms
33,704 KB
testcase_14 AC 1,445 ms
51,804 KB
testcase_15 AC 381 ms
16,600 KB
testcase_16 AC 304 ms
15,232 KB
testcase_17 AC 215 ms
11,904 KB
testcase_18 AC 577 ms
24,920 KB
testcase_19 AC 214 ms
11,648 KB
testcase_20 AC 1,015 ms
36,968 KB
testcase_21 AC 841 ms
31,700 KB
testcase_22 AC 108 ms
7,808 KB
testcase_23 AC 50 ms
5,376 KB
testcase_24 AC 93 ms
7,168 KB
testcase_25 AC 1,557 ms
51,848 KB
testcase_26 AC 1,558 ms
51,968 KB
testcase_27 AC 1,586 ms
51,876 KB
testcase_28 AC 1,582 ms
51,784 KB
testcase_29 AC 1,594 ms
51,872 KB
testcase_30 AC 1,582 ms
51,924 KB
testcase_31 AC 1,543 ms
51,928 KB
testcase_32 AC 1,592 ms
51,912 KB
testcase_33 AC 1,571 ms
51,828 KB
testcase_34 AC 1,582 ms
51,800 KB
testcase_35 AC 1,585 ms
51,948 KB
testcase_36 AC 1,561 ms
51,888 KB
testcase_37 AC 1,628 ms
51,700 KB
testcase_38 AC 1,537 ms
51,776 KB
testcase_39 AC 1,587 ms
51,744 KB
testcase_40 AC 1,550 ms
51,872 KB
testcase_41 AC 1,573 ms
51,840 KB
testcase_42 AC 1,621 ms
51,768 KB
testcase_43 AC 1,559 ms
51,764 KB
testcase_44 AC 1,589 ms
51,712 KB
testcase_45 AC 1,295 ms
42,736 KB
testcase_46 AC 1,470 ms
52,276 KB
testcase_47 AC 1,400 ms
40,496 KB
testcase_48 AC 1,457 ms
51,908 KB
testcase_49 AC 1,483 ms
50,620 KB
testcase_50 AC 1,538 ms
50,276 KB
testcase_51 AC 1,718 ms
50,252 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<vector<int>> vvi;
typedef vector<vector<long long>> vvl;
typedef long double ld;
typedef pair<int, int> P;

template <int m> ostream& operator<<(ostream& os, const static_modint<m>& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const dynamic_modint<m>& a) {os << a.val(); return os;}
template <int m> istream& operator>>(istream& is, static_modint<m>& a) {long long x; is >> x; a = x; return is;}
template <int m> istream& operator>>(istream& is, dynamic_modint<m>& a) {long long x; is >> x; a = x; return is;}
template<typename T> istream& operator>>(istream& is, vector<T>& v){int n = v.size(); assert(n > 0); rep(i, n) is >> v[i]; return is;}
template<typename U, typename T> ostream& operator<<(ostream& os, const pair<U, T>& p){os << p.first << ' ' << p.second; return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<T>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : " "); return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<vector<T>>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : ""); return os;}
template<typename T> ostream& operator<<(ostream& os, const set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;}
template<typename T> ostream& operator<<(ostream& os, const unordered_set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;}
template<typename S, auto op, auto e> ostream& operator<<(ostream& os, const atcoder::segtree<S, op, e>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;}
template<typename S, auto op, auto e, typename F, auto mapping, auto composition, auto id> ostream& operator<<(ostream& os, const atcoder::lazy_segtree<S, op, e, F, mapping, composition, id>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;}

template<typename T> void chmin(T& a, T b){a = min(a, b);}
template<typename T> void chmax(T& a, T b){a = max(a, b);}

using mint = modint998244353;

int main(){
	int l, k;
	cin >> l >> k;
	string s, t;
	cin >> s >> t;
	int n = (k + 1) * (k + 1);
	vector<int> a(26);
	cin >> a;
	int tot = 0;
	rep(i, 26) tot += a[i];
	vector<map<int, mint>> G(n);
	auto f = [&](int x, int y){
		return x * (k + 1) + y;
	};
	for(int x_from = 0; x_from < k + 1; x_from++){
		for(int y_from = 0; y_from < k + 1; y_from++){
			int from = f(x_from, y_from);
			rep(i, 26){
				int x_to = x_from;
				int y_to = y_from;
				if(s[x_from % l] == 'a' + i) x_to++;
				if(t[y_from % l] == 'a' + i) y_to++;
				int to = f(x_to, y_to);
				G[from][to] += mint(a[i]) / tot;
			}
		}
	}
	vector<mint> dp(n);
	dp[0] = 1;
	mint ans1 = 0;
	mint ans2 = 0;
	rep(_, k){
		vector<mint> dp_old(n);
		swap(dp, dp_old);
		rep(from, n){
			if(dp_old[from] == mint(0)) continue;
			for(auto [to, c] : G[from]) dp[to] += dp_old[from] * c;
		}
		rep(to, n){
			int x_to = to / (k + 1);
			int y_to = to % (k + 1);
			if(x_to == y_to + l){
				ans1 += dp[to];
				dp[to] = 0;
			}
			if(x_to + l == y_to){
				ans2 += dp[to];
				dp[to] = 0;
			}
		}
	}
	cout << ans1 << ' ' << ans2 << "\n";
	return 0;
}
0