結果

問題 No.2255 Determinant Sum
ユーザー minato
提出日時 2023-03-24 23:23:56
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 19,737 bytes
コンパイル時間 1,509 ms
コンパイル使用メモリ 145,756 KB
最終ジャッジ日時 2025-02-11 17:44:58
ジャッジサーバーID
（参考情報） 		judge5 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 4 WA * 19
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#line 1 "library-cpp/other/template.hpp"
// clang-format off
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <forward_list>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
using i128 = __int128_t;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
template <class T> using maxheap = priority_queue<T>;
template <class T> using minheap = priority_queue<T, vector<T>, greater<T>>;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vector<T>>;
#define OVERLOAD_REP(_1, _2, _3, name, ...) name
#define REP0(n) for (auto minato = decay_t<decltype(n)>{}; minato < (n); ++minato)
#define REP1(i, n) for (auto i = decay_t<decltype(n)>{}; (i) < (n); (i)++)
#define REP2(i, l, r) for (auto i = (l); (i) < (r); (i)++)
#define rep(...) OVERLOAD_REP(__VA_ARGS__, REP2, REP1, REP0)(__VA_ARGS__)
#define OVERLOAD_RREP(_1, _2, _3, name, ...) name
#define RREP1(i, n) for (auto i = (n) - 1; (i) >= decay_t<decltype(n)>{}; (i)--)
#define RREP2(i, l, r) for (auto i = (r) - 1; (i) >= (l); (i)--)
#define rrep(...) OVERLOAD_RREP(__VA_ARGS__, RREP2, RREP1)(__VA_ARGS__)
#define all(x) begin(x), end(x)
template <class Container> int SZ(const Container& v) { return int(v.size()); }
template <class T> void UNIQUE(vector<T>& v) { v.erase(unique(v.begin(), v.end()), v.end()); }
template <class T> T MAX(const vector<T>& v) { return *max_element(v.begin(), v.end()); }
template <class T> T MIN(const vector<T>& v) { return *min_element(v.begin(), v.end()); }
template <class T> T SUM(const vector<T>& v) { return accumulate(v.begin(), v.end(), T(0)); }
template <class T> T ABS(T x) { return max(x, -x); }
template <class T1, class T2> bool chmax(T1& a, T2 b) { if (a < b) { a = b; return true; } return false; }
template <class T1, class T2> bool chmin(T1& a, T2 b) { if (a > b) { a = b; return true; } return false; }
int topbit(ull x) { return x == 0 ? -1 : 63 - __builtin_clzll(x); }
int botbit(ull x) { return x == 0 ? 64 : __builtin_ctzll(x); }
int popcount(ull x) { return __builtin_popcountll(x); }
int kthbit(ull x, int k) { return (x >> k) & 1; }
constexpr long long TEN(int x) { return x == 0 ? 1 : TEN(x - 1) * 10; }
template <typename S> void rearrange(const vector<S>& id) { (void)id; }
template <typename S, typename T> void rearrange_exec(const vector<S>& id, vector<T>& v) { vector<T> w(v.size()); for (size_t i = 0; i < id.size(); i
    ++) { w[i] = v[id[i]]; } v.swap(w); }
template <typename S, typename Head, typename... Tail> void rearrange(const vector<S>& id, Head& a, Tail& ...tail) { rearrange_exec(id, a); rearrange
    (id, tail...); }
istream& operator>>(istream& is, __int128_t& x) {
    x = 0;
    string s;
    is >> s;
    int n = int(s.size()), it = 0;
    if (s[0] == '-') it++;
    for (; it < n; it++) x = (x * 10 + s[it] - '0');
    if (s[0] == '-') x = -x;
    return is;
}
ostream& operator<<(ostream& os, __int128_t x) {
    if (x == 0) return os << 0;
    if (x < 0) os << '-', x = -x;
    deque<int> deq;
    while (x) deq.emplace_front(x % 10), x /= 10;
    for (int e : deq) os << e;
    return os;
}
template <class T> vector<T> &operator++(vector<T>& v) { for (auto& e : v) { e++; } return v;} 
template <class T> vector<T> operator++(vector<T>& v, int) { auto res = v; for (auto& e : v) { e++; } return res; }
template <class T> vector<T> &operator--(vector<T>& v) { for (auto& e : v) { e--; } return v; }
template <class T> vector<T> operator--(vector<T>& v, int) { auto res = v; for (auto& e : v) { e--; } return res; }
template <class T1, class T2> pair<T1, T2> operator-(const pair<T1, T2>& x) { return pair<T1, T2>(-x.first, -x.second); }
template <class T1, class T2> pair<T1, T2> operator-(const pair<T1, T2>& x, const pair<T1, T2>& y) { return pair<T1, T2>(x.first - y.first, x.second 
    - y.second); }
