結果

問題 No.2825 Sum of Scores of Sets of Specified Sections
コンテスト
ユーザー AngrySadEight
提出日時 2024-07-03 22:33:21
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
AC  
実行時間 221 ms / 3,000 ms
コード長 4,850 bytes
コンパイル時間 20,947 ms
コンパイル使用メモリ 263,920 KB
最終ジャッジ日時 2025-02-22 01:55:45
ジャッジサーバーID
（参考情報） 		judge1 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 32
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

using mint = modint998244353;

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

ll my_pow(ll x, ll n, ll mod) {
    // 　繰り返し二乗法．x^nをmodで割った余り．
    ll ret;
    if (n == 0) {
        ret = 1;
    } else if (n % 2 == 1) {
        ret = (x * my_pow((x * x) % mod, n / 2, mod)) % mod;
    } else {
        ret = my_pow((x * x) % mod, n / 2, mod);
    }
    return ret;
}

ll inv(ll x, ll mod) { return my_pow(x, mod - 2, mod); }

ll determinant(vector<vector<ll>> &B, ll mod) {
    ll height = B.size();
    ll width = B.size();
    assert(width == height);
    ll ret = 1;
    for (int i = 0; i < width; i++) {
        int idx = -1;
        for (int j = i; j < width; j++) {
            if (B[j][i] != 0) idx = j;
        }
        if (idx == -1) return (0);
        if (i != idx) {
            ret *= -1;
            ret = (ret + mod) % mod;
            swap(B[i], B[idx]);
        }
        ret *= B[i][i];
        ret %= mod;
        ll vv = B[i][i];
        for (int j = 0; j < width; j++) {
            B[i][j] *= inv(vv, mod);
            B[i][j] %= mod;
        }
        for (int j = i + 1; j < width; j++) {
            ll a = B[j][i];
            for (int k = 0; k < width; k++) {
                ll mins = (B[i][k] * a) % mod;
                B[j][k] = (B[j][k] + mod - mins) % mod;
            }
        }
    }
    return ret % mod;
}

int main() {
    ll H, W;
    cin >> H >> W;
    vector<vector<ll>> A(H, vector<ll>(W));
    for (ll i = 0; i < H; i++) {
        for (ll j = 0; j < W; j++) {
            cin >> A[i][j];
        }
    }
    vector<vector<ll>> B(H, vector<ll>(W));
    for (ll i = 0; i < H; i++) {
        for (ll j = 0; j < W; j++) {
            cin >> B[i][j];
        }
    }
    vector<vector<ll>> tB(W, vector<ll>(H));
    for (ll i = 0; i < H; i++) {
        for (ll j = 0; j < W; j++) {
            tB[j][i] = B[i][j];
        }
    }
    vector<vector<ll>> C(H, vector<ll>(H));
    for (ll i = 0; i < H; i++) {
        for (ll j = 0; j < W; j++) {
            for (ll k = 0; k < H; k++) {
                C[i][k] += A[i][j] * tB[j][k];
                C[i][k] %= mod2;
            }
        }
    }
    // debug(C);
    for (ll i = 0; i < H; i++) {
        C[i][i] = (C[i][i] + 1) % mod2;
    }
    ll ans = determinant(C, mod2);
    cout << (ans + mod2 - 1) % mod2 << endl;
}
0