結果

問題 No.2172 SEARCH in the Text Editor
ユーザー siganaisiganai
提出日時 2022-12-24 23:35:38
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 7,624 bytes
コンパイル時間 2,800 ms
コンパイル使用メモリ 211,124 KB
実行使用メモリ 1,612,184 KB
最終ジャッジ日時 2024-11-18 06:16:51
合計ジャッジ時間 27,267 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
12,064 KB
testcase_01 AC 2 ms
501,836 KB
testcase_02 AC 2 ms
12,068 KB
testcase_03 AC 237 ms
22,400 KB
testcase_04 AC 230 ms
22,224 KB
testcase_05 AC 233 ms
22,368 KB
testcase_06 AC 18 ms
6,912 KB
testcase_07 AC 13 ms
6,820 KB
testcase_08 AC 14 ms
6,820 KB
testcase_09 WA -
testcase_10 WA -
testcase_11 TLE -
testcase_12 AC 43 ms
7,168 KB
testcase_13 AC 68 ms
8,064 KB
testcase_14 WA -
testcase_15 AC 239 ms
29,172 KB
testcase_16 AC 20 ms
7,552 KB
testcase_17 AC 18 ms
6,912 KB
testcase_18 AC 121 ms
16,720 KB
testcase_19 AC 24 ms
8,484 KB
testcase_20 AC 16 ms
6,696 KB
testcase_21 TLE -
testcase_22 AC 41 ms
9,932 KB
testcase_23 AC 41 ms
9,876 KB
testcase_24 AC 44 ms
9,960 KB
testcase_25 AC 45 ms
9,936 KB
testcase_26 AC 241 ms
22,388 KB
testcase_27 AC 234 ms
22,336 KB
testcase_28 AC 33 ms
9,840 KB
testcase_29 AC 34 ms
9,860 KB
testcase_30 AC 35 ms
10,036 KB
testcase_31 WA -
testcase_32 AC 30 ms
9,880 KB
testcase_33 AC 30 ms
9,824 KB
testcase_34 AC 35 ms
9,888 KB
testcase_35 AC 39 ms
9,968 KB
testcase_36 AC 41 ms
9,924 KB
testcase_37 AC 41 ms
10,020 KB
testcase_38 AC 231 ms
22,332 KB
testcase_39 AC 234 ms
22,340 KB
testcase_40 AC 31 ms
9,872 KB
testcase_41 AC 32 ms
9,868 KB
testcase_42 AC 35 ms
10,060 KB
testcase_43 AC 36 ms
10,104 KB
testcase_44 AC 31 ms
9,936 KB
testcase_45 AC 31 ms
9,896 KB
testcase_46 MLE -
testcase_47 MLE -
testcase_48 TLE -
testcase_49 TLE -
testcase_50 MLE -
testcase_51 MLE -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#line 1 "test.cpp"
//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <debug.hpp>
#define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#define debug(...) (static_cast<void>(0))
#endif
using ll = long long;
using ld = long double;
using pll = pair<ll,ll>;
using pii = pair<int,int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vpii = vector<pii>;
using vpll = vector<pll>;
using vs = vector<string>;
template<class T> using pq = priority_queue<T,vector<T>,greater<T>>;
#define overload4(_1, _2, _3, _4, name, ...) name
#define overload3(a,b,c,name,...) name
#define rep1(n) for (ll UNUSED_NUMBER = 0; UNUSED_NUMBER < (n); ++UNUSED_NUMBER)
#define rep2(i, n) for (ll i = 0; i < (n); ++i)
#define rep3(i, a, b) for (ll i = (a); i < (b); ++i)
#define rep4(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep1(n) for(ll i = (n) - 1;i >= 0;i--)
#define rrep2(i,n) for(ll i = (n) - 1;i >= 0;i--)
#define rrep3(i,a,b) for(ll i = (b) - 1;i >= (a);i--)
#define rrep4(i,a,b,c) for(ll i = (a) + ((b)-(a)-1) / (c) * (c);i >= (a);i -= c)
#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)
#define all1(i) begin(i),end(i)
#define all2(i,a) begin(i),begin(i)+a
#define all3(i,a,b) begin(i)+a,begin(i)+b
#define all(...) overload3(__VA_ARGS__, all3, all2, all1)(__VA_ARGS__)
#define sum(...) accumulate(all(__VA_ARGS__),0LL)
template<class T> bool chmin(T &a, const T &b){ if(a > b){ a = b; return 1; } else return 0; }
template<class T> bool chmax(T &a, const T &b){ if(a < b){ a = b; return 1; } else return 0; }
template<class T> auto min(const T& a){ return *min_element(all(a)); }
template<class T> auto max(const T& a){ return *max_element(all(a)); }
template<class... Ts> void in(Ts&... t);
#define INT(...) int __VA_ARGS__; in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__; in(__VA_ARGS__)
#define STR(...) string __VA_ARGS__; in(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__; in(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__; in(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__; in(__VA_ARGS__)
#define VEC(type, name, size) vector<type> name(size); in(name)
#define VV(type, name, h, w) vector<vector<type>> name(h, vector<type>(w)); in(name)
ll intpow(ll a, ll b){ ll ans = 1; while(b){if(b & 1) ans *= a; a *= a; b /= 2;} return ans;}
ll modpow(ll a, ll b, ll p){ ll ans = 1; a %= p;while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
ll GCD(ll a,ll b) { if(a == 0 || b == 0) return a + b; if(a % b == 0) return b; else return GCD(b,a%b);}
ll LCM(ll a,ll b) { if(a == 0) return b; if(b == 0) return a;return a / GCD(a,b) * b;}
namespace IO{
#define VOID(a) decltype(void(a))
struct setting{ setting(){cin.tie(nullptr); ios::sync_with_stdio(false);fixed(cout); cout.precision(12);}} setting;
template<int I> struct P : P<I-1>{};
template<> struct P<0>{};
template<class T> void i(T& t){ i(t, P<3>{}); }
void i(vector<bool>::reference t, P<3>){ int a; i(a); t = a; }
template<class T> auto i(T& t, P<2>) -> VOID(cin >> t){ cin >> t; }
template<class T> auto i(T& t, P<1>) -> VOID(begin(t)){ for(auto&& x : t) i(x); }
template<class T, size_t... idx> void ituple(T& t, index_sequence<idx...>){
    in(get<idx>(t)...);}
template<class T> auto i(T& t, P<0>) -> VOID(tuple_size<T>{}){
    ituple(t, make_index_sequence<tuple_size<T>::value>{});}
#undef VOID
}
#define unpack(a) (void)initializer_list<int>{(a, 0)...}
template<class... Ts> void in(Ts&... t){ unpack(IO :: i(t)); }
#undef unpack
//constexpr int mod = 1000000007;
constexpr int mod = 998244353;
static const double PI = 3.1415926535897932;
template <class F> struct REC {
    F f;
    REC(F &&f_) : f(forward<F>(f_)) {}
    template <class... Args> auto operator()(Args &&...args) const { return f(*this, forward<Args>(args)...); }};

#line 2 "library/modint/Modint.hpp"
template <int mod>
struct Modint{
    int x;
    Modint():x(0) {}
    Modint(long long y): x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
    Modint &operator += (const Modint &p) {
        if((x += p.x) >= mod) x -= mod;
        return *this;}
    Modint &operator -= (const Modint &p) {
        if ((x += mod - p.x) >= mod) x -= mod;
        return *this;}
    Modint &operator *= (const Modint &p) {
        x = (int)(1LL * x * p.x % mod);
        return *this;}
    Modint &operator /= (const Modint &p) {
        *this *= p.inverse();
        return *this;}
    Modint operator -() const{return Modint(-x);}
    Modint operator +(const Modint &p) const {return Modint(*this) += p;}
    Modint operator -(const Modint &p) const {return Modint(*this) -= p;}
    Modint operator *(const Modint &p) const {return Modint(*this) *= p;}
    Modint operator /(const Modint &p) const {return Modint(*this) /= p;}
    Modint &operator ++() {if(x == mod - 1) x = 0; else x++; return *this;}
    Modint &operator --() {if(x == 0) x = mod - 1; else x--; return *this;} 
    bool operator == (const Modint &p) const {return x == p.x;}
    bool operator != (const Modint &p) const {return x != p.x;}
    Modint inverse() const {
        int a = x, b = mod, u = 1, v = 0, t;
        while (b > 0) {
            t = a / b;
            swap(a -= t * b, b);
            swap(u -= t * v, v);
        }
        return Modint(u);}
    Modint pow(long long n) const {
        Modint ret(1), mul(x);
        while (n > 0) {
            if (n & 1) ret *= mul;
            mul *= mul;
            n >>= 1;
        }
        return ret;}
    friend ostream &operator<<(ostream &os, const Modint &p) { return os << p.x; }
    friend istream &operator>>(istream &is, Modint &a) {
        long long t;
        is >> t;
        a = Modint<mod>(t);
        return (is);
    }
    static constexpr int get_mod() {return mod;}
};
#line 87 "test.cpp"
using mint = Modint<mod>;
using vm = vector<mint>;
using vvm = vector<vm>;
using vvvm = vector<vvm>;

int main() {
    INT(n);
    STR(t);
    int m = t.size();
    vs L(n),R(n);
    vm cnt(n);
    rep(i,n) {
        STR(s);
        if(s == "~") {
            INT(j,k);
            j--,k--;
            if((int)R[j].size() + (int)L[k].size() < m) {
                string tmp = R[j] + L[k];
                L[i] = tmp;
                R[i] = tmp;
                cnt[i] = cnt[j] + cnt[k];
            }
            else {
                cnt[i] = cnt[j] + cnt[k];
                if(L[j].size() < m - 1) {
                    string tl = L[j];
                    rep(x,m-1-(int)L[j].size()) tl += L[k];
                    L[i] = tl;
                }
                else L[i] = L[j];
                if(R[k].size() < m - 1) {
                    string tr = R[j].substr(R[j].size() - (m - 1 - (int)R[k].size()),m - 1 - (int)R[k].size());
                    tr += R[k];
                    R[i] = tr;
                }
                else R[i] = R[k];
                string tmp = R[j] + L[k];
                rep(x,(int)tmp.size() - m + 1) {
                    if(tmp.substr(x,m) == t) cnt[i] += 1;
                }
            }
        }
        else {
            rep(x,(int)s.size() - m + 1) {
                if(s.substr(x,m) == t) cnt[i] += 1;
            }
            L[i] = s.substr(0,min(m-1,(int)s.size()));
            reverse(all(s));
            R[i] = s.substr(0,min(m-1,(int)s.size()));
            reverse(all(R[i]));
        }
    }
    cout << cnt[n-1] << '\n';

}
0