結果

問題 No.3052 Increasing Sliding Window Minimum
ユーザー 👑 hos.lyric
提出日時 2025-05-30 09:28:55
言語 D
(dmd 2.109.1)
結果
AC  
実行時間 555 ms / 2,000 ms
コード長 4,664 bytes
コンパイル時間 1,862 ms
コンパイル使用メモリ 143,968 KB
実行使用メモリ 203,356 KB
最終ジャッジ日時 2025-05-30 09:29:04
合計ジャッジ時間 7,438 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 42
権限があれば一括ダウンロードができます

ソースコード

diff # 

import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }

string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }

struct ModInt(uint M_) {
  import std.conv : to;
  alias M = M_;
  uint x;
  this(ModInt a) { x = a.x; }
  this(uint x_) { x = x_ % M; }
  this(ulong x_) { x = cast(uint)(x_ % M); }
  this(int x_) { x = ((x_ %= cast(int)(M)) < 0) ? (x_ + cast(int)(M)) : x_; }
  this(long x_) { x = cast(uint)(((x_ %= cast(long)(M)) < 0) ? (x_ + cast(long)(M)) : x_); }
  ref ModInt opAssign(T)(inout(T) a) if (is(T == uint) || is(T == ulong) || is(T == int) || is(T == long)) { return this = ModInt(a); }
  ref ModInt opOpAssign(string op, T)(T a) {
    static if (is(T == ModInt)) {
      static if (op == "+") { x = ((x += a.x) >= M) ? (x - M) : x; }
      else static if (op == "-") { x = ((x -= a.x) >= M) ? (x + M) : x; }
      else static if (op == "*") { x = cast(uint)((cast(ulong)(x) * a.x) % M); }
      else static if (op == "/") { this *= a.inv(); }
      else static assert(false);
      return this;
    } else static if (op == "^^") {
      if (a < 0) return this = inv()^^(-a);
      ModInt b = this, c = 1U;
      for (long e = a; e; e >>= 1) { if (e & 1) c *= b; b *= b; }
      return this = c;
    } else {
      return mixin("this " ~ op ~ "= ModInt(a)");
    }
  }
  ModInt inv() const {
    uint a = M, b = x; int y = 0, z = 1;
    for (; b; ) { const q = a / b; const c = a - q * b; a = b; b = c; const w = y - cast(int)(q) * z; y = z; z = w; }
    assert(a == 1); return ModInt(y);
  }
  ModInt opUnary(string op)() const {
    static if (op == "+") { return this; }
    else static if (op == "-") { ModInt a; a.x = x ? (M - x) : 0U; return a; }
    else static assert(false);
  }
  ModInt opBinary(string op, T)(T a) const { return mixin("ModInt(this) " ~ op ~ "= a"); }
  ModInt opBinaryRight(string op, T)(T a) const { return mixin("ModInt(a) " ~ op ~ "= this"); }
  bool opCast(T: bool)() const { return (x != 0U); }
  string toString() const { return x.to!string; }
}

enum MO = 998244353;
alias Mint = ModInt!MO;


/*
  #: chosen as min
  sentinel: infty at the right end
  
  01234567
  .#.##.##
  
  0  2     5
  ^  ^     ^
  1->3->4->6->7
*/

void main() {
  try {
    for (; ; ) {
      const numCases = readInt;
      foreach (caseId; 0 .. numCases) {
        const N = readInt;
        auto A = new int[N];
        foreach (i; 0 .. N) {
          A[i] = readInt - 1;
        }
        
        auto used = new bool[N];
        foreach (i; 0 .. N) if (A[i] >= 0) used[A[i]] = true;
        auto lot = new int[N + 1];
        foreach_reverse (a; 0 .. N) lot[a] = (used[a] ? 0 : 1) + lot[a + 1];
        auto hatena = new int[N + 1];
        foreach_reverse (i; 0 .. N) hatena[i] = ((A[i] < 0) ? 1 : 0) + hatena[i + 1];
        
        // dp[i][a]: p[i, n), min = a
        auto dp = new Mint[][](N + 1, N + 1);
        auto dpSum = new Mint[][](N + 1, N + 1);
        dp[N][N] += 1;
        dpSum[N][] += Mint(1);
        foreach_reverse (i; 0 .. N) {
          foreach (a; 0 .. i + 1) {
            // p[i] = a
            if ((A[i] < 0 && !used[a]) || A[i] == a) {
              dp[i][a] += dpSum[i + 1][a + 1];
            }
            // p[i+1] = a
            if (i + 1 < N && ((A[i + 1] < 0 && !used[a]) || A[i + 1] == a)) {
              dp[i][a] += ((A[i] < 0) ? (lot[a + 1] - hatena[i + 2]) : (a < A[i]) ? 1 : 0) * dpSum[i + 2][a + 1];
            }
          }
          dpSum[i][] = dp[i][];
          foreach_reverse (a; 0 .. N) dpSum[i][a] += dpSum[i][a + 1];
        }
        writeln(dp[0][0]);
      }
    }
  } catch (EOFException e) {
  }
}
0