結果

問題 No.3052 Increasing Sliding Window Minimum
コンテスト
ユーザー emthrm
提出日時 2025-03-07 23:59:42
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 7,315 bytes
コンパイル時間 3,717 ms
コンパイル使用メモリ 288,428 KB
実行使用メモリ 101,248 KB
最終ジャッジ日時 2025-03-07 23:59:55
合計ジャッジ時間 7,834 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample WA * 1
other AC * 6 WA * 36
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
// constexpr int MOD = 1000000007;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

template <unsigned int M>
struct MInt {
  unsigned int v;

  constexpr MInt() : v(0) {}
  constexpr MInt(const long long x) : v(x >= 0 ? x % M : x % M + M) {}
  static constexpr MInt raw(const int x) {
    MInt x_;
    x_.v = x;
    return x_;
  }

  static constexpr int get_mod() { return M; }
  static constexpr void set_mod(const int divisor) {
    assert(std::cmp_equal(divisor, M));
  }

  static void init(const int x) {
    inv<true>(x);
    fact(x);
    fact_inv(x);
  }

  template <bool MEMOIZES = false>
  static MInt inv(const int n) {
    // assert(0 <= n && n < M && std::gcd(n, M) == 1);
    static std::vector<MInt> inverse{0, 1};
    const int prev = inverse.size();
    if (n < prev) return inverse[n];
    if constexpr (MEMOIZES) {
      // "n!" and "M" must be disjoint.
      inverse.resize(n + 1);
      for (int i = prev; i <= n; ++i) {
        inverse[i] = -inverse[M % i] * raw(M / i);
      }
      return inverse[n];
    }
    int u = 1, v = 0;
    for (unsigned int a = n, b = M; b;) {
      const unsigned int q = a / b;
      std::swap(a -= q * b, b);
      std::swap(u -= q * v, v);
    }
    return u;
  }

  static MInt fact(const int n) {
    static std::vector<MInt> factorial{1};
    if (const int prev = factorial.size(); n >= prev) {
      factorial.resize(n + 1);
      for (int i = prev; i <= n; ++i) {
        factorial[i] = factorial[i - 1] * i;
      }
    }
    return factorial[n];
  }

  static MInt fact_inv(const int n) {
    static std::vector<MInt> f_inv{1};
    if (const int prev = f_inv.size(); n >= prev) {
      f_inv.resize(n + 1);
      f_inv[n] = inv(fact(n).v);
      for (int i = n; i > prev; --i) {
        f_inv[i - 1] = f_inv[i] * i;
      }
    }
    return f_inv[n];
  }

  static MInt nCk(const int n, const int k) {
    if (n < 0 || n < k || k < 0) [[unlikely]] return MInt();
    return fact(n) * (n - k < k ? fact_inv(k) * fact_inv(n - k) :
                                  fact_inv(n - k) * fact_inv(k));
  }
  static MInt nPk(const int n, const int k) {
    return n < 0 || n < k || k < 0 ? MInt() : fact(n) * fact_inv(n - k);
  }
  static MInt nHk(const int n, const int k) {
    return n < 0 || k < 0 ? MInt() : (k == 0 ? 1 : nCk(n + k - 1, k));
  }

  static MInt large_nCk(long long n, const int k) {
    if (n < 0 || n < k || k < 0) [[unlikely]] return MInt();
    inv<true>(k);
    MInt res = 1;
    for (int i = 1; i <= k; ++i) {
      res *= inv(i) * n--;
    }
    return res;
  }

  constexpr MInt pow(long long exponent) const {
    MInt res = 1, tmp = *this;
    for (; exponent > 0; exponent >>= 1) {
      if (exponent & 1) res *= tmp;
      tmp *= tmp;
    }
    return res;
  }

  constexpr MInt& operator+=(const MInt& x) {
    if ((v += x.v) >= M) v -= M;
    return *this;
  }
  constexpr MInt& operator-=(const MInt& x) {
    if ((v += M - x.v) >= M) v -= M;
    return *this;
  }
  constexpr MInt& operator*=(const MInt& x) {
    v = (unsigned long long){v} * x.v % M;
    return *this;
  }
  MInt& operator/=(const MInt& x) { return *this *= inv(x.v); }

  constexpr auto operator<=>(const MInt& x) const = default;

