結果

問題 No.2020 Sum of Common Prefix Length
ユーザー heno239heno239
提出日時 2022-07-22 22:18:40
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 12,475 bytes
コンパイル時間 4,030 ms
コンパイル使用メモリ 195,408 KB
実行使用メモリ 35,708 KB
最終ジャッジ日時 2023-09-17 10:34:50
合計ジャッジ時間 24,590 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 WA -
testcase_01 AC 8 ms
11,584 KB
testcase_02 WA -
testcase_03 WA -
testcase_04 WA -
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 AC 78 ms
13,836 KB
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
testcase_26 AC 44 ms
13,444 KB
testcase_27 AC 8 ms
11,624 KB
testcase_28 WA -
testcase_29 WA -
testcase_30 WA -
testcase_31 AC 52 ms
13,908 KB
testcase_32 AC 47 ms
13,764 KB
testcase_33 WA -
testcase_34 WA -
testcase_35 WA -
testcase_36 WA -
testcase_37 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
#include<chrono>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 998244353;
//constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;

#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;

template<typename T>
void chmin(T& a, T b) {
	a = min(a, b);
}
template<typename T>
void chmax(T& a, T b) {
	a = max(a, b);
}
template<typename T>
void cinarray(vector<T>& v) {
	rep(i, v.size())cin >> v[i];
}
template<typename T>
void coutarray(vector<T>& v) {
	rep(i, v.size()) {
		if (i > 0)cout << " "; cout << v[i];
	}
	cout << "\n";
}
ll mod_pow(ll x, ll n, ll m = mod) {
	if (n < 0) {
		ll res = mod_pow(x, -n, m);
		return mod_pow(res, m - 2, m);
	}
	if (abs(x) >= m)x %= m;
	if (x < 0)x += m;
	//if (x == 0)return 0;
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
struct modint {
	int n;
	modint() :n(0) { ; }
	modint(ll m) {
		if (m < 0 || mod <= m) {
			m %= mod; if (m < 0)m += mod;
		}
		n = m;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
bool operator<(modint a, modint b) { return a.n < b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1 << 20;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}
modint combP(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[a - b];
}

ll gcd(ll a, ll b) {
	a = abs(a); b = abs(b);
	if (a < b)swap(a, b);
	while (b) {
		ll r = a % b; a = b; b = r;
	}
	return a;
}
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-10;
const ld pi = acosl(-1.0);
template<typename T>
void addv(vector<T>& v, int loc, T val) {
	if (loc >= v.size())v.resize(loc + 1, 0);
	v[loc] += val;
}
/*const int mn = 2000005;
bool isp[mn];
vector<int> ps;
void init() {
	fill(isp + 2, isp + mn, true);
	for (int i = 2; i < mn; i++) {
		if (!isp[i])continue;
		ps.push_back(i);
		for (int j = 2 * i; j < mn; j += i) {
			isp[j] = false;
		}
	}
}*/

//[,val)
template<typename T>
auto prev_itr(set<T>& st, T val) {
	auto res = st.lower_bound(val);
	if (res == st.begin())return st.end();
	res--; return res;
}

//[val,)
template<typename T>
auto next_itr(set<T>& st, T val) {
	auto res = st.lower_bound(val);
	return res;
}
using mP = pair<modint, modint>;
mP operator+(mP a, mP b) {
	return { a.first + b.first,a.second + b.second };
}
mP operator+=(mP& a, mP b) {
	a = a + b; return a;
}
mP operator-(mP a, mP b) {
	return { a.first - b.first,a.second - b.second };
}
mP operator-=(mP& a, mP b) {
	a = a - b; return a;
}

mt19937 mt(time(0));

const string drul = "DRUL";
string senw = "SENW";
//DRUL,or SENW
int dx[4] = { 1,0,-1,0 };
int dy[4] = { 0,1,0,-1 };
//-----------------------------------------

vector<int> prefix_array(vector<string> s) {
    int n = s.size();
    vector<int> res(n);
    rep(i, n)res[i] = i;
    auto comp = [&](int i, int j) {
        return s[i] < s[j];
    };
    sort(all(res), comp);
    return res;
}
vector<int> lcp_array(vector<string> s, vector<int> sa) {
    int n = s.size();
    vector<int> res(n-1);
    rep(i, n-1) {
        int id1 = sa[i], id2 = sa[i + 1];
        int sz = min(s[id1].size(), s[id2].size());
        rep(j, sz) {
            if (s[id1][j] == s[id2][j])res[i]++;
            else break;
        }
    }
    return res;
}
//双対セグ木
//区間更新1点取得に使える
//verified with https://codeforces.com/contest/1555/problem/F

template<typename T>
struct dSegT {
private:
    int n;
    vector<T> node;
    T e;
    function<T(T, T)> f;
public:
    dSegT(vector<T> ori, T _e, function<T(T, T)> _f) {
        int sz = ori.size();
        e = _e, f = _f;
        n = 1;
        while (n < sz)n <<= 1;
        node.resize(2 * n - 1, _e);
        rep(i, sz) {
            node[i + n - 1] = ori[i];
        }
    }
    dSegT(int sz, T _e, function<T(T, T)> _f) {
        e = _e, f = _f;
        n = 1;
        while (n < sz)n <<= 1;
        node.resize(2 * n - 1, _e);
    }
    void eval(int k, int l, int r) {
        if (node[k] == e || l + 1 == r)return;
        node[2 * k + 1] = f(node[k], node[2 * k + 1]);
        node[2 * k + 2] = f(node[k], node[2 * k + 2]);
        node[k] = e;
    }
    void add(T x, int a, int b, int k = 0, int l = 0, int r = -1) {
        if (r < 0)r = n;
        eval(k, l, r);
        if (r <= a || b <= l)return;
        if (a <= l && r <= b) {
            node[k] = f(x, node[k]);
            eval(k, l, r);
        }
        else {
            add(x, a, b, k * 2 + 1, l, (l + r) / 2);
            add(x, a, b, k * 2 + 2, (l + r) / 2, r);
        }
    }
    T query(int loc) {
        int k = 0, l = 0, r = n;
        while (r - l > 1) {
            eval(k, l, r);
            int m = (l + r) / 2;
            if (loc < m) {
                k = 2 * k + 1;
                r = m;
            }
            else {
                k = 2 * k + 2;
                l = m;
            }
        }
        return node[k];
    }
};


struct SegT {
private:
    int sz; vector<int> node;
    const int init_c = mod;
public:
    SegT(vector<int> v) {
        int n = v.size(); sz = 1;
        while (sz < n)sz *= 2;
        node.resize(2 * sz - 1, init_c);
        rep(i, n)node[i + sz - 1] = v[i];
        per(i, sz - 1) {
            node[i] = f(node[2 * i + 1], node[2 * i + 2]);
        }
    }
    int f(int a, int b) {
        return min(a, b);
    }
    int query(int a, int b, int k = 0, int l = 0, int r = -1) {
        if (r < 0)r = sz;
        if (r <= a || b <= l)return init_c;
        else if (a <= l && r <= b)return node[k];
        else {
            int vl = query(a, b, k * 2 + 1, l, (l + r) / 2);
            int vr = query(a, b, k * 2 + 2, (l + r) / 2, r);
            return f(vl, vr);
        }
    }
    void sear(int x, vector<int>& v, int a, int b, int k = 0, int l = 0, int r = -1) {
        if (r < 0)r = sz;
        if (r <= a || b <= l)return;
        else if (a <= l && r <= b) {
            if (node[k] != x)return;
            if (r == l + 1) {
                v.push_back(k - (sz - 1));
            }
            else {
                sear(x, v, a, b, k * 2 + 1, l, (l + r) / 2);
                sear(x, v, a, b, k * 2 + 2, (l + r) / 2, r);
            }
        }
        else {
            sear(x, v, a, b, k * 2 + 1, l, (l + r) / 2);
            sear(x, v, a, b, k * 2 + 2, (l + r) / 2, r);
        }
    }
    void update(int k, int a) {
        k += sz - 1;
        node[k] = a;
        while (k > 0) {
            k = (k - 1) / 2;
            node[k] = f(node[k * 2 + 1], node[k * 2 + 2]);
        }
    }
};
vector<ll> precalc(vector<string> s) {
	int n = s.size();
	vector<ll> res(n);
    vector<pair<string, int>> vp;
    vector<int> sa = prefix_array(s);
    vector<int> lcp = lcp_array(s, sa);
    //coutarray(lcp);
    SegT st(lcp);
    vector<ll> cnt(n + 1);
    //[l,r)
    function<void(int, int, int)> dfs = [&](int l, int r, int pre) {
        int len;
        if (l + 1 == r) {
            len = s[sa[l]].size();
        }
        else {
            len = st.query(l, r - 1);
        }
        ll val = (ll)(len - pre) * (r - l);
        cnt[l] += val;
        cnt[r] -= val;
        //cout << "?? " << l << " " << r << " " << val << "\n";
        if (l + 1 == r) {
            return;
        }
        int mi = st.query(l, r - 1);
        vector<int> nexs;
        st.sear(mi, nexs, l, r - 1);
        vector<P> memo;
        int le = l;
        rep(i, nexs.size()) {
            int to = nexs[i];
            dfs(le, to + 1, mi);
            P nex = { le,to + 1 };
            memo.push_back(nex);

            le = to + 1;
        }
        dfs(le, r, mi);
        P nex = { le,r };
        memo.push_back(nex);

    };
    dfs(0, n,0);
    rep(i, n)cnt[i + 1] += cnt[i];
    rep(i, n) {
        res[sa[i]] = cnt[i];
    }
    return res;
}
void solve() {
    int n; cin >> n;
    vector<string> s(n);
    rep(i, n)cin >> s[i];
    vector<ll> preans = precalc(s);
    vector<int> orisz(n);
    rep(i, n)orisz[i] = s[i].size();
    int q; cin >> q;
    vector<int> typ(q), x(q);
    vector<char> c(q);
    rep(i, q) {
        cin >> typ[i];
        if (typ[i] == 1) {
            cin >> x[i] >> c[i];
            x[i]--;
            s[x[i]].push_back(c[i]);
        }
        else {
            cin >> x[i]; x[i]--;
        }
    }
    vector<int> sa = prefix_array(s);
    vector<int> lcp = lcp_array(s, sa);
    rep(i, n - 1) {
        int id1 = sa[i];
        int id2 = sa[i + 1];
        int sz = min(orisz[id1], orisz[id2]);
        lcp[i] = 0;
        rep(j, sz) {
            if (s[id1][j] == s[id2][j])lcp[i]++;
            else break;
        }
    }
    vector<int> rev(n);
    rep(i, n)rev[sa[i]] = i;
    SegT st(lcp);
    auto f = [&](ll a, ll b) {
        return a + b;
    };
    vector<ll> ori(n);
    rep(i, n)ori[i] = preans[sa[i]];
    dSegT<ll> vs(ori, 0, f);
    //coutarray(preans);
    rep(i, q) {
        if (typ[i] == 1) {
            int len = orisz[x[i]];
            int loc = rev[x[i]];
            if (loc > 0) {
                int to = sa[loc - 1];
                if (lcp[loc - 1] == len) {
                    if (orisz[to] >= len && s[to][len] == c[i]) {
                        lcp[loc - 1]++;
                        st.update(loc - 1, lcp[loc - 1]);
                    }
                }
            }
            if (loc < n - 1) {
                int to = sa[loc + 1];
                if (lcp[loc] == len) {
                    if (orisz[to] >= len && s[to][len] == c[i]) {
                        lcp[loc]++;
                        st.update(loc, lcp[loc]);
                    }
                }
            }
            orisz[x[i]]++;
            int le = -1, ri = loc;
            while (ri - le > 1) {
                int m = (le + ri) / 2;
                if (st.query(m, loc) >= len) {
                    ri = m;
                }
                else {
                    le = m;
                }
            }
            int cl = ri;
            le = loc, ri = n;
            while (ri - le > 1) {
                int m = (le + ri) / 2;
                if (st.query(loc, m) >= len)le = m;
                else ri = m;
            }
            int cr = le;
            vs.add(1, cl, cr + 1);
        }
        else {
            int loc = rev[x[i]];
            ll ans = vs.query(loc);
            cout << ans << "\n";
        }
    }
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	//init_f();
	//init();
	//expr();
	//while(true)
	//int t; cin >> t; rep(i, t)
	solve();
	return 0;
}
0