library
This documentation is automatically generated by online-judge-tools/verification-helper
string/enumerate_occurrences.hpp
- View this file on GitHub
- Last update: 2026-08-19 06:34:57+09:00
- Include:
#include "string/enumerate_occurrences.hpp"
Depends on
- ds/csr.hpp
ds/fastset.hpp
ds/hashmap.hpp
- graph/base.hpp
- graph/tree.hpp
- other/bit.hpp
- string/trie.hpp
Code
#include "graph/tree.hpp"
#include "string/trie.hpp"
#include "ds/fastset.hpp"
#include "ds/csr.hpp"
// T[i] distinct が必要
// T[i] が S に現れる位置を昇順列挙
// call f(i, vc<int>&pos)
// O(T + Slog^2S + Ssqrt(T))
template <typename STRING, int SIGMA = 26, int off = 'a', typename F>
void enumerate_occurrences(STRING S, vc<STRING> T, F f) {
Trie<SIGMA> trie;
FOR(i, len(T)) trie.add(T[i], off);
trie.calc_suffix_link();
int n = trie.n_node;
Graph<int, 1> G(n);
FOR(i, 1, n) G.add(trie.nodes[i].suffix_link, i);
G.build();
Tree<decltype(G)> tree(G);
vc<int> TID(n, -1);
FOR(i, len(T)) { TID[trie.words[i]] = i; }
CSR<int> csr(n);
{
int v = 0;
FOR(i, len(S)) {
v = trie.nodes[v].nxt[S[i] - off];
csr.add(v, i);
}
}
csr.build();
FastSet FS(len(S));
vc<int> nxt(len(S));
vc<int> pos;
auto dfs = [&](auto& dfs, int h) -> void {
auto path = tree.heavy_path_at(h);
for (auto& v : path) {
for (auto& e : G[v]) {
if (tree.head[e.to] != h) dfs(dfs, e.to);
}
}
FS.reset();
auto ins = [&](int i) -> void {
int a = FS.prev(i), b = FS.next(i);
if (a != -1) nxt[a] = i;
nxt[i] = b;
FS.insert(i);
};
auto ins_v = [&](int v) -> void {
for (int i : csr[v]) ins(i);
};
int prv = -1;
FOR_R(k, len(path)) {
int v = path[k];
ins_v(v);
int L = 0, R = 0;
if (prv != -1) L = tree.RID[prv], R = tree.RID[v];
FOR(i, L, R) ins_v(tree.V[i]);
prv = v;
int t = TID[v];
if (t != -1) {
int M = len(T[t]);
pos.clear();
for (int i = FS.next(0); i < len(S); i = nxt[i]) {
// [i-M+1,i]
pos.eb(i - M + 1);
}
f(t, pos);
}
}
};
dfs(dfs, 0);
}#line 1 "string/enumerate_occurrences.hpp"
#line 1 "graph/tree.hpp"
#line 1 "ds/hashmap.hpp"
// u64 -> Val
template <typename Val>
struct HashMap {
// n は入れたいものの個数で ok
HashMap(u32 n = 0) { build(n); }
void build(u32 n) {
u32 k = 8;
while (k < n * 2) k *= 2;
cap = k / 2, mask = k - 1;
key.resize(k), val.resize(k), used.assign(k, 0);
}
// size を保ったまま. size=0 にするときは build すること.
void clear() {
used.assign(len(used), 0);
cap = (mask + 1) / 2;
}
int size() { return len(used) / 2 - cap; }
int index(const u64& k) {
int i = 0;
for (i = hash(k); used[i] && key[i] != k; i = (i + 1) & mask) {}
return i;
}
Val& operator[](const u64& k) {
if (cap == 0) extend();
int i = index(k);
if (!used[i]) { used[i] = 1, key[i] = k, val[i] = Val{}, --cap; }
return val[i];
}
Val get(const u64& k, Val default_value) {
int i = index(k);
return (used[i] ? val[i] : default_value);
}
bool count(const u64& k) {
int i = index(k);
return used[i] && key[i] == k;
}
// f(key, val)
template <typename F>
void enumerate_all(F f) {
FOR(i, len(used)) if (used[i]) f(key[i], val[i]);
}
private:
u32 cap, mask;
vc<u64> key;
vc<Val> val;
vc<bool> used;
u64 hash(u64 x) {
static const u64 FIXED_RANDOM = std::chrono::steady_clock::now().time_since_epoch().count();
x += FIXED_RANDOM;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return (x ^ (x >> 31)) & mask;
}
void extend() {
vc<pair<u64, Val>> dat;
dat.reserve(len(used) / 2 - cap);
FOR(i, len(used)) {
if (used[i]) dat.eb(key[i], val[i]);
}
build(2 * len(dat));
for (auto& [a, b]: dat) (*this)[a] = b;
}
};
#line 2 "graph/base.hpp"
template <typename T>
struct Edge {
int frm, to;
T cost;
int id;
};
template <typename T = int, bool directed = false>
struct Graph {
static constexpr bool is_directed = directed;
int N, M;
using cost_type = T;
using edge_type = Edge<T>;
vector<edge_type> edges;
vector<int> indptr;
vector<edge_type> csr_edges;
vc<int> vc_deg, vc_indeg, vc_outdeg;
HashMap<int> MP_FOR_EID;
bool prepared;
class OutgoingEdges {
public:
OutgoingEdges(const Graph* G, int l, int r) : G(G), l(l), r(r) {}
const edge_type* begin() const {
if (l == r) {
return 0;
}
return &G->csr_edges[l];
}
const edge_type* end() const {
if (l == r) {
return 0;
}
return &G->csr_edges[r];
}
private:
const Graph* G;
int l, r;
};
bool is_prepared() { return prepared; }
Graph() : N(0), M(0), prepared(0) {}
Graph(int N) : N(N), M(0), prepared(0) {}
void build(int n) {
N = n, M = 0;
prepared = 0;
edges.clear();
indptr.clear();
csr_edges.clear();
vc_deg.clear();
vc_indeg.clear();
vc_outdeg.clear();
MP_FOR_EID.clear();
}
void add(int frm, int to, T cost = 1, int i = -1) {
assert(!prepared);
assert(0 <= frm && frm < N && 0 <= to && to < N);
if (i == -1) i = M;
auto e = edge_type({frm, to, cost, i});
edges.eb(e);
++M;
}
#ifdef FASTIO
// wt, off
void read_tree(bool wt = false, int off = 1) { read_graph(N - 1, wt, off); }
void read_graph(int M, bool wt = false, int off = 1) {
for (int m = 0; m < M; ++m) {
INT(a, b);
a -= off, b -= off;
if (!wt) {
add(a, b);
} else {
T c;
read(c);
add(a, b, c);
}
}
build();
}
#endif
void build() {
assert(!prepared);
prepared = true;
indptr.assign(N + 1, 0);
for (auto&& e : edges) {
indptr[e.frm + 1]++;
if (!directed) indptr[e.to + 1]++;
}
for (int v = 0; v < N; ++v) {
indptr[v + 1] += indptr[v];
}
auto counter = indptr;
csr_edges.resize(indptr.back() + 1);
for (auto&& e : edges) {
csr_edges[counter[e.frm]++] = e;
if (!directed)
csr_edges[counter[e.to]++] = edge_type({e.to, e.frm, e.cost, e.id});
}
}
OutgoingEdges operator[](int v) const {
assert(prepared);
return {this, indptr[v], indptr[v + 1]};
}
vc<int> deg_array() {
if (vc_deg.empty()) calc_deg();
return vc_deg;
}
pair<vc<int>, vc<int>> deg_array_inout() {
if (vc_indeg.empty()) calc_deg_inout();
return {vc_indeg, vc_outdeg};
}
int deg(int v) {
if (vc_deg.empty()) calc_deg();
return vc_deg[v];
}
int in_deg(int v) {
if (vc_indeg.empty()) calc_deg_inout();
return vc_indeg[v];
}
int out_deg(int v) {
if (vc_outdeg.empty()) calc_deg_inout();
return vc_outdeg[v];
}
#ifdef FASTIO
void debug() {
#ifdef LOCAL
print("Graph");
if (!prepared) {
print("frm to cost id");
for (auto&& e : edges) print(e.frm, e.to, e.cost, e.id);
} else {
print("indptr", indptr);
print("frm to cost id");
FOR(v, N) for (auto&& e : (*this)[v]) print(e.frm, e.to, e.cost, e.id);
}
flush();
#endif
}
#endif
vc<int> new_idx;
vc<bool> used_e;
// G における頂点 V[i] が、新しいグラフで i になるようにする
// {G, es}
// sum(deg(v)) の計算量になっていて、
// 新しいグラフの n+m より大きい可能性があるので注意
Graph<T, directed> rearrange(vc<int> V, bool keep_eid = 0) {
if (len(new_idx) != N) new_idx.assign(N, -1);
int n = len(V);
FOR(i, n) new_idx[V[i]] = i;
Graph<T, directed> G(n);
vc<int> history;
FOR(i, n) {
for (auto&& e : (*this)[V[i]]) {
if (len(used_e) <= e.id) used_e.resize(e.id + 1);
if (used_e[e.id]) continue;
int a = e.frm, b = e.to;
if (new_idx[a] != -1 && new_idx[b] != -1) {
history.eb(e.id);
used_e[e.id] = 1;
int eid = (keep_eid ? e.id : -1);
G.add(new_idx[a], new_idx[b], e.cost, eid);
}
}
}
FOR(i, n) new_idx[V[i]] = -1;
for (auto&& eid : history) used_e[eid] = 0;
G.build();
return G;
}
Graph<T, true> to_directed_tree(int root = -1) {
if (root == -1) root = 0;
assert(!is_directed && prepared && M == N - 1);
Graph<T, true> G1(N);
vc<int> par(N, -1);
auto dfs = [&](auto& dfs, int v) -> void {
for (auto& e : (*this)[v]) {
if (e.to == par[v]) continue;
par[e.to] = v, dfs(dfs, e.to);
}
};
dfs(dfs, root);
for (auto& e : edges) {
int a = e.frm, b = e.to;
if (par[a] == b) swap(a, b);
assert(par[b] == a);
G1.add(a, b, e.cost);
}
G1.build();
return G1;
}
int get_eid(u64 a, u64 b) {
if (len(MP_FOR_EID) == 0) {
MP_FOR_EID.build(N - 1);
for (auto& e : edges) {
u64 a = e.frm, b = e.to;
u64 k = to_eid_key(a, b);
MP_FOR_EID[k] = e.id;
}
}
return MP_FOR_EID.get(to_eid_key(a, b), -1);
}
u64 to_eid_key(u64 a, u64 b) {
if (!directed && a > b) swap(a, b);
return N * a + b;
}
private:
void calc_deg() {
assert(vc_deg.empty());
vc_deg.resize(N);
for (auto&& e : edges) vc_deg[e.frm]++, vc_deg[e.to]++;
}
void calc_deg_inout() {
assert(vc_indeg.empty());
vc_indeg.resize(N);
vc_outdeg.resize(N);
for (auto&& e : edges) {
vc_indeg[e.to]++, vc_outdeg[e.frm]++;
}
}
};
#line 3 "graph/tree.hpp"
// HLD euler tour をとっていろいろ
// HLD=false: 入力辺順で preorder
template <typename GT, bool HLD = true>
struct Tree {
using Graph_type = GT;
GT &G;
using WT = typename GT::cost_type;
int N;
vector<int> LID, RID, head, V, parent, VtoE;
vc<int> depth;
vc<WT> depth_weighted;
vc<int> memo_tail;
Tree(GT &G, int r = 0) : G(G) { build(r); }
void build(int r = 0) {
if (r == -1) return; // build を遅延したいとき
if constexpr (!HLD)
build_simple(r);
else
build_HLD(r);
}
vc<int> heavy_path_at(int v) {
static_assert(HLD);
assert(head[v] == v);
int k = LID[v];
vc<int> P;
while (k < N && head[V[k]] == v) P.eb(V[k++]);
return P;
}
int heavy_child(int v) {
static_assert(HLD);
if (RID[v] == LID[v] + 1) return -1;
return V[LID[v] + 1];
}
int tail(int v) {
static_assert(HLD);
if (memo_tail.empty()) {
memo_tail.assign(N, -1);
FOR_R(i, N) {
int v = V[i];
int w = heavy_child(v);
memo_tail[v] = (w == -1 ? v : memo_tail[w]);
}
}
return memo_tail[v];
}
int e_to_v(int eid) {
auto e = G.edges[eid];
return (parent[e.frm] == e.to ? e.frm : e.to);
}
int v_to_e(int v) { return VtoE[v]; }
int get_eid(int u, int v) {
if (parent[u] != v) swap(u, v);
assert(parent[u] == v);
return VtoE[u];
}
int ELID(int v) { return 2 * LID[v] - depth[v]; }
int ERID(int v) { return 2 * RID[v] - depth[v] - 1; }
// 目標地点へ進む個数が k
int LA(int v, int k) {
static_assert(HLD);
assert(k <= depth[v]);
while (1) {
int u = head[v];
if (LID[v] - k >= LID[u]) return V[LID[v] - k];
k -= LID[v] - LID[u] + 1;
v = parent[u];
}
}
int LCA(int u, int v) {
static_assert(HLD);
for (;; v = parent[head[v]]) {
if (LID[u] > LID[v]) swap(u, v);
if (head[u] == head[v]) return u;
}
}
int meet(int a, int b, int c) {
static_assert(HLD);
return LCA(a, b) ^ LCA(a, c) ^ LCA(b, c);
}
int subtree_size(int v) { return RID[v] - LID[v]; }
int subtree_size(int v, int root) {
static_assert(HLD);
if (v == root) return N;
int x = jump(v, root, 1);
if (in_subtree(v, x)) return RID[v] - LID[v];
return N - RID[x] + LID[x];
}
int dist(int a, int b) {
static_assert(HLD);
int c = LCA(a, b);
return depth[a] + depth[b] - 2 * depth[c];
}
WT dist_weighted(int a, int b) {
static_assert(HLD);
int c = LCA(a, b);
return depth_weighted[a] + depth_weighted[b] - WT(2) * depth_weighted[c];
}
// a is in b
bool in_subtree(int a, int b) { return LID[b] <= LID[a] && LID[a] < RID[b]; }
int jump(int a, int b, ll k) {
static_assert(HLD);
if (k == 1) {
if (a == b) return -1;
return (in_subtree(b, a) ? LA(b, depth[b] - depth[a] - 1) : parent[a]);
}
int c = LCA(a, b);
int d_ac = depth[a] - depth[c];
int d_bc = depth[b] - depth[c];
if (k > d_ac + d_bc) return -1;
if (k <= d_ac) return LA(a, k);
return LA(b, d_ac + d_bc - k);
}
vc<int> collect_child(int v) {
vc<int> res;
for (auto &&e : G[v])
if (e.to != parent[v]) res.eb(e.to);
return res;
}
vc<int> collect_subtree(int v) {
return {V.begin() + LID[v], V.begin() + RID[v]};
}
vc<int> collect_light(int v) {
static_assert(HLD);
vc<int> res;
for (auto &&e : G[v]) {
if (e.to != parent[v] && head[e.to] == e.to) res.eb(e.to);
}
return res;
}
vc<pair<int, int>> get_path_decomposition(int u, int v, bool edge) {
static_assert(HLD);
// [始点, 終点] の"閉"区間列。
vc<pair<int, int>> up, down;
while (1) {
if (head[u] == head[v]) break;
if (LID[u] < LID[v]) {
down.eb(LID[head[v]], LID[v]);
v = parent[head[v]];
} else {
up.eb(LID[u], LID[head[u]]);
u = parent[head[u]];
}
}
if (LID[u] < LID[v]) down.eb(LID[u] + edge, LID[v]);
elif (LID[v] + edge <= LID[u]) up.eb(LID[u], LID[v] + edge);
reverse(all(down));
up.insert(up.end(), all(down));
return up;
}
// 辺の列の情報 (frm,to,str)
// str = "heavy_up", "heavy_down", "light_up", "light_down"
vc<tuple<int, int, string>> get_path_decomposition_detail(int u, int v) {
static_assert(HLD);
vc<tuple<int, int, string>> up, down;
while (1) {
if (head[u] == head[v]) break;
if (LID[u] < LID[v]) {
if (v != head[v]) down.eb(head[v], v, "heavy_down"), v = head[v];
down.eb(parent[v], v, "light_down"), v = parent[v];
} else {
if (u != head[u]) up.eb(u, head[u], "heavy_up"), u = head[u];
up.eb(u, parent[u], "light_up"), u = parent[u];
}
}
if (LID[u] < LID[v]) down.eb(u, v, "heavy_down");
elif (LID[v] < LID[u]) up.eb(u, v, "heavy_up");
reverse(all(down));
concat(up, down);
return up;
}
vc<int> restore_path(int u, int v) {
vc<int> L, R;
while (depth[u] > depth[v]) L.eb(u), u = parent[u];
while (depth[u] < depth[v]) R.eb(v), v = parent[v];
while (u != v) L.eb(u), R.eb(v), u = parent[u], v = parent[v];
L.eb(u);
while (len(R)) L.eb(POP(R));
return L;
}
// path [a,b] と [c,d] の交わり. 空ならば {-1,-1}.
// https://codeforces.com/problemset/problem/500/G
pair<int, int> path_intersection(int a, int b, int c, int d) {
static_assert(HLD);
int ab = LCA(a, b), ac = LCA(a, c), ad = LCA(a, d);
int bc = LCA(b, c), bd = LCA(b, d), cd = LCA(c, d);
int x = ab ^ ac ^ bc, y = ab ^ ad ^ bd; // meet(a,b,c), meet(a,b,d)
if (x != y) return {x, y};
int z = ac ^ ad ^ cd;
if (x != z) x = -1;
return {x, x};
}
// uv path 上で check(v) を満たす最後の v
// なければ （つまり check(v) が ng ）-1
template <class F>
int max_path(F check, int u, int v) {
static_assert(HLD);
if (!check(u)) return -1;
auto pd = get_path_decomposition(u, v, false);
for (auto [a, b] : pd) {
if (!check(V[a])) return u;
if (check(V[b])) {
u = V[b];
continue;
}
int c =
binary_search([&](int c) -> bool { return check(V[c]); }, a, b, 0);
return V[c];
}
return u;
}
private:
void build_simple(int r = 0) {
N = G.N;
LID.assign(N, 0), RID.assign(N, 0);
V.assign(N, -1), parent.assign(N, -1), VtoE.assign(N, -1);
depth.assign(N, 0), depth_weighted.assign(N, 0);
assert(G.is_prepared());
// 1st dfs.
int k = 0;
vc<int> st;
st.reserve(N);
st.eb(r);
while (len(st)) {
int v = POP(st);
LID[v] = k, V[k] = v;
++k;
for (int i = G.indptr[v + 1] - 1; i >= G.indptr[v]; --i) {
auto &e = G.csr_edges[i];
if (e.to == parent[v]) continue;
parent[e.to] = v;
depth[e.to] = depth[v] + 1;
depth_weighted[e.to] = depth_weighted[v] + e.cost;
VtoE[e.to] = e.id;
st.eb(e.to);
}
}
FOR_R(i, N) {
int v = V[i];
chmax(RID[v], LID[v] + 1);
if (parent[v] != -1) chmax(RID[parent[v]], RID[v]);
}
}
void build_HLD(int r = 0) {
N = G.N;
LID.assign(N, 0), RID.assign(N, 0), head.assign(N, r);
V.assign(N, -1), parent.assign(N, -1), VtoE.assign(N, -1);
depth.assign(N, 0), depth_weighted.assign(N, 0);
memo_tail.clear();
assert(G.is_prepared());
// 1st dfs.
{
int k = 0;
vc<int> st;
st.reserve(N);
st.eb(r);
while (len(st)) {
int v = POP(st);
V[k++] = v;
for (auto &e : G[v]) {
if (e.to == parent[v]) continue;
parent[e.to] = v, st.eb(e.to), depth[e.to] = depth[v] + 1;
depth_weighted[e.to] = depth_weighted[v] + e.cost;
VtoE[e.to] = e.id;
}
}
// 一時的に RID[v] := sz[v]
FOR_R(i, N) {
int v = V[i];
RID[v] += 1;
if (parent[v] != -1) RID[parent[v]] += RID[v];
}
}
// 2nd dfs.
{
int k = 0;
vc<int> st;
st.reserve(N);
st.eb(r);
while (len(st)) {
int v = POP(st);
V[k] = v, LID[v] = k;
RID[v] = k + RID[v];
++k;
int max_sz = 0, max_ch = -1;
for (auto &e : G[v]) {
if (e.to == parent[v]) continue;
if (chmax(max_sz, RID[e.to])) max_ch = e.to;
}
for (int i = G.indptr[v + 1] - 1; i >= G.indptr[v]; --i) {
auto &e = G.csr_edges[i];
if (e.to == parent[v] || e.to == max_ch) continue;
st.eb(e.to), head[e.to] = e.to;
}
if (max_ch != -1) st.eb(max_ch), head[max_ch] = head[v];
}
}
}
};
#line 1 "string/trie.hpp"
// sigma が小さい
// 一般の n 頂点の木構造で O(n) 時間で動く
// https://atcoder.jp/contests/xmascontest2015noon/tasks/xmascontest2015_d
template <int sigma>
struct Trie {
struct Node {
array<int, sigma> ch;
array<int, sigma> nxt; // suffix link -> add c
int parent;
int suffix_link;
};
int n_node;
vc<Node> nodes;
vc<int> words;
vc<int> BFS; // BFS 順
Trie() {
n_node = 0;
new_node();
}
Node& operator[](int i) { return nodes[i]; }
template <typename STRING>
int add(STRING S, int off) {
int v = 0;
for (auto&& s: S) { v = add_single(v, s, off); }
words.eb(v);
return v;
}
int add_single(int v, int c, int off) {
c -= off;
assert(0 <= c && c < sigma);
if (nodes[v].ch[c] != -1) return nodes[v].ch[c];
nodes[v].ch[c] = new_node();
nodes.back().parent = v;
return nodes[v].ch[c];
}
void calc_suffix_link() {
BFS.resize(n_node);
int p = 0, q = 0;
BFS[q++] = 0;
fill(all(nodes[0].nxt), 0);
while (p < q) {
int v = BFS[p++];
if (v) nodes[v].nxt = nodes[nodes[v].suffix_link].nxt;
FOR(s, sigma) {
int w = nodes[v].ch[s];
if (w == -1) continue;
nodes[w].suffix_link = nodes[v].nxt[s];
nodes[v].nxt[s] = w;
BFS[q++] = w;
}
}
}
vc<int> calc_count() {
vc<int> count(n_node);
for (auto&& x: words) count[x]++;
for (auto&& v: BFS)
if (v) { count[v] += count[nodes[v].suffix_link]; }
return count;
}
private:
int new_node() {
Node c;
fill(all(c.ch), -1);
fill(all(c.nxt), -1);
c.parent = -1;
c.suffix_link = -1;
nodes.eb(c);
return n_node++;
}
};
#line 1 "other/bit.hpp"
int popcnt(int x) { return __builtin_popcount(x); }
int popcnt(u32 x) { return __builtin_popcount(x); }
int popcnt(ll x) { return __builtin_popcountll(x); }
int popcnt(u64 x) { return __builtin_popcountll(x); }
int popcnt_sgn(int x) { return (__builtin_parity(unsigned(x)) & 1 ? -1 : 1); }
int popcnt_sgn(u32 x) { return (__builtin_parity(x) & 1 ? -1 : 1); }
int popcnt_sgn(ll x) { return (__builtin_parityll(x) & 1 ? -1 : 1); }
int popcnt_sgn(u64 x) { return (__builtin_parityll(x) & 1 ? -1 : 1); }
// (0, 1, 2, 3, 4) -> (-1, 0, 1, 1, 2)
int topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }
int topbit(u32 x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }
int topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }
int topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }
// (0, 1, 2, 3, 4) -> (-1, 0, 1, 0, 2)
int lowbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); }
int lowbit(u32 x) { return (x == 0 ? -1 : __builtin_ctz(x)); }
int lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }
int lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }
template <typename T>
T kth_bit(int k) {
return T(1) << k;
}
template <typename T>
bool has_kth_bit(T x, int k) {
return x >> k & 1;
}
template <typename UINT>
struct all_bit {
UINT s;
all_bit(UINT s) : s(s) {}
struct iter {
UINT s;
int operator*() const { return lowbit(s); }
void operator++() { s &= s - 1; }
bool operator!=(nullptr_t) const { return s; }
};
iter begin() const { return {s}; }
nullptr_t end() const { return nullptr; }
};
template <typename UINT>
struct all_subset {
UINT s;
all_subset(UINT s) : s(s) {}
struct iter {
UINT s, t;
bool done = false;
UINT operator*() const { return t; }
void operator++() {
done = (t == 0);
t = (t - 1) & s;
}
bool operator!=(nullptr_t) const { return !done; }
};
iter begin() const { return {s, s}; }
nullptr_t end() const { return nullptr; }
};
constexpr u64 full_mask(int n) { return n == 64 ? -1ULL : (1ULL << n) - 1; }
u64 bit_reverse(u64 x) {
x = ((x & 0x5555555555555555ULL) << 1) | ((x >> 1) & 0x5555555555555555ULL);
x = ((x & 0x3333333333333333ULL) << 2) | ((x >> 2) & 0x3333333333333333ULL);
x = ((x & 0x0f0f0f0f0f0f0f0fULL) << 4) | ((x >> 4) & 0x0f0f0f0f0f0f0f0fULL);
x = ((x & 0x00ff00ff00ff00ffULL) << 8) | ((x >> 8) & 0x00ff00ff00ff00ffULL);
x = ((x & 0x0000ffff0000ffffULL) << 16) | ((x >> 16) & 0x0000ffff0000ffffULL);
x = (x << 32) | (x >> 32);
return x;
}
#line 2 "ds/fastset.hpp"
// 64-ary tree
// space: (N/63) * u64
struct FastSet {
static constexpr u32 B = 64;
int n = 0, log = 0;
vvc<u64> seg;
FastSet() {}
FastSet(int n) { build(n); }
int size() { return n; }
void fill_one() {
int cur = n;
for (auto& vs : seg) {
int p = cur / B, q = cur % B;
FOR(i, p) vs[i] = -1ull;
if (q) vs[p] = full_mask(q);
cur = (cur + B - 1) / B;
}
}
template <typename F>
FastSet(int n, F f) {
build(n, f);
}
void build(int m) {
seg.clear();
n = m;
do {
seg.push_back(vc<u64>((m + B - 1) / B));
m = (m + B - 1) / B;
} while (m > 1);
log = len(seg);
}
template <typename F>
void build(int n, F f) {
build(n);
FOR(i, n) { seg[0][i / B] |= u64(f(i)) << (i % B); }
FOR(h, log - 1) {
FOR(i, len(seg[h])) {
seg[h + 1][i / B] |= u64(bool(seg[h][i])) << (i % B);
}
}
}
bool operator[](int i) const { return seg[0][i / B] >> (i % B) & 1; }
void insert(int i) {
assert(0 <= i && i < n);
for (int h = 0; h < log; h++) {
seg[h][i / B] |= u64(1) << (i % B), i /= B;
}
}
void add(int i) { insert(i); }
void erase(int i) {
assert(0 <= i && i < n);
u64 x = 0;
for (int h = 0; h < log; h++) {
seg[h][i / B] &= ~(u64(1) << (i % B));
seg[h][i / B] |= x << (i % B);
x = bool(seg[h][i / B]);
i /= B;
}
}
void remove(int i) { erase(i); }
// min[x,n) or n
int next(int i) {
assert(i <= n);
chmax(i, 0);
for (int h = 0; h < log; h++) {
if (i / B == seg[h].size()) break;
u64 d = seg[h][i / B] >> (i % B);
if (!d) {
i = i / B + 1;
continue;
}
i += lowbit(d);
for (int g = h - 1; g >= 0; g--) {
i *= B;
i += lowbit(seg[g][i / B]);
}
return i;
}
return n;
}
// max [0,x], or -1
int prev(int i) {
assert(i >= -1);
if (i >= n) i = n - 1;
for (int h = 0; h < log; h++) {
if (i == -1) break;
u64 d = seg[h][i / B] << (63 - i % B);
if (!d) {
i = i / B - 1;
continue;
}
i -= __builtin_clzll(d);
for (int g = h - 1; g >= 0; g--) {
i *= B;
i += topbit(seg[g][i / B]);
}
return i;
}
return -1;
}
bool any(int l, int r) { return next(l) < r; }
// [l, r)
template <typename F>
void enumerate(int l, int r, F f) {
for (int x = next(l); x < r; x = next(x + 1)) f(x);
}
void reset() {
enumerate(0, n, [&](int i) -> void { erase(i); });
}
string to_string() {
string s(n, '?');
for (int i = 0; i < n; ++i) s[i] = ((*this)[i] ? '1' : '0');
return s;
}
};
#line 1 "ds/csr.hpp"
template <typename T>
struct CSR {
int n;
bool prepared;
vc<int> ptr;
vc<int> I;
vc<T> dat;
CSR(int n = 0) : n(n), prepared(false) {}
void reserve(int n) { dat.reserve(n); }
void add(int i, const T& x) {
assert(0 <= i && i < n && !prepared);
I.eb(i), dat.eb(x);
}
void build() {
assert(!prepared);
prepared = 1;
ptr.assign(n + 1, 0);
for (auto& i : I) ptr[1 + i]++;
FOR(i, len(ptr) - 1) ptr[i + 1] += ptr[i];
vc<T> tmp(len(dat));
FOR(k, len(dat)) {
int i = I[k];
tmp[ptr[i]++] = dat[k];
}
swap(dat, tmp);
ptr.pop_back();
ptr.insert(ptr.begin(), 0);
I.clear();
}
struct range {
T *first, *last;
T* begin() const { return first; }
T* end() const { return last; }
bool empty() const { return first == last; }
int size() const { return last - first; }
};
range operator[](int i) {
assert(prepared);
return range{dat.data() + ptr[i], dat.data() + ptr[i + 1]};
}
};
#line 6 "string/enumerate_occurrences.hpp"
// T[i] distinct が必要
// T[i] が S に現れる位置を昇順列挙
// call f(i, vc<int>&pos)
// O(T + Slog^2S + Ssqrt(T))
template <typename STRING, int SIGMA = 26, int off = 'a', typename F>
void enumerate_occurrences(STRING S, vc<STRING> T, F f) {
Trie<SIGMA> trie;
FOR(i, len(T)) trie.add(T[i], off);
trie.calc_suffix_link();
int n = trie.n_node;
Graph<int, 1> G(n);
FOR(i, 1, n) G.add(trie.nodes[i].suffix_link, i);
G.build();
Tree<decltype(G)> tree(G);
vc<int> TID(n, -1);
FOR(i, len(T)) { TID[trie.words[i]] = i; }
CSR<int> csr(n);
{
int v = 0;
FOR(i, len(S)) {
v = trie.nodes[v].nxt[S[i] - off];
csr.add(v, i);
}
}
csr.build();
FastSet FS(len(S));
vc<int> nxt(len(S));
vc<int> pos;
auto dfs = [&](auto& dfs, int h) -> void {
auto path = tree.heavy_path_at(h);
for (auto& v : path) {
for (auto& e : G[v]) {
if (tree.head[e.to] != h) dfs(dfs, e.to);
}
}
FS.reset();
auto ins = [&](int i) -> void {
int a = FS.prev(i), b = FS.next(i);
if (a != -1) nxt[a] = i;
nxt[i] = b;
FS.insert(i);
};
auto ins_v = [&](int v) -> void {
for (int i : csr[v]) ins(i);
};
int prv = -1;
FOR_R(k, len(path)) {
int v = path[k];
ins_v(v);
int L = 0, R = 0;
if (prv != -1) L = tree.RID[prv], R = tree.RID[v];
FOR(i, L, R) ins_v(tree.V[i]);
prv = v;
int t = TID[v];
if (t != -1) {
int M = len(T[t]);
pos.clear();
for (int i = FS.next(0); i < len(S); i = nxt[i]) {
// [i-M+1,i]
pos.eb(i - M + 1);
}
f(t, pos);
}
}
};
dfs(dfs, 0);
}