  constexpr MInt& operator++() {
    if (++v == M) [[unlikely]] v = 0;
    return *this;
  }
  constexpr MInt operator++(int) {
    const MInt res = *this;
    ++*this;
    return res;
  }
  constexpr MInt& operator--() {
    v = (v == 0 ? M - 1 : v - 1);
    return *this;
  }
  constexpr MInt operator--(int) {
    const MInt res = *this;
    --*this;
    return res;
  }

  constexpr MInt operator+() const { return *this; }
  constexpr MInt operator-() const { return raw(v ? M - v : 0); }

  constexpr MInt operator+(const MInt& x) const { return MInt(*this) += x; }
  constexpr MInt operator-(const MInt& x) const { return MInt(*this) -= x; }
  constexpr MInt operator*(const MInt& x) const { return MInt(*this) *= x; }
  MInt operator/(const MInt& x) const { return MInt(*this) /= x; }

  friend std::ostream& operator<<(std::ostream& os, const MInt& x) {
    return os << x.v;
  }
  friend std::istream& operator>>(std::istream& is, MInt& x) {
    long long v;
    is >> v;
    x = MInt(v);
    return is;
  }
};
using ModInt = MInt<MOD>;

ModInt solve(const vector<int>& a) {
  const int n = a.size();
  vector<int> is_filled(n, -1);
  REP(i, n) {
    if (a[i] != -1) is_filled[a[i]] = i;
  }
  vector dp(n, vector(n, ModInt()));
  if (is_filled[0] == -1) {
    if (a.front() == -1) ++dp[0][0];
    if (a[1] == -1) ++dp[1][0];
  } else if (is_filled[0] == 0) {
    ++dp[0][0];
  } else if (is_filled[0] == 1) {
    ++dp[1][0];
  }
  FOR(i, 1, n) {
    // i-1 -> i
    {
      int emp = 0;
      REP(x, i - 1) {
        if (a[x] == -1) ++emp;
      }
      ModInt sum = 0;
      FOR(j, 1, n) {
        if (is_filled[j - 1] == -1) {
          sum *= emp--;
        } else if (is_filled[j - 1] <= i) {
          // noop
        } else {
          break;
        }
        sum += dp[i - 1][j - 1];
        if ((is_filled[j] != -1 && a[i] == j) || (is_filled[j] == -1 && a[i] == -1)) dp[i][j] += sum;
      }
    }
    // i-2 -> i
    if (i >= 2) {
      int emp = 0;
      REP(x, i - 2) {
        if (a[x] == -1) ++emp;
      }
      ModInt sum = 0;
      FOR(j, 1, n) {
        if (is_filled[j - 1] == -1) {
          sum *= emp--;
        } else if (is_filled[j - 1] < i - 2) {
          // noop
        } else {
          break;
        }
        sum += dp[i - 2][j - 1];
        if ((is_filled[j] != -1 && a[i] == j) || (is_filled[j] == -1 && a[i] == -1)) dp[i][j] += sum;
      }
    }
  }
  // REP(i, n) REP(j, n) cout << dp[i][j] << " \n"[j + 1 == n];
  ModInt ans = 0;
  int fixed = 0;
  for (int j = n - 1; j >= 0; --j) {
    ans += dp.back()[j] * ModInt::fact(n - 1 - j - fixed);
    if (is_filled[j] != -1) ++fixed;
  }
  return ans;
}

int naive(const vector<int>& a) {
  const int n = a.size();
  vector<int> p(n);
  iota(p.begin(), p.end(), 0);
  int ans = 0;
  do {
    bool is_valid = true;
    REP(i, n) is_valid &= a[i] == -1 || a[i] == p[i];
    if (!is_valid) continue;
    FOR(i, 2, n) is_valid &= min(p[i - 2], p[i - 1]) <= min(p[i - 1], p[i]);
    if (is_valid) ++ans;
  } while (ranges::next_permutation(p).found);
  return ans;
}

int main() {
  int t; cin >> t;
  while (t--) {
    int n; cin >> n;
    vector<int> a(n);
    for (int& a_i : a) {
      cin >> a_i;
      if (a_i != -1) --a_i;
    }
    // assert(solve(a) == naive(a));
    // cout << solve(a) << ' ' << naive(a) << '\n';
    cout << solve(a) << '\n';
  }
  return 0;
}
0