Submission #65507815

---

Source Code Expand

#include<bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
using ll=long long;
using ld=long double;
using ull=unsigned long long;
using i128 = __int128_t;
#define vs vector<string>
#define rep(i,n) for(int i=0;i<int(n);i++)
#define rep2(i,n) for(int i=n-1;i>=0;i--)
#define rep3(i,a,b) for(ll i=a;i<=ll(b);i++)
#define rep4(i,a,b) for(ll i=a;i>=ll(b);i--)
#define forv(i,V) for(const auto& i:V)
#define all(x) x.begin(),x.end()
#define fi first
#define se second
#define SIZE(x) int(x.size())
constexpr ll mod=998244353;
//constexpr ll mod=1000000007;
#define pi 3.14159265358979323
#define INF32 2147483647
#define INF64 9223372036854775807
#define faster ios::sync_with_stdio(false);std::cin.tie(nullptr)
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define rev reverse
#define vi vector<int>
#define vll vector<ll>
#define vpi vector<pair<int,int>>
#define vpll vector<pair<ll,ll>>
#define vvi vector<vector<int>>
#define vvll vector<vector<ll>>
#define prq priority_queue
#define lb lower_bound
#define ub upper_bound
#define popcnt __builtin_popcountll
#define TLE while(true);
#define RE assert(false);
#define MLE vector<vector<vector<long long>>> mle_mle(400,vector<vector<long long>>(1000,vector<long long>(1000)));
const string YESNO[2] = {"NO", "YES"};
const string YesNo[2] = {"No", "Yes"};
const string yesno[2] = {"no", "yes"};
#define rall(n) (n).rbegin(),(n).rend()
#define INT(...) int __VA_ARGS__;scan(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;scan(__VA_ARGS__)
#define STR(...) string __VA_ARGS__;scan(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__;scan(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__;scan(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__;scan(__VA_ARGS__)
template<typename T,typename U>
ostream &operator<<(ostream&os,const pair<T,U>&p){os<<p.first<<" "<<p.second;return os;}
template<typename T,typename U>
istream &operator>>(istream&is,pair<T,U>&p){is>>p.first>>p.second;return is;}
template<typename T>
ostream &operator<<(ostream&os,const vector<T>&v){for(auto it=v.begin();it!=v.end();){os<<*it<<((++it)!=v.end()?" ":"");}return os;}
template<typename T>
istream &operator>>(istream&is,vector<T>&v){for(T &in:v){is>>in;}return is;}
void scan(){}
template<class Head,class... Tail>
void scan(Head&head,Tail&... tail){cin>>head;scan(tail...);}
template<class T>
void print(const T &t){cout<<t<<'\n';}
template<class Head, class... Tail>
void print(const Head &head, const Tail &... tail){cout<<head<<' ';print(tail...);}
template<class... T>
void fin(const T &... a){print(a...);exit(0);}
ll max(int a,ll b){return max((ll)a,b);}
ll max(ll a,int b){return max((ll)b,a);}
ll min(int a,ll b){return min((ll)a,b);}
ll min(ll a,int b){return min((ll)b,a);}
//a以上b以下の個数
template<typename T>
ll RangeOK(ll a,ll b,vector<T> &v){
  return max(ub(all(v),b)-lb(all(v),a),0);
}
template <typename T>
vector<T> compress(vector<T> &X) {
    vector<T> vals = X;
    sort(vals.begin(), vals.end());
    vals.erase(unique(vals.begin(), vals.end()), vals.end());
    for (int i = 0; i < (int)X.size(); i++) {
        X[i] = lower_bound(vals.begin(), vals.end(), X[i]) - vals.begin();
    }
    return vals;
}
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#include<atcoder/all>
using namespace atcoder;
using mint = modint998244353;
mint dfs(vvi &a, int cnt){
  int n = a.size();
  dsu d(n);
  vi deg(n);
  int degma = 0;
  rep(i, n){
    rep(j, n){
      if(a[i][j]){
        d.merge(i, j);
        deg[i]++;
      }
    }
    degma = max(degma, deg[i]);
  }
  mint ret = 1;
  if(d.groups().size() == cnt + 1){
    int u = count(all(deg), n - cnt);
    if(u == 0) return mint(0);
    rep3(i, 1, u) ret *= i;
    dsu d2(n);
    rep(i, n){
      rep(j, n){
        if(a[i][j] == 1 && deg[i] != n - cnt && deg[j] != n - cnt){
          d2.merge(i, j);
        }
      }
    }
    auto f = d2.groups();
    for(auto x:f){
      if(x.size() == 1) continue;
      vvi a2(n, vi(n));
      rep(i, n){
        if(d2.same(i, x[0])){
          rep(j, n){
            if(d2.same(j, x[0])) a2[i][j] = a[i][j];
          }
        }
      }
      ret *= dfs(a2, n - x.size());
    }
  }else{
    auto f = d.groups();
    for(auto x:f){
      if(x.size() == 1) continue;
      vvi a2(n, vi(n));
      rep(i, n){
        if(d.same(i, x[0])){
          rep(j, n){
            if(d.same(j, x[0])) a2[i][j] = a[i][j];
          }
        }
      }
      ret *= dfs(a2, n - x.size());
    }
  }
  return ret;
}
void solve(){
  INT(n);
  vvi a(n, vi(n));
  scan(a);
  vvll g(n);
  rep(i, n){
    rep(j, n){
      if(a[i][j]) g[i].pb(j);
    }
  }
  vll deg(n);
  rep(i, n) deg[i] = g[i].size();
  if(deg[0] != n){
    print(0);
    return;
  }
  rep(i, n) a[i][0] = 0, a[0][i] = 0;
  print(dfs(a, 1).val());
}
int main(){
  INT(t);
  while(t--) solve();
}

Submission Info

Compile Error

Main.cpp: In function ‘mint dfs(std::vector<std::vector<int> >&, int)’:
Main.cpp:111:24: warning: comparison of integer expressions of different signedness: ‘std::vector<std::vector<int> >::size_type’ {aka ‘long unsigned int’} and ‘int’ [-Wsign-compare]
  111 |   if(d.groups().size() == cnt + 1){
      |      ~~~~~~~~~~~~~~~~~~^~~~~~~~~~

Judge Result