template <class T1, class T2> pair<T1, T2> operator+(const pair<T1, T2>& x, const pair<T1, T2>& y) { return pair<T1, T2>(x.first + y.first, x.second 
    + y.second); }
template <class T1, class T2> pair<T1, T2> operator+=(pair<T1, T2>& l, const pair<T1, T2>& r) { return l = l + r; }
template <class T1, class T2> pair<T1, T2> operator-=(pair<T1, T2>& l, const pair<T1, T2>& r) { return l = l - r; }
constexpr char ln = '\n';
const string YESNO[2] = {"NO", "YES"};
const string YesNo[2] = {"No", "Yes"};
void YES(bool t = true) { cout << YESNO[t] << "\n"; }
void NO(bool t = 1) { YES(!t); }
void Yes(bool t = true) { cout << YesNo[t] << "\n"; }
void No(bool t = 1) { Yes(!t); }
template <class T> void drop(T x) { cout << x << "\n"; exit(0); }
#define INT(...)     \
    int __VA_ARGS__; \
    IN(__VA_ARGS__)
#define LL(...)     \
    ll __VA_ARGS__; \
    IN(__VA_ARGS__)
#define STR(...)        \
    string __VA_ARGS__; \
    IN(__VA_ARGS__)
#define CHR(...)      \
    char __VA_ARGS__; \
    IN(__VA_ARGS__)
#define LDB(...)             \
    long double __VA_ARGS__; \
    IN(__VA_ARGS__)
#define VEC(type, name, size) \
    vector<type> name(size);  \
    IN(name)
#define VEC2(type, name1, name2, size)     \
    vector<type> name1(size), name2(size); \
    for (int i = 0; i < size; i++) IN(name1[i], name2[i])
#define VEC3(type, name1, name2, name3, size)           \
    vector<type> name1(size), name2(size), name3(size); \
    for (int i = 0; i < size; i++) IN(name1[i], name2[i], name3[i])
#define VEC4(type, name1, name2, name3, name4, size)                 \
    vector<type> name1(size), name2(size), name3(size), name4(size); \
    for (int i = 0; i < size; i++) IN(name1[i], name2[i], name3[i], name4[i]);
#define VV(type, name, N, M)                       \
    vector<vector<type>> name(N, vector<type>(M)); \
    IN(name)
template <class T> void scan(T& a) { cin >> a; }
template <class T> void scan(vector<T>& a) { for (auto& i : a) scan(i); }
void IN() {}
template <class Head, class... Tail> void IN(Head& head, Tail&... tail) { scan(head); IN(tail...); }
void print() { cout << "\n"; }
template <class T> void print(const vector<T>& v) { for (auto it = v.begin(); it != v.end(); ++it) { if (it != v.begin()) { cout << " "; } cout << 
    *it; } print(); }
template <class T, class... Args> void print(const T& x, const Args& ... args) { cout << x; if (sizeof...(Args)) cout << " "; print(args...); }
#ifdef MINATO_LOCAL
template <class T1, class T2> ostream& operator<<(ostream& os, pair<T1, T2> p) { return os << "(" << p.first << ", " << p.second << ")"; }
template <size_t N, class TUPLE> void debug_tuple(ostream& os, TUPLE _) { (void)os; (void)_; }
template <size_t N, class TUPLE, class T, class ...Args> void debug_tuple(ostream &os, TUPLE t) { os << (N == 0 ? "" : ", ") << get<N>(t); 
    debug_tuple<N + 1, TUPLE, Args...>(os, t); }
template <class ...Args> ostream& operator<<(ostream& os, tuple<Args...> t) { os << "("; debug_tuple<0, tuple<Args...>, Args...>(os, t); return os << 
    ")"; }
