結果
問題 | No.2255 Determinant Sum |
ユーザー | karinohito |
提出日時 | 2023-03-24 22:24:12 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
TLE
|
実行時間 | - |
コード長 | 3,587 bytes |
コンパイル時間 | 4,718 ms |
コンパイル使用メモリ | 273,180 KB |
実行使用メモリ | 10,624 KB |
最終ジャッジ日時 | 2024-09-18 17:17:24 |
合計ジャッジ時間 | 8,080 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
10,624 KB |
testcase_01 | AC | 2 ms
5,376 KB |
testcase_02 | AC | 2 ms
5,376 KB |
testcase_03 | AC | 4 ms
5,376 KB |
testcase_04 | AC | 320 ms
5,376 KB |
testcase_05 | AC | 2 ms
5,376 KB |
testcase_06 | AC | 28 ms
5,376 KB |
testcase_07 | TLE | - |
testcase_08 | -- | - |
testcase_09 | -- | - |
testcase_10 | -- | - |
testcase_11 | -- | - |
testcase_12 | -- | - |
testcase_13 | -- | - |
testcase_14 | -- | - |
testcase_15 | -- | - |
testcase_16 | -- | - |
testcase_17 | -- | - |
testcase_18 | -- | - |
testcase_19 | -- | - |
testcase_20 | -- | - |
testcase_21 | -- | - |
testcase_22 | -- | - |
ソースコード
#include <bits/stdc++.h>using namespace std;#include <atcoder/all>using namespace atcoder;using ll = long long;using vll = vector<ll>;using vvll = vector<vll>;using vvvll = vector<vvll>;#define all(A) A.begin(),A.end()#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)template<class T>bool chmax(T& p, T q, bool C = 1) {if (C == 0 && p == q) {return 1;}if (p < q) {p = q;return 1;}else {return 0;}}template<class T>bool chmin(T& p, T q, bool C = 1) {if (C == 0 && p == q) {return 1;}if (p > q) {p = q;return 1;}else {return 0;}}ll modPow(long long a, long long n, long long p) {if (n == 0) return 1; // 0乗にも対応する場合if (n == 1) return a % p;if (n % 2 == 1) return (a * modPow(a, n - 1, p)) % p;long long t = modPow(a, n / 2, p);return (t * t) % p;}ll gcd(ll(a), ll(b)) {if (a == 0)return b;if (b == 0)return a;ll c = a;while (a % b != 0) {c = a % b;a = b;b = c;}return b;}ll sqrtz(ll N) {ll L = 0;ll R = sqrt(N) + 10000;while (abs(R - L) > 1) {ll mid = (R + L) / 2;if (mid * mid <= N)L = mid;else R = mid;}return L;}using mint = modint;using vm = vector<mint>;using vvm = vector<vm>;using vvvm = vector<vvm>;/*vector<ll> fact, factinv, inv;const ll mod = 1e9 + 7;void prenCkModp(ll n) {fact.resize(n + 5);factinv.resize(n + 5);inv.resize(n + 5);fact[0] = fact[1] = 1;factinv[0] = factinv[1] = 1;inv[1] = 1;for (ll i = 2; i < n + 5; i++) {fact[i] = (fact[i - 1] * i) % mod;inv[i] = ((mod - ((inv[mod % i] * (mod / i))) % mod) + mod) % mod;factinv[i] = (factinv[i - 1] * inv[i]) % mod;}}ll nCk(ll n, ll k) {if (n < k || k < 0) return 0;return (fact[n] * ((factinv[k] * factinv[n - k]) % mod)) % mod;}*/bool DEBUG = 0;ll mod, S;mint det(vvm A,vvll AA) {ll N = A.size();if (N == 1) {if (AA[0][0] == 0)return A[0][0];else {return S;}}mint res = 0;rep(i, N) {vvm Y(N - 1, vm(N - 1));vvll YY(N - 1, vll(N - 1));ll NP = 0;rep(j, N) {if (j == i)continue;if (AA[0][j] == 1)NP++;}rep(j, N - 1)if (AA[j + 1][i] == 1)NP++;if (NP != 0)continue;rep(k, N - 1) {rep(j, N - 1) {Y[k][j] = A[k + 1][j + (j >= i)];YY[k][j]=AA[k + 1][j + (j >= i)];}}if (AA[0][i] == 1) {res += (i % 2 == 0 ? 1 : -1) * S * det(Y,YY);}else {res += (i % 2 == 0 ? 1 : -1) * det(Y,YY) * A[0][i];}}return res;}int main() {cin.tie(nullptr);ios::sync_with_stdio(false);ll T;cin >> T;rep(t, T) {ll N, P;cin >> N >> P;S = (P == 2 ? 1 : 0);mint::set_mod(P);vvm A(N, vm(N));vll D(N, 0), E(N, 0);bool OK = 1;vvll AA(N, vll(N,0));rep(i, N)rep(j, N) {ll a;cin >> a;if (a == -1){AA[i][j] = 1;A[i][j]=S;}else{A[i][j] = a;}}if(P!=2){cout<<0<<endl;continue;}cout << det(A,AA).val() << endl;}}