結果
問題 | No.1907 DETERMINATION |
ユーザー |
|
提出日時 | 2025-03-07 22:38:09 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 572 ms / 4,000 ms |
コード長 | 3,019 bytes |
コンパイル時間 | 2,331 ms |
コンパイル使用メモリ | 196,788 KB |
実行使用メモリ | 8,608 KB |
最終ジャッジ日時 | 2025-03-07 22:38:35 |
合計ジャッジ時間 | 25,058 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 63 |
コンパイルメッセージ
main.cpp: In function ‘int main()’: main.cpp:107:8: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 107 | scanf("%d", &n); | ~~~~~^~~~~~~~~~ main.cpp:110:12: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 110 | scanf("%d", &a[i][j]); | ~~~~~^~~~~~~~~~~~~~~~ main.cpp:113:12: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 113 | scanf("%d", &b[i][j]); | ~~~~~^~~~~~~~~~~~~~~~
ソースコード
#include <bits/stdc++.h> using LL = long long; const int N = 400 + 7; const int MOD = 998244353; int n, a[N][N], b[N][N], f[N][N], ox, det = 1; int pow(int x, int y) { int ret = 1; while(y) { if(y & 1) ret = 1LL * ret * x % MOD; x = 1LL * x * x % MOD; y >>= 1; } return ret; } void hsb(int (*a)[N]) { for(int i = 1; i <= n; ++i) { int p = 0; for(int j = i + 1; j <= n; ++j) if(a[j][i]) p = j; if(!p) continue; for(int j = 1; j <= n; ++j) std::swap(a[i + 1][j], a[p][j]); for(int j = 1; j <= n; ++j) std::swap(a[j][i + 1], a[j][p]); int t = pow(a[i + 1][i], MOD - 2); for(int j = 1; j <= n; ++j) a[j][i + 1] = 1LL * a[j][i + 1] * a[i + 1][i] % MOD; for(int j = 1; j <= n; ++j) a[i + 1][j] = 1LL * a[i + 1][j] * t % MOD; for(int j = i + 2; j <= n; ++j) { t = MOD - a[j][i]; for(int k = 1; k <= n; ++k) a[k][i + 1] = (a[k][i + 1] + 1LL * a[j][i] * a[k][j]) % MOD; for(int k = 1; k <= n; ++k) a[j][k] = (a[j][k] + 1LL * t * a[i + 1][k]) % MOD; } } } void getf(int (*a)[N], int (*f)[N]) { f[0][0] = 1; f[1][0] = -a[1][1], f[1][1] = 1; for(int i = 2; i <= n; ++i) { f[i][0] = -1LL * a[i][i] * f[i - 1][0] % MOD; for(int j = 1; j <= i; ++j) f[i][j] = (f[i - 1][j - 1] - 1LL * f[i - 1][j] * a[i][i]) % MOD; int t = 1; for(int j = i - 1; j >= 1; --j) { t = 1LL * t * a[j + 1][j] % MOD; int tt = 1LL * t * a[j][i] % MOD; for(int k = 0; k < j; ++k) f[i][k] = (f[i][k] - 1LL * f[j - 1][k] * tt) % MOD; } } } void guess(int (*a)[N], int (*b)[N]) { for(int i = 1; i <= n && ox <= n; ++i) { int p = 0; for(int j = i; j <= n; ++j) if(b[j][i]) p = j; if(!p) { ++ox; for(int j = 1; j < i; ++j) { for(int k = 1; k <= n; ++k) a[k][i] = (a[k][i] - 1LL * a[k][j] * b[j][i]) % MOD; b[j][i] = 0; } for(int k = 1; k <= n; ++k) std::swap(a[k][i], b[k][i]); --i; continue; } if(i != p) { std::swap(a[p], a[i]); std::swap(b[p], b[i]); det = MOD - det; } det = 1LL * det * b[i][i] % MOD; int t = pow(b[i][i], MOD - 2); for(int j = 1; j <= n; ++j) { b[i][j] = 1LL * b[i][j] * t % MOD; a[i][j] = 1LL * a[i][j] * t % MOD; } for(int j = 1; j <= n; ++j) if(i != j) { int t = MOD - b[j][i]; for(int k = 1; k <= n; ++k) { a[j][k] = (a[j][k] + 1LL * t * a[i][k]) % MOD; b[j][k] = (b[j][k] + 1LL * t * b[i][k]) % MOD; } } } } int main() { scanf("%d", &n); for(int i = 1; i <= n; ++i) for(int j = 1; j <= n; ++j) scanf("%d", &a[i][j]); for(int i = 1; i <= n; ++i) for(int j = 1; j <= n; ++j) scanf("%d", &b[i][j]); guess(a, b); for(int i = 1; i <= n; ++i) for(int j = 1; j <= n; ++j) a[i][j] = (MOD - a[i][j]) % MOD; hsb(a); getf(a, f); for(int i = 0; i <= n; ++i) printf("%lld\n", (i + ox <= n ? 1LL * f[n][i + ox] * det % MOD + MOD : 0) % MOD); return 0; }