string debug_delim(int& i) { return i++ == 0 ? "" : ", "; }
#define debug_embrace(x) { int i = 0; os << "{";  { x } return os << "}"; }
template <class T> ostream& operator<<(ostream& os, vector<T> v) { debug_embrace( for (T e : v) { os << debug_delim(i) << e; } ) }
template <class T, size_t N> ostream& operator<<(ostream& os, array<T, N> a) { debug_embrace( for (T e : a) { os << debug_delim(i) << e; } ) }
template <class T, size_t N> enable_if_t<!is_same_v<char, remove_cv_t<T>>, ostream>& operator<<(ostream& os, T(&a)[N]) { debug_embrace( for (T e : a) 
    { os << debug_delim(i) << e; } ) }
template <class Key> ostream& operator<<(ostream& os, set<Key> s) { debug_embrace( for (Key e : s) { os << debug_delim(i) << e; }) }
template <class Key, class T> ostream& operator<<(ostream& os, map<Key, T> mp) { debug_embrace( for (auto e : mp) { os << debug_delim(i) << e; }) }
template <class Key> ostream& operator<<(ostream& os, multiset<Key> s) { debug_embrace( for (Key e : s) { os << debug_delim(i) << e; }) }
template <class T> ostream& operator<<(ostream& os, queue<T> q) { debug_embrace( for (; !q.empty(); q.pop()) { os << debug_delim(i) << q.front(); } ) 
    }
template <class T> ostream& operator<<(ostream& os, deque<T> q) { debug_embrace( for (T e : q) { os << debug_delim(i) << e; } ) }
template <class T> ostream& operator<<(ostream& os, priority_queue<T> q) { debug_embrace( for (; !q.empty(); q.pop()) { os << debug_delim(i) << q.top
    (); } ) }
template <class T> ostream& operator<<(ostream& os, priority_queue<T, vector<T>, greater<T>> q) { debug_embrace( for (; !q.empty(); q.pop()) { os << 
    debug_delim(i) << q.top(); } ) }
void debug_out() { cerr << endl; }
template <class T, class... Args> void debug_out(const T& x, const Args& ... args) { cerr << " " << x; debug_out(args...); }
#define debug(...) cerr << __LINE__ << " : [" << #__VA_ARGS__ << "] =", debug_out(__VA_ARGS__)
#else
#define debug(...) (void(0))
#endif
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
    //////////////////////////////////////
