結果

問題 No.2807 Have Another Go (Easy)
ユーザー 👑 binap
提出日時 2024-07-12 23:26:38
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 543 ms / 3,000 ms
コード長 4,569 bytes
コンパイル時間 4,941 ms
コンパイル使用メモリ 269,544 KB
最終ジャッジ日時 2025-02-22 05:32:02
ジャッジサーバーID
（参考情報） 		judge1 / judge6
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 46
権限があれば一括ダウンロードができます

ソースコード

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);
    }
    
    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 *= (f[0].pow(n - 1) * f[6]).pow(m - 1);
        mat *= f[0].pow(x - 1);
        mint val = calc(mat);
        cout << tot - val << "\n";
    }
    
    return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0