結果

問題 No.3285 Chorus with Friends
ユーザー hos.lyric
提出日時 2025-09-26 21:41:27
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 5,368 bytes
コンパイル時間 1,021 ms
コンパイル使用メモリ 114,024 KB
実行使用メモリ 7,720 KB
最終ジャッジ日時 2025-09-26 21:41:39
合計ジャッジ時間 6,946 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 27 WA * 13
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function ‘int main()’:
main.cpp:134:66: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
  134 |     for (int x = 0; x < M; ++x) for (int y = 0; y < N; ++y) scanf("%d", &A[x][y]);
      |                                                             ~~~~~^~~~~~~~~~~~~~~~

ソースコード

diff # 

#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <chrono>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")

////////////////////////////////////////////////////////////////////////////////
template <unsigned M_> struct ModInt {
  static constexpr unsigned M = M_;
  unsigned x;
  constexpr ModInt() : x(0U) {}
  constexpr ModInt(unsigned x_) : x(x_ % M) {}
  constexpr ModInt(unsigned long long x_) : x(x_ % M) {}
  constexpr ModInt(int x_) : x(((x_ %= static_cast<int>(M)) < 0) ? (x_ + static_cast<int>(M)) : x_) {}
  constexpr ModInt(long long x_) : x(((x_ %= static_cast<long long>(M)) < 0) ? (x_ + static_cast<long long>(M)) : x_) {}
  ModInt &operator+=(const ModInt &a) { x = ((x += a.x) >= M) ? (x - M) : x; return *this; }
  ModInt &operator-=(const ModInt &a) { x = ((x -= a.x) >= M) ? (x + M) : x; return *this; }
  ModInt &operator*=(const ModInt &a) { x = (static_cast<unsigned long long>(x) * a.x) % M; return *this; }
  ModInt &operator/=(const ModInt &a) { return (*this *= a.inv()); }
  ModInt pow(long long e) const {
    if (e < 0) return inv().pow(-e);
    ModInt a = *this, b = 1U; for (; e; e >>= 1) { if (e & 1) b *= a; a *= a; } return b;
  }
  ModInt inv() const {
    unsigned a = M, b = x; int y = 0, z = 1;
    for (; b; ) { const unsigned q = a / b; const unsigned c = a - q * b; a = b; b = c; const int w = y - static_cast<int>(q) * z; y = z; z = w; }
    assert(a == 1U); return ModInt(y);
  }
  ModInt operator+() const { return *this; }
  ModInt operator-() const { ModInt a; a.x = x ? (M - x) : 0U; return a; }
  ModInt operator+(const ModInt &a) const { return (ModInt(*this) += a); }
  ModInt operator-(const ModInt &a) const { return (ModInt(*this) -= a); }
  ModInt operator*(const ModInt &a) const { return (ModInt(*this) *= a); }
  ModInt operator/(const ModInt &a) const { return (ModInt(*this) /= a); }
  template <class T> friend ModInt operator+(T a, const ModInt &b) { return (ModInt(a) += b); }
  template <class T> friend ModInt operator-(T a, const ModInt &b) { return (ModInt(a) -= b); }
  template <class T> friend ModInt operator*(T a, const ModInt &b) { return (ModInt(a) *= b); }
  template <class T> friend ModInt operator/(T a, const ModInt &b) { return (ModInt(a) /= b); }
  explicit operator bool() const { return x; }
  bool operator==(const ModInt &a) const { return (x == a.x); }
  bool operator!=(const ModInt &a) const { return (x != a.x); }
  friend std::ostream &operator<<(std::ostream &os, const ModInt &a) { return os << a.x; }
};
////////////////////////////////////////////////////////////////////////////////

constexpr unsigned MO = 998244353;
using Mint = ModInt<MO>;


int M, N;
int A[310][310];

Mint smallM(int a) {
  vector<int> xs;
  for (int x = 0; x < M; ++x) if (A[x][0] == a) xs.push_back(x);
  // 0: banned
  vector<Mint> dp(1 << M, 0);
  dp[(1 << M) - 1] += 1;
  for (int y = 1; y <= N; ++y) {
    for (int h = 0; h < 1 << M; ++h) {
      int keep = 0;
      for (const int x : xs) if (h & 1 << x) {
        if (A[x][y] == a) {
          ++keep;
        } else {
          dp[h ^ 1 << x] += dp[h];
        }
      }
      dp[h] *= keep;
    }
  }
  Mint ans = 0;
  for (int h = 0; h < 1 << M; ++h) ans += dp[h];
  return ans;
}

Mint smallN(int a) {
  vector<int> xs;
  for (int x = 0; x < M; ++x) if (A[x][0] == a) xs.push_back(x);
  // 1: used
  vector<Mint> dp(1 << N, 0);
  dp[0] += 1;
  for (const int x : xs) {
    vector<Mint> nxt(1 << N, 0);
    for (int y = 1; y <= N; ++y) {
      if (A[x][y] == a) {
        for (int h = 0; h < 1 << N; ++h) if (!(h & 1 << (y-1))) {
          dp[h | 1 << (y-1)] += dp[h];
        }
      } else {
        for (int h = 0; h < 1 << N; ++h) if (!(h & 1 << (y-1))) {
          nxt[h | 1 << (y-1)] += dp[h];
        }
      }
    }
    for (int h = 0; h < 1 << N; ++h) dp[h] += nxt[h];
  }
  return dp.back();
}

int main() {
  for (; ~scanf("%d%d", &M, &N); ) {
    for (int x = 0; x < M; ++x) for (int y = 0; y < N; ++y) scanf("%d", &A[x][y]);
    for (int x = 0; x < M; ++x) A[x][N] = -1;
    
    Mint ans;
    if (M <= N) {
      for (int x = 0; x < M; ++x) ans = smallM(A[x][0]);
    } else {
      for (int x = 0; x < M; ++x) ans = smallN(A[x][0]);
    }
    printf("%u\n", ans.x);
  }
  return 0;
}
0