結果

問題 No.2172 SEARCH in the Text Editor
ユーザー 👑 emthrmemthrm
提出日時 2022-12-24 00:22:46
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 7,242 bytes
コンパイル時間 2,837 ms
コンパイル使用メモリ 219,736 KB
実行使用メモリ 500,368 KB
最終ジャッジ日時 2024-11-18 07:06:29
合計ジャッジ時間 10,087 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 2 ms
6,820 KB
testcase_02 AC 2 ms
6,816 KB
testcase_03 AC 1,393 ms
500,368 KB
testcase_04 AC 165 ms
41,100 KB
testcase_05 AC 179 ms
50,296 KB
testcase_06 AC 31 ms
14,244 KB
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 AC 62 ms
14,336 KB
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 AC 47 ms
15,360 KB
testcase_16 AC 35 ms
16,004 KB
testcase_17 WA -
testcase_18 AC 73 ms
23,088 KB
testcase_19 AC 45 ms
19,276 KB
testcase_20 AC 27 ms
12,216 KB
testcase_21 AC 96 ms
20,372 KB
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
testcase_26 WA -
testcase_27 WA -
testcase_28 AC 74 ms
30,732 KB
testcase_29 WA -
testcase_30 AC 90 ms
32,516 KB
testcase_31 WA -
testcase_32 AC 142 ms
30,428 KB
testcase_33 AC 141 ms
31,400 KB
testcase_34 WA -
testcase_35 WA -
testcase_36 WA -
testcase_37 WA -
testcase_38 WA -
testcase_39 WA -
testcase_40 AC 69 ms
26,244 KB
testcase_41 AC 69 ms
26,188 KB
testcase_42 AC 70 ms
25,460 KB
testcase_43 AC 72 ms
25,436 KB
testcase_44 AC 117 ms
23,668 KB
testcase_45 AC 116 ms
23,604 KB
testcase_46 WA -
testcase_47 WA -
testcase_48 WA -
testcase_49 WA -
testcase_50 WA -
testcase_51 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#define _USE_MATH_DEFINES
#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)
#define ALL(v) (v).begin(),(v).end()
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 <int M>
struct MInt {
  unsigned int v;
  MInt() : v(0) {}
  MInt(const long long x) : v(x >= 0 ? x % M : x % M + M) {}
  static constexpr int get_mod() { return M; }
  static void set_mod(const int divisor) { assert(divisor == M); }
  static void init(const int x = 10000000) {
    inv(x, true);
    fact(x);
    fact_inv(x);
  }
  static MInt inv(const int n, const bool init = false) {
    // 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];
    } else if (init) {
      // "n!" and "M" must be disjoint.
      inverse.resize(n + 1);
      for (int i = prev; i <= n; ++i) {
        inverse[i] = -inverse[M % i] * (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};
    const int prev = factorial.size();
    if (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};
    const int prev = f_inv.size();
    if (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) return 0;
    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 ? 0 : fact(n) * fact_inv(n - k);
  }
  static MInt nHk(const int n, const int k) {
    return n < 0 || k < 0 ? 0 : (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) return 0;
    inv(k, true);
    MInt res = 1;
    for (int i = 1; i <= k; ++i) {
      res *= inv(i) * n--;
    }
    return res;
  }
  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;
  }
  MInt& operator+=(const MInt& x) {
    if (static_cast<int>(v += x.v) >= M) v -= M;
    return *this;
  }
  MInt& operator-=(const MInt& x) {
    if (static_cast<int>(v += M - x.v) >= M) v -= M;
    return *this;
  }
  MInt& operator*=(const MInt& x) {
    v = static_cast<unsigned long long>(v) * x.v % M;
    return *this;
  }
  MInt& operator/=(const MInt& x) { return *this *= inv(x.v); }
  bool operator==(const MInt& x) const { return v == x.v; }
  bool operator!=(const MInt& x) const { return v != x.v; }
  bool operator<(const MInt& x) const { return v < x.v; }
  bool operator<=(const MInt& x) const { return v <= x.v; }
  bool operator>(const MInt& x) const { return v > x.v; }
  bool operator>=(const MInt& x) const { return v >= x.v; }
  MInt& operator++() {
    if (static_cast<int>(++v) == M) v = 0;
    return *this;
  }
  MInt operator++(int) {
    const MInt res = *this;
    ++*this;
    return res;
  }
  MInt& operator--() {
    v = (v == 0 ? M - 1 : v - 1);
    return *this;
  }
  MInt operator--(int) {
    const MInt res = *this;
    --*this;
    return res;
  }
  MInt operator+() const { return *this; }
  MInt operator-() const { return MInt(v ? M - v : 0); }
  MInt operator+(const MInt& x) const { return MInt(*this) += x; }
  MInt operator-(const MInt& x) const { return MInt(*this) -= x; }
  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>;

template <typename T>
std::vector<int> z_algorithm(const T &s) {
  const int n = s.size();
  std::vector<int> res(n, 0);
  for (int i = 1, j = 0; i < n; ++i) {
    if (i + res[i - j] < j + res[j]) {
      res[i] = res[i - j];
    } else {
      res[i] = std::max(j + res[j] - i, 0);
      while (i + res[i] < n && s[i + res[i]] == s[res[i]]) ++res[i];
      j = i;
    }
  }
  res[0] = n;
  return res;
}

int main() {
  int n; string t; cin >> n >> t;
  const int l = t.length();
  vector<string> s(n);
  vector<int> j(n), k(n);
  REP(i, n) {
    cin >> s[i];
    if (s[i] == "~") cin >> j[i] >> k[i], --j[i], --k[i];
  }
  vector<string> frnt(n), bck(n);
  vector<set<int>> match_frnt(n), match_bck(n);
  REP(i, n) {
    if (s[i] == "~") {
      frnt[i] = frnt[j[i]] + frnt[k[i]];
      bck[i] = bck[j[i]] + bck[k[i]];
    } else {
      frnt[i] = bck[i] = s[i];
    }
    if (frnt[i].length() > l) frnt[i].resize(l);
    if (bck[i].length() > l) bck[i] = bck[i].substr(bck[i].length() - l);
  }
  REP(i, n) {
    const vector<int> z_frnt = z_algorithm(frnt[i] + '$' + t);
    const int frnt_len = frnt[i].length();
    FOR(j, max(l - frnt_len, 1), l) {
      if (z_frnt[frnt_len + 1 + j] == l - j) match_frnt[i].emplace(l - j);
    }
    // cout << i << ':';
    // for (const int e : match_frnt[i]) cout << ' ' << e;
    // cout << '\n';
  }
  reverse(ALL(t));
  REP(i, n) {
    reverse(ALL(bck[i]));
    const vector<int> z_bck = z_algorithm(bck[i] + '$' + t);
    const int bck_len = bck[i].length();
    FOR(j, max(l - bck_len, 1), l) {
      if (z_bck[bck_len + 1 + j] == l - j) match_bck[i].emplace(l - j);
    }
  }
  // REP(i, n) cout << frnt[i] << ' ' << bck[i] << '\n';
  reverse(ALL(t));
  vector<ModInt> dp(n, 0);
  REP(i, n) {
    if (s[i] == "~") {
      dp[i] = dp[j[i]] + dp[k[i]];
      for (const int f : match_frnt[j[i]]) {
        if (match_bck[k[i]].count(l - f)) ++dp[i];
      }
    } else {
      const vector<int> z = z_algorithm(t + '$' + s[i]);
      // REP(j, z.size()) cout << z[j] << " \n"[j + 1 == z.size()];
      FOR(j, l + 1, z.size()) {
        if (z[j] == l) ++dp[i];
      }
    }
  }
  cout << dp[n - 1] << '\n';
  return 0;
}
0