結果

問題 No.2020 Sum of Common Prefix Length
コンテスト
ユーザー heno239
提出日時 2022-07-22 22:40:03
言語 C++17
(gcc 13.3.0 + boost 1.89.0)
結果
AC  
実行時間 319 ms / 2,000 ms
コード長 7,666 bytes
記録
記録タグの例:
初AC ショートコード 純ショートコード 純主流ショートコード 最速実行時間
コンパイル時間 5,105 ms
コンパイル使用メモリ 165,876 KB
最終ジャッジ日時 2025-01-30 12:49:27
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 38
権限があれば一括ダウンロードができます

ソースコード

diff #
raw source code 

#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 };
//-----------------------------------------

//双対セグ木
//区間更新1点取得に使える
//verified with https://codeforces.com/contest/1555/problem/F

template<typename T>
struct SegT {
private:
	int n;
	vector<T> node;
	T e;
	function<T(T, T)> f;
public:
	SegT(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];
		}
	}
	SegT(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];
	}
};

const int mn = 1000000;
int nex[mn][26];
vector<int> G[mn];
int tmp = 0;
void solve() {
    int n; cin >> n;
	vector<string> s(n);
	rep(i, n)cin >> s[i];
	int q; cin >> q;
	vector<int> typ(q), x(q);
	vector<char> c(q);
	rep(i, q) {
		cin >> typ[i] >> x[i]; x[i]--;
		if (typ[i] == 1)cin >> c[i];
	}
	{
		vector<int> ntyp, nx;
		vector<char> nc;
		rep(i, n)rep(j, s[i].size()) {
			ntyp.push_back(1);
			nx.push_back(i);
			nc.push_back(s[i][j]);
		}
		rep(i, q) {
			ntyp.push_back(typ[i]);
			nx.push_back(x[i]);
			nc.push_back(c[i]);
		}
		swap(typ, ntyp);
		swap(x, nx);
		swap(c, nc);
		q = typ.size();
	}
	rep(i, mn)rep(j, 26)nex[i][j] = -1;
	tmp = 1;
	vector<int> cur(n);
	rep(i, q) {
		//cout << typ[i] << " " << x[i] << " " << c[i] << "\n";
		if (typ[i] == 1) {
			int id = x[i];
			int loc = cur[id];
			int z = c[i] - 'a';
			if (nex[loc][z] < 0) {
				G[loc].push_back(tmp);
				nex[loc][z] = tmp; tmp++;
			}
			cur[id] = nex[loc][z];
		}
	}
	int ttmp = 0;
	vector<int> trans(tmp);
	vector<int> ri(tmp);
	function<void(int)> dfs = [&](int id) {
		trans[id] = ttmp; ttmp++;
		for (int to : G[id])dfs(to);
		ri[id] = ttmp;
	};
	dfs(0);
	assert(tmp == ttmp);
	fill(all(cur), 0);
	auto f = [&](int a, int b) {return a + b; };
	SegT<int> st(tmp, 0, f);
	rep(i, q) {
		if (typ[i] == 1) {
			int id = x[i];
			int loc = cur[id];
			int z = c[i] - 'a';
			cur[id] = nex[loc][z];
			st.add(1, trans[cur[id]], ri[cur[id]]);
		}
		else {
			int loc = cur[x[i]];
			int ans = st.query(trans[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