結果

問題 No.2172 SEARCH in the Text Editor
コンテスト
ユーザー hos.lyric
提出日時 2022-12-25 20:29:33
言語 D
(dmd 2.109.1)
結果
AC  
実行時間 139 ms / 2,000 ms
コード長 4,821 bytes
コンパイル時間 1,486 ms
コンパイル使用メモリ 154,980 KB
実行使用メモリ 24,760 KB
最終ジャッジ日時 2024-06-22 17:08:53
合計ジャッジ時間 7,644 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 49
権限があれば一括ダウンロードができます

ソースコード

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; }
real readReal() { return readToken.to!real; }

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() {
  try {
    for (; ; ) {
      const N = readInt;
      const T = readToken;
      auto S = new string[N];
      auto J = new int[N];
      auto K = new int[N];
      J[] = -1;
      K[] = -1;
      foreach (i; 0 .. N) {
        S[i] = readToken;
        if (S[i] == "~") {
          J[i] = readInt - 1;
          K[i] = readInt - 1;
        }
      }
      
      const TLen = cast(int)(T.length);
      auto fail = new int[TLen + 1];
      {
        int y = fail[0] = -1;
        foreach (x; 0 .. TLen) {
          for (; ~y && T[y] != T[x]; y = fail[y]) {}
          fail[x + 1] = ++y;
        }
      }
      
      auto dp = new Mint[N];
      foreach (i; 0 .. N) {
        if (S[i] == "~") {
          int cnt;
          int y;
          foreach (s; S[J[i]][max(cast(int)($) - (TLen - 1), 0) .. $]) {
            for (; ~y && T[y] != s; y = fail[y]) {}
            if (++y == TLen) {
              y = fail[y];
            }
          }
          foreach (s; S[K[i]][0 .. min(TLen - 1, $)]) {
            for (; ~y && T[y] != s; y = fail[y]) {}
            if (++y == TLen) {
              ++cnt;
              y = fail[y];
            }
          }
          dp[i] = dp[J[i]] + cnt + dp[K[i]];
          S[i] = S[J[i]] ~ S[K[i]];
          if (S[i].length > 2 * TLen) {
            S[i] = S[i][0 .. TLen] ~ S[i][$ - TLen .. $];
          }
          
        } else {
          int cnt;
          int y;
          foreach (s; S[i]) {
            for (; ~y && T[y] != s; y = fail[y]) {}
            if (++y == TLen) {
              ++cnt;
              y = fail[y];
            }
          }
          dp[i] = cnt;
        }
      }
      writeln(dp[N - 1]);
    }
  } catch (EOFException e) {
  }
}
0