Submission #65525469

---

Source Code Expand

#include <bits/stdc++.h>
#include <unordered_map>
 
#define rep(i, s, e) for(int i = s; i <= e; ++i)
#define fep(i, s, e) for(int i = s; i < e; ++i)
#define _rep(i, s, e) for(int i = s; i >= e; --i)
#define _fep(i, s, e) for(int i = s; i > e; --i)
 
#define int long long
#define pii pair<int, int>
 
namespace FastIO {
	template <typename _Tp> inline void read(_Tp &x) { int neg = 1; char ch; while(ch = getchar(), !isdigit(ch)) if(ch == '-') neg = -1; x = ch - '0'; while(ch = getchar(), isdigit(ch)) x = (x << 3) + (x << 1) + (ch ^ '0'); x *= neg; }
	template <typename _Tp, typename... _Args> inline void read(_Tp &x, _Args &...args) { read(x); read(args...); }
	template <typename _Tp> inline void read(_Tp* begin, _Tp* end) { int len = end - begin; for(int i = 0; i < len; ++i) read(*(begin + i)); }
	template <typename _Tp> inline void write(_Tp x) { if(x < 0) putchar('-'), x= -x; if(x > 9) write(x / 10); putchar(x % 10 + '0'); }
	template <typename _Tp, typename... _Args> inline void write(_Tp x, _Args ...args) { write(x); putchar(' '); write(args...); }
	template <typename _Tp> inline void write(_Tp* begin, _Tp* end) { int len = end - begin; for(int i = 0; i < len; ++i) write(*(begin + i)), putchar(' '); }
}
 
using namespace std;
using namespace FastIO;
 
const int inf = numeric_limits<int>::max();
const int ninf = numeric_limits<int>::min();
const int mod = 998244353;
const double eps = 0.000001;

int n, a, ans, cnt, vis[405], fac[405]; 
bitset<405> b[405]; 

void solve() {
	read(n), ans = 1;
	rep(i, 1, n) vis[i] = 0, b[i].reset();
	rep(i, 1, n) rep(j, 1, n) read(a), b[i][j] = a;
	rep(i, 1, n) if(!b[i][1] or !b[1][i]) return puts("0"), void();
	rep(i, 2, n) rep(j, 2, n) {
		if(((b[i] | b[j]) == b[i]) or ((b[i] | b[j]) == b[j])) {
			if(not b[i][j]) return puts("0"), void();
		}
		else {
			if(b[i][j]) return puts("0"), void();
		}
	}
	rep(i, 2, n) if(!vis[i]) {
		cnt = 1;
		rep(j, i + 1, n) if(b[i] == b[j]) ++cnt, vis[j] = 1;
		ans = ans * fac[cnt] % mod;
	}
	write(ans);
	putchar('\n');
	return;
}

signed main() {
	fac[0] = 1;
	rep(i, 1, 400) fac[i] = fac[i - 1] * i % mod;
	int T = 1; read(T);
	while(T--) solve();
	return 0;
}

Submission Info

Judge Result