結果

問題 No.3098 Linear Reversi
ユーザー 👑 hos.lyric
提出日時 2025-04-06 16:05:45
言語 D
(dmd 2.109.1)
結果
AC  
実行時間 100 ms / 4,000 ms
コード長 5,406 bytes
コンパイル時間 3,075 ms
コンパイル使用メモリ 136,448 KB
実行使用メモリ 6,272 KB
最終ジャッジ日時 2025-04-06 16:05:50
合計ジャッジ時間 5,056 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 37
権限があれば一括ダウンロードができます

ソースコード

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;



void main() {
  /*
  debug {{
    foreach (N; 1 .. 10 + 1) {
      auto can = new bool[1 << N];
      foreach (q; 0 .. 1 << N) {
        auto perm = iota(N).array;
        do {
          auto as = new int[N];
          as[] = -1;
          foreach (i; perm) {
            as[i] = q >> i & 1;
            foreach_reverse (j; 0 .. i) {
              if (!~as[j]) break;
              if (as[j] == as[i]) {
                as[j + 1 .. i] = as[i];
                break;
              }
            }
            foreach (j; i + 1 .. N) {
              if (!~as[j]) break;
              if (as[i] == as[j]) {
                as[i + 1 .. j] = as[i];
                break;
              }
            }
          }
          int h;
          foreach (i; 0 .. N) h |= as[i] << i;
          can[h] = true;
        } while (perm.nextPermutation);
      }
      stderr.writefln("N = %s: %s", N, can.count(true));
      foreach (h; 0 .. 1 << N) {
        string str, diff;
        foreach (i; 0 .. N) str ~= ".#"[h >> i & 1];
        foreach (i; 1 .. N) diff ~= "01"[(h >> (i-1) & 1) ^ (h >> i & 1)];
        if (can[h]) {
          writeln(str, " ", diff);
        }
        bool ok = true;
        ok = ok && !~diff.indexOf("111");
        ok = ok && !~diff.indexOf("11011");
        ok = ok && !~diff.indexOf("1101011");
        ok = ok && !~diff.indexOf("110101011");
        assert(can[h] == ok, format("%s: %s %s %s", str, diff, can[h], ok));
      }
    }
return;
  }}
  */
/*
N = 1: 2
N = 2: 4
N = 3: 8
N = 4: 14
N = 5: 26
N = 6: 46
N = 7: 84
N = 8: 150
N = 9: 272
*/
  
  enum OX = "ox";
  enum int[2][4] TRANS = [[0, 1], [0, 2], [3, -1], [0, 2]];
  
  try {
    for (; ; ) {
      const N = readInt;
      const S = readToken;
      
      Mint[4][2] crt;
      foreach (c; 0 .. 2) if (S[0] == '?' || S[0] == OX[c]) {
        crt[c][0] += 1;
      }
      foreach (i; 1 .. N) {
        Mint[4][2] nxt;
        foreach (c; 0 .. 2) if (S[i] == '?' || S[i] == OX[c]) {
          foreach (b; 0 .. 2) foreach (u; 0 .. 4) {
            const v = TRANS[u][b ^ c];
            if (~v) nxt[c][v] += crt[b][u];
          }
        }
        crt = nxt;
      }
      Mint ans;
      foreach (c; 0 .. 2) foreach (u; 0 .. 4) ans += crt[c][u];
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}
0