結果

問題 No.2172 SEARCH in the Text Editor
ユーザー snukesnuke
提出日時 2022-12-24 00:48:56
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 114 ms / 2,000 ms
コード長 6,800 bytes
コンパイル時間 2,706 ms
コンパイル使用メモリ 218,828 KB
実行使用メモリ 24,348 KB
最終ジャッジ日時 2024-11-18 07:12:41
合計ジャッジ時間 6,853 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 2 ms
6,816 KB
testcase_02 AC 2 ms
6,816 KB
testcase_03 AC 104 ms
23,552 KB
testcase_04 AC 106 ms
23,360 KB
testcase_05 AC 102 ms
24,348 KB
testcase_06 AC 24 ms
8,276 KB
testcase_07 AC 19 ms
8,916 KB
testcase_08 AC 21 ms
9,172 KB
testcase_09 AC 37 ms
13,408 KB
testcase_10 AC 37 ms
14,320 KB
testcase_11 AC 23 ms
8,296 KB
testcase_12 AC 25 ms
8,916 KB
testcase_13 AC 31 ms
14,276 KB
testcase_14 AC 43 ms
12,992 KB
testcase_15 AC 26 ms
8,152 KB
testcase_16 AC 27 ms
9,300 KB
testcase_17 AC 24 ms
9,808 KB
testcase_18 AC 43 ms
13,872 KB
testcase_19 AC 35 ms
13,296 KB
testcase_20 AC 21 ms
8,660 KB
testcase_21 AC 42 ms
13,092 KB
testcase_22 AC 52 ms
13,108 KB
testcase_23 AC 53 ms
14,200 KB
testcase_24 AC 54 ms
13,776 KB
testcase_25 AC 55 ms
13,028 KB
testcase_26 AC 106 ms
23,688 KB
testcase_27 AC 101 ms
23,720 KB
testcase_28 AC 40 ms
13,424 KB
testcase_29 AC 46 ms
14,348 KB
testcase_30 AC 48 ms
13,296 KB
testcase_31 AC 45 ms
13,092 KB
testcase_32 AC 47 ms
14,312 KB
testcase_33 AC 46 ms
12,944 KB
testcase_34 AC 50 ms
13,496 KB
testcase_35 AC 55 ms
14,304 KB
testcase_36 AC 54 ms
13,148 KB
testcase_37 AC 56 ms
13,368 KB
testcase_38 AC 114 ms
23,076 KB
testcase_39 AC 113 ms
24,188 KB
testcase_40 AC 41 ms
13,220 KB
testcase_41 AC 43 ms
13,132 KB
testcase_42 AC 44 ms
12,904 KB
testcase_43 AC 43 ms
13,856 KB
testcase_44 AC 44 ms
13,024 KB
testcase_45 AC 44 ms
13,764 KB
testcase_46 AC 30 ms
8,904 KB
testcase_47 AC 23 ms
8,532 KB
testcase_48 AC 25 ms
9,168 KB
testcase_49 AC 42 ms
13,120 KB
testcase_50 AC 37 ms
13,376 KB
testcase_51 AC 22 ms
8,788 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// from 0:15
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rep1(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < (t); ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define pob pop_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define newline puts("")
using namespace std;
template<typename T> using vc = vector<T>;
template<typename T> using vv = vc<vc<T>>;
template<typename T> using PQ = priority_queue<T,vc<T>,greater<T>>;
using uint = unsigned; using ull = unsigned long long;
using vi = vc<int>; using vvi = vv<int>; using vvvi = vv<vi>;
using ll = long long; using vl = vc<ll>; using vvl = vv<ll>; using vvvl = vv<vl>;
using P = pair<int,int>; using vp = vc<P>; using vvp = vv<P>;
int geti(){int x;scanf("%d",&x);return x;}
vi pm(int n, int s=0) { vi a(n); iota(rng(a),s); return a;}
template<typename T>istream& operator>>(istream&i,vc<T>&v){rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const T&v,const string& d=""){stringstream s;rep(i,sz(v))(i?s<<d:s)<<v[i];return s.str();}
template<typename T>ostream& operator<<(ostream&o,const vc<T>&v){if(sz(v))o<<join(v," ");return o;}
template<typename T1,typename T2>istream& operator>>(istream&i,pair<T1,T2>&v){return i>>v.fi>>v.se;}
template<typename T1,typename T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v){return o<<v.fi<<","<<v.se;}
template<typename T1,typename T2>void operator--(pair<T1,T2>&a,int){a.fi--;a.se--;}
template<typename T>void operator--(vc<T>&a,int){for(T&x:a)x--;}
template<typename T>void operator++(vc<T>&a,int){for(T&x:a)x++;}
template<typename T>void operator+=(vc<T>&a,T b){for(T&x:a)x+=b;}
template<typename T>void operator+=(vc<T>&a,const vc<T>&b){a.insert(a.end(),rng(b));}
template<typename T1,typename T2>bool mins(T1& x,const T2&y){if(x>y){x=y;return true;}else return false;}
template<typename T1,typename T2>bool maxs(T1& x,const T2&y){if(x<y){x=y;return true;}else return false;}
template<typename Tx, typename Ty>Tx dup(Tx x, Ty y){return (x+y-1)/y;}
template<typename T>ll suma(const vc<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
template<typename T>ll suma(const vv<T>&a){ll res(0);for(auto&&x:a)res+=suma(x);return res;}
template<typename T>void uni(T& a){sort(rng(a));a.erase(unique(rng(a)),a.end());}
template<typename T>void prepend(vc<T>&a,const T&x){a.insert(a.begin(),x);}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame { puts("-1"); return;}
#define yes { puts("Yes"); return;}
#define no { puts("No"); return;}
#define ret(x) { cout<<(x)<<endl; return;}
#define yn {puts("Yes");}else{puts("No");}
const int MX = 200005;

// KMP
struct KMP {
  string s; vi a;
  KMP(){}
  KMP(const string& _s):s(_s+'$'),a(sz(_s)+1,-1) {
    int i = 0, j = -1;
    while (i < sz(_s)) {
      while (~j && s[i] != s[j]) j = a[j]; //
      a[++i] = ++j;
      // if (i < sz(s) && s[i] == s[j]) a[i] = a[j]; // Knuth
    }
  }
  int operator[](int i) const { return a[i];}
  int operator()(int i, char c) const {
    while (~i && s[i] != c) i = a[i];
    return i+1;
  }
} kmp;
//

// Mod int
const uint mod = 998244353;
struct mint {
  uint x;
  mint(): x(0) {}
  mint(ll x):x((x%mod+mod)%mod) {}
  mint operator-() const { return mint(0) - *this;}
  mint operator~() const { return mint(1) / *this;}
  mint& operator+=(const mint& a) { if((x+=a.x)>=mod) x-=mod; return *this;}
  mint& operator-=(const mint& a) { if((x+=mod-a.x)>=mod) x-=mod; return *this;}
  mint& operator*=(const mint& a) { x=(ull)x*a.x%mod; return *this;}
  mint& operator/=(const mint& a) { x=(ull)x*a.pow(mod-2).x%mod; return *this;}
  mint operator+(const mint& a) const { return mint(*this) += a;}
  mint operator-(const mint& a) const { return mint(*this) -= a;}
  mint operator*(const mint& a) const { return mint(*this) *= a;}
  mint operator/(const mint& a) const { return mint(*this) /= a;}
  mint pow(ll t) const {
    mint res = 1; for (mint p=x;t;p*=p,t>>=1) if (t&1) res *= p; return res;
  }
  mint ppow(ll t) const { int p=mod-1; return pow((t%p+p)%p);}
  bool operator<(const mint& a) const { return x < a.x;}
  bool operator==(const mint& a) const { return x == a.x;}
  bool operator!=(const mint& a) const { return x != a.x;}
};
mint ex(mint x, ll t) { return x.pow(t);}
istream& operator>>(istream&i,mint&a) {i>>a.x;return i;}
//*
ostream& operator<<(ostream&o,const mint&a) {o<<a.x;return o;}
/*/
ostream& operator<<(ostream&o, const mint&x) {
  int a = x.x, b = 1;
  rep(s,2)rep1(i,1000) {
    int y = ((s?-x:x)*i).x; if (abs(a)+b > y+i) a = s?-y:y, b = i;
  }
  o<<a; if (b != 1) o<<'/'<<b; return o;
}//*/
using vm = vector<mint>;
using vvm = vector<vm>;
struct modinv {
  int n; vm d;
  modinv(): n(2), d({0,1}) {}
  mint operator()(int i) { while (n <= i) d.pb(-d[mod%n]*(mod/n)), ++n; return d[i];}
  mint operator[](int i) const { return d[i];}
} invs;
struct modfact {
  int n; vm d;
  modfact(): n(2), d({1,1}) {}
  mint operator()(int i) { while (n <= i) d.pb(d.back()*n), ++n; return d[i];}
  mint operator[](int i) const { return d[i];}
} facs;
struct modfactinv {
  int n; vm d;
  modfactinv(): n(2), d({1,1}) {}
  mint operator()(int i) { while (n <= i) d.pb(d.back()*invs(n)), ++n; return d[i];}
  mint operator[](int i) const { return d[i];}
} ifacs;
mint comb(int a, int b) {
  if (a < b || b < 0) return 0;
  return facs(a)*ifacs(b)*ifacs(a-b);
}
//

int m;
struct D {
  mint x;
  string l, r;
  D(mint x=0):x(x) {}
  void setS(const string& nl, const string& nr) {
    l = nl.substr(0,m-1);
    r = nr.substr(max(0,sz(nr)-(m-1)));
  }
  D operator+(const D& a) const {
    D res(x+a.x);
    int i = 0;
    for (char c : r) i = kmp(i,c);
    for (char c : a.l) {
      i = kmp(i,c);
      if (i == m) res.x += 1;
    }
    res.setS(l+a.l, r+a.r);
    return res;
  }
};

struct Solver {
  void solve() {
    int n;
    scanf("%d",&n);
    string t;
    cin>>t;
    kmp = KMP(t);
    m = sz(t);

    vc<D> d;
    rep(ni,n) {
      string s;
      cin>>s;
      if (s == "~") {
        int j,k;
        scanf("%d%d",&j,&k);
        --j; --k;
        d.eb(d[j]+d[k]);
      } else {
        D a;
        {
          int i = 0;
          for (char c : s) {
            i = kmp(i,c);
            if (i == m) a.x += 1;
          }
        }
        a.setS(s,s);
        d.eb(a);
      }
    }
    mint ans = d.back().x;
    cout<<ans<<endl;
  }
};

int main() {
  // cin.tie(nullptr); ios::sync_with_stdio(false);
  int ts = 1;
  // scanf("%d",&ts);
  rep1(ti,ts) {
    Solver solver;
    solver.solve();
  }
  return 0;
}
0