結果

問題 No.2807 Have Another Go (Easy)
ユーザー 👑 binapbinap
提出日時 2024-07-12 23:28:21
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 344 ms / 3,000 ms
コード長 4,592 bytes
コンパイル時間 5,237 ms
コンパイル使用メモリ 281,004 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-07-12 23:28:37
合計ジャッジ時間 15,851 ms
ジャッジサーバーID
(参考情報)
judge3 / judge2
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 149 ms
6,944 KB
testcase_02 AC 279 ms
6,940 KB
testcase_03 AC 231 ms
6,940 KB
testcase_04 AC 2 ms
6,944 KB
testcase_05 AC 328 ms
6,940 KB
testcase_06 AC 259 ms
6,940 KB
testcase_07 AC 160 ms
6,944 KB
testcase_08 AC 108 ms
6,940 KB
testcase_09 AC 175 ms
6,940 KB
testcase_10 AC 26 ms
6,944 KB
testcase_11 AC 341 ms
6,944 KB
testcase_12 AC 341 ms
6,940 KB
testcase_13 AC 342 ms
6,940 KB
testcase_14 AC 341 ms
6,944 KB
testcase_15 AC 343 ms
6,944 KB
testcase_16 AC 341 ms
6,940 KB
testcase_17 AC 340 ms
6,944 KB
testcase_18 AC 340 ms
6,940 KB
testcase_19 AC 342 ms
6,944 KB
testcase_20 AC 342 ms
6,940 KB
testcase_21 AC 341 ms
6,944 KB
testcase_22 AC 342 ms
6,944 KB
testcase_23 AC 342 ms
6,940 KB
testcase_24 AC 344 ms
6,944 KB
testcase_25 AC 340 ms
6,940 KB
testcase_26 AC 343 ms
6,940 KB
testcase_27 AC 343 ms
6,940 KB
testcase_28 AC 341 ms
6,944 KB
testcase_29 AC 341 ms
6,940 KB
testcase_30 AC 341 ms
6,940 KB
testcase_31 AC 2 ms
6,944 KB
testcase_32 AC 5 ms
6,940 KB
testcase_33 AC 6 ms
6,944 KB
testcase_34 AC 4 ms
6,944 KB
testcase_35 AC 3 ms
6,944 KB
testcase_36 AC 18 ms
6,940 KB
testcase_37 AC 5 ms
6,944 KB
testcase_38 AC 69 ms
6,944 KB
testcase_39 AC 5 ms
6,940 KB
testcase_40 AC 54 ms
6,944 KB
testcase_41 AC 73 ms
6,940 KB
testcase_42 AC 69 ms
6,944 KB
testcase_43 AC 45 ms
6,940 KB
testcase_44 AC 50 ms
6,940 KB
testcase_45 AC 30 ms
6,940 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;

ostream& operator<<(ostream& os, const modint& a) {os << a.val(); return os;}
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<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;

// https://youtu.be/ylWYSurx10A?t=2352
template<typename T>
struct Matrix  : vector<vector<T>> {
	int h, w;
	Matrix(int h, int w, T val=0): vector<vector<T>>(h, vector<T>(w, val)), h(h), w(w) {}
	Matrix(initializer_list<initializer_list<T>> a) : vector<vector<T>>(a.begin(), a.end()){
		assert(int(this->size()) >= 1);
		assert(int((*this)[0].size()) >= 1);
		h = this->size();
		w = (*this)[0].size();
		rep(i, h) assert(int((*this)[i].size()) == w);
	}
	Matrix& unit() {
		assert(h == w);
		rep(i,h) (*this)[i][i] = 1;
		return *this;
	}
	Matrix operator*=(const Matrix& M){
		assert(w == M.h);
		Matrix r(h, M.w);
		rep(i,h) rep(k,w) rep(j, M.w){
			r[i][j] += (*this)[i][k] * M[k][j];
		}
		swap(*this, r);
		return *this;
	}
	Matrix operator*(const Matrix& M) const {return (Matrix(*this) *= M);}
	Matrix operator*=(const T& a) {
		for(int i = 0; i < h; i++) for(int j = 0; j < w; j++) (*this)[i][j] *= a;
		return *this;
	}
	Matrix operator*(const T& a) const {return (Matrix(*this) *= a);}
	Matrix operator+=(const Matrix& M){
		assert(h == M.h and w == M.w);
		for(int i = 0; i < h; i++) for(int j = 0; j < w; j++) (*this)[i][j] += M[i][j];
		return *this;
	}
	Matrix operator+(const Matrix& M) const {return (Matrix(*this) += M);}
	Matrix pow(long long t) const {
		assert(h == w);
		if (!t) return Matrix(h,h).unit();
		if (t == 1) return *this;
		Matrix r = pow(t>>1);r = r*r;
		if (t&1) r = r*(*this);
		return r;
	}
};

int main(){
	long long n, m;
	int k;
	cin >> n >> m >> k;
	vector<int> c(k);
	cin >> c;
	
	vector<Matrix<mint>> f;
	rep(i, 7){
		Matrix<mint> mat(6, 6);
		mat[0] = {1, 1, 1, 1, 1, 1};
		rep(j, i) mat[0][j] = 0;
		mat[1] = {1, 0, 0, 0, 0, 0};
		mat[2] = {0, 1, 0, 0, 0, 0};
		mat[3] = {0, 0, 1, 0, 0, 0};
		mat[4] = {0, 0, 0, 1, 0, 0};
		mat[5] = {0, 0, 0, 0, 1, 0};
		f.push_back(mat);
	}
	
	auto calc = [&](Matrix<mint> mat){
		Matrix<mint> prod(6, 6);
		prod = prod.unit();
		for(int x = 5; x >= 1; x--){
			prod *= f[x];
		}
		prod *= mat;
		mint res = 0;
		rep(i, 6) res += prod[i][0];
		return res;
	};
	
	mint tot = 0;
	{
		Matrix<mint> mat(6, 6);
		mat = mat.unit();
		mat *= f[0].pow(n * m);
		tot = calc(mat);
	}
	
	Matrix<mint> g = (f[0].pow(n - 1) * f[6]).pow(m - 1);
	
	rep(i, k){
		int x = c[i];
		Matrix<mint> mat(6, 6);
		mat = mat.unit();
		mat *= f[0].pow(n - x);
		mat *= f[6];
		mat *= g;
		mat *= f[0].pow(x - 1);
		mint val = calc(mat);
		cout << tot - val << "\n";
	}
	
	return 0;
}
0