// clang-format on
#line 2 "D.cpp"
/////  mint::set(MOD)  /////
struct DynamicModInt {
    using Mint = DynamicModInt;
  public:
    static int mod() {
        return int(umod());
    }
    static void set(int MOD) {
        umod() = (unsigned int)MOD;
        im() = (unsigned long long)(-1) / umod() + 1;
    }
    static Mint raw(int v) {
        Mint x;
        x._v = v;
        return x;
    }
    DynamicModInt() : _v(0) {
    }
    DynamicModInt(long long v) {
        long long x = (long long)(v % (long long)(umod()));
        if (x < 0) x += umod();
        _v = (unsigned int)(x);
    }
    unsigned int val() const {
        return _v;
    }
    Mint& operator++() {
        _v++;
        if (_v == umod()) _v = 0;
        return *this;
    }
    Mint& operator--() {
        if (_v == 0) _v = umod();
        _v--;
        return *this;
    }
    Mint operator++(int) {
        Mint result = *this;
        ++*this;
        return result;
    }
    Mint operator--(int) {
        Mint result = *this;
        --*this;
        return result;
    }
    Mint& operator+=(const Mint& rhs) {
        _v += rhs._v;
        if (_v >= umod()) _v -= umod();
        return *this;
    }
    Mint& operator-=(const Mint& rhs) {
        _v += mod() - rhs._v;
        if (_v >= umod()) _v -= umod();
        return *this;
    }
    Mint& operator*=(const Mint& rhs) {
        unsigned long long z = _v;
        z *= rhs._v;
        unsigned long long x =
            (unsigned long long)(((unsigned __int128)(z)*im()) >> 64);
        _v = (unsigned int)(z - x * umod());
        if (umod() <= _v) _v += umod();
        return *this;
    }
    Mint& operator^=(long long n) {
        Mint x = *this;
        *this = 1;
        if (n < 0) x = x.inv(), n = -n;
        while (n) {
            if (n & 1) *this *= x;
            x *= x;
            n >>= 1;
        }
        return *this;
    }
    Mint& operator/=(const Mint& rhs) {
        return *this = *this * rhs.inv();
    }
    Mint operator+() const {
        return *this;
    }
    Mint operator-() const {
        return Mint() - *this;
    }
    explicit operator bool() const {
        return _v != 0;
    }
    Mint pow(long long n) const {
        Mint r = *this;
        r ^= n;
        return r;
    }
    Mint inv() const {
        int a = _v, b = umod(), y = 1, z = 0, t;
        for (;;) {
            t = a / b;
            a -= t * b;
            if (a == 0) {
                assert(b == 1 || b == -1);
                return Mint(b * z);
            }
            y -= t * z;
            t = b / a;
            b -= t * a;
            if (b == 0) {
                assert(a == 1 || a == -1);
                return Mint(a * y);
            }
            z -= t * y;
        }
    }
    friend Mint operator+(const Mint& lhs, const Mint& rhs) {
        return Mint(lhs) += rhs;
    }
    friend Mint operator-(const Mint& lhs, const Mint& rhs) {
        return Mint(lhs) -= rhs;
    }
    friend Mint operator*(const Mint& lhs, const Mint& rhs) {
        return Mint(lhs) *= rhs;
    }
    friend Mint operator/(const Mint& lhs, const Mint& rhs) {
        return Mint(lhs) /= rhs;
    }
    friend Mint operator^(const Mint& lhs, long long rhs) {
        return Mint(lhs) ^= rhs;
    }
    friend bool operator==(const Mint& lhs, const Mint& rhs) {
        return lhs._v == rhs._v;
    }
    friend bool operator!=(const Mint& lhs, const Mint& rhs) {
        return lhs._v != rhs._v;
    }
    friend Mint operator+(long long lhs, const Mint& rhs) {
        return (Mint(lhs) += rhs);
    }
    friend Mint operator-(long long lhs, const Mint& rhs) {
        return (Mint(lhs) -= rhs);
    }
    friend Mint operator*(long long lhs, const Mint& rhs) {
        return (Mint(lhs) *= rhs);
    }
    friend ostream& operator<<(ostream& os, const Mint& M) {
        return os << M._v;
    }
    friend istream& operator>>(istream& is, Mint& M) {
        long long x;
        is >> x;
        M = x;
        return is;
    }
  private:
    unsigned int _v;
    static unsigned long long& im() {
        static unsigned long long im = 0;
        return im;
    }
    static unsigned int& umod() {
        static unsigned int m = 0;
        return m;
    }
};
using mint = DynamicModInt;
template <class M> struct ModCombination {
  public:
    ModCombination() {
    }
    ModCombination(int n) : n_(n), fac_(n + 1), facinv_(n + 1) {
        assert(1 <= n);
        fac_[0] = 1;
        for (int i = 1; i <= n; i++) fac_[i] = fac_[i - 1] * i;
        facinv_[n] = M(1) / fac_[n];
        for (int i = n; i >= 1; i--) facinv_[i - 1] = facinv_[i] * i;
    }
    M fac(int k) const {
        assert(0 <= k and k <= n_);
        return fac_[k];
    }
    M facinv(int k) const {
        assert(0 <= k and k <= n_);
        return facinv_[k];
    }
    M inv(int k) const {
        assert(1 <= k and k <= n_);
        return facinv_[k] * fac_[k - 1];
    }
    M P(int n, int k) const {
        if (k < 0 or k > n) return M(0);
        assert(n <= n_);
        return fac_[n] * facinv_[n - k];
    }
    M C(int n, int k) const {
        if (k < 0 or k > n) return M(0);
        assert(n <= n_);
        return fac_[n] * facinv_[n - k] * facinv_[k];
    }
    M H(int n, int k) const {
        if (n == 0 and k == 0) return M(1);
        return C(n + k - 1, n);
    }
    M catalan(int n) const {
        if (n == 0) return M(1);
        return C(2 * n, n) - C(2 * n, n - 1);
    }
  private:
    int n_;
    vector<M> fac_, facinv_;
};
template <class T, int sz> struct SquareMatrix {
    using arr = array<T, sz>;
    using mat = array<arr, sz>;
    SquareMatrix() : SquareMatrix(sz) {
    }
    SquareMatrix(int n) : n_(n) {
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                A[i][j] = 0;
            }
        }
    }
    int size() const {
        return n_;
    }
    const arr& operator[](int i) const {
        assert(0 <= i and i < n_);
        return A[i];
    }
    arr& operator[](int i) {
        assert(0 <= i and i < n_);
        return A[i];
    }
    static SquareMatrix add_identity(int n_) {
        return SquareMatrix(n_);
    }
    static SquareMatrix mul_identity(int n_) {
        SquareMatrix I(n_);
        for (int i = 0; i < n_; i++) I[i][i] = 1;
        return I;
    }
    T add(T a, T b) const {
        return a + b;
    }
    T mul(T a, T b) const {
        return a * b;
    }
    SquareMatrix& operator+=(const SquareMatrix& B) {
        assert(B.size() == n_);
        for (int i = 0; i < n_; i++) {
            for (int j = 0; j < n_; j++) {
                (*this)[i][j] = add((*this)[i][j], B[i][j]);
            }
        }
        return *this;
    }
    SquareMatrix& operator*=(const SquareMatrix& B) {
        assert(B.size() == n_);
        SquareMatrix C(n_);
        for (int i = 0; i < n_; i++) {
            for (int k = 0; k < n_; k++) {
                for (int j = 0; j < n_; j++) {
                    C[i][j] = add(C[i][j], mul((*this)[i][k], B[k][j]));
                }
            }
        }
        A.swap(C.A);
        return *this;
    }
    SquareMatrix& operator^=(long long k) {
        SquareMatrix B = SquareMatrix::mul_identity(n_);
        while (k > 0) {
            if (k & 1) B *= *this;
            *this *= *this;
            k >>= 1;
        }
        A.swap(B.A);
        return *this;
    }
    SquareMatrix pow(long long k) const {
        SquareMatrix ret = *this;
        ret ^= k;
        return ret;
    }
    SquareMatrix operator+(const SquareMatrix& B) const {
        return (SquareMatrix(*this) += B);
    }
    SquareMatrix operator*(const SquareMatrix& B) const {
        return (SquareMatrix(*this) *= B);
    }
    SquareMatrix operator^(long long k) const {
        return (SquareMatrix(*this) ^= k);
    }
    bool operator==(const SquareMatrix& B) const {
        return A == B.A;
    }
    bool operator!=(const SquareMatrix& B) const {
        return A != B.A;
    }
    friend ostream& operator<<(ostream& os, SquareMatrix& B) {
        for (int i = 0; i < B.size(); i++) {
            os << "[";
            for (int j = 0; j < B.size(); j++) {
                os << B[i][j] << (j == B.size() - 1 ? "]\n" : ",");
            }
        }
        return os;
    }
    T determinant() const {
        SquareMatrix B = *this;
        T ret = 1;
        for (int i = 0; i < n_; i++) {
            int idx = -1;
            for (int j = i; j < n_; j++) {
                if (B[j][i] != 0) idx = j;
            }
            if (idx == -1) return T(0);
            if (i != idx) {
                ret *= -1;
                swap(B[i], B[idx]);
            }
            ret *= B[i][i];
            T inv = T(1) / B[i][i];
            for (int j = 0; j < n_; j++) {
                B[i][j] *= inv;
            }
            for (int j = i + 1; j < n_; j++) {
                T a = B[j][i];
                if (a == 0) continue;
                for (int k = 0; k < n_; k++) {
                    B[j][k] -= B[i][k] * a;
                }
            }
        }
        return ret;
    }
  private:
    int n_;
    mat A;
};
void solve() {
    INT(N, P);
    DynamicModInt::set(P);
    VV(int, A, N, N);
    if (P != 2) {
        rep(i, N) rep(j, N) {
            if (A[i][j] == -1) {
                print(0);
                return;
            }
        }
    } else {
        rep(i, N) {
            int cnt = 0;
            rep(j, N) {
                if (A[i][j] == -1) cnt++;
            }
            if (cnt >= 2) {
                rep(j, N) {
                    if (A[i][j] == -1) A[i][j] = 0;
                }
            } else if (cnt == 1) {
                rep(j, N) {
                    if (A[i][j] == -1) A[i][j] = 1;
                }
            }
        }
    }
    SquareMatrix<DynamicModInt, 50> B(N);
    rep(i, N) rep(j, N) {
        B[i][j] = A[i][j];
    }
    auto ans = B.determinant();
    print(ans);
}
int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(20);
    cerr << fixed << setprecision(7);
    int T = 1;
    cin >> T;
    for (int test_case = 1; test_case <= T; test_case++) {
        // debug(test_case);
        solve();
